Multiple Sample Data Spectroscopic Clustering of Large Datasets Using Nyström Extension

References

• Achlioptas, D., and Frank, M. (2001), “Fast Computation of Low Rank Matrix Approximations,” in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 611–618.
   Google Scholar
• Baker, C. T.H. (1977), The Numerical Treatment of Integral Equations, Oxford: Clarendon Press.
   Google Scholar
• Breiman, L. (1996a), “Bagging Predictors,” Machine Learning, 24, 123–140.
   Web of Science ®Google Scholar
• Breiman, L. (1996b), “Heuristics of Instability and Stabilization in Model Selection,” The Annals of Statistics, 24, 2350–2383.
   Web of Science ®Google Scholar
• Breiman, L., Friedman, J., Olshen, R., and Stone, C. (1984), Classification and Regression Trees, Belmont, CA: Wadsworth.
   Google Scholar
• Bühlmann, P., and Yu, B. (2002), “Analyzing Bagging,” The Annals of Statistics, 30, 927–961.
   Web of Science ®Google Scholar
• Cullum, J.K., and Willoughby, R.A. (2002), Lanczos Algorithms for Large Symmetric Eigenvalue Computations (Vol. 1), Philadelphia, PA: Society for Industrial and Applied Mathematics.
   Google Scholar
• Delves, L.M., and Mohamed, J.L. (1985), Computational Methods for Integral Equations, Cambridge: Cambridge University Press.
   Google Scholar
• Dhillon, I., Guan, Y., and Kulis, B. (2005), “A Unified View of Kernel K-means, Spectral Clustering, and Graph Partitioning,” Technical Report UTCS TF-04-25, University of Texas at Austin.
   Google Scholar
• Drineas, P., and Mahoney, M.W. (2005), “On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning,” Journal of Machine Learning Research, 6, 2153–2175.
   Web of Science ®Google Scholar
• Fowlkes, C., Belongie, S., Chung, F., and Malik, J. (2004), “Spectral Grouping Using the Nyström Method,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2), 214–225.
   PubMed Web of Science ®Google Scholar
• Fowlkes, C., Belongie, S., and Malik, J. (2001), “Efficient Spatiotemporal Grouping Using the Nyström Method,” in Proceedings of 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 231–238.
   Google Scholar
• Martin, D., Fowlkes, C., Tal, D., and Malik, J. (2001), “A Database of Human Segmented Natural Images and Its Application to Evaluating Segmentation Algorithms and Measuring Ecological Statistics,” in Proceedings of the 8th International Conference on Computer Vision, Vol. 21, pp. 416–423.
   Google Scholar
• Meila, M., and Shi, J. (2001), “A Random Walks View of Spectral Segmentation,” in Proceedings of International Conference on Artificial Intelligence and Statistics (AISTAT).
   Google Scholar
• Ng, A., Jordan, M., and Weiss, Y. (2004), “On Spectral Clustering: Analysis and an Algorithm,” Advances in Neural Information Processing Systems, 14, 955–962.
   Google Scholar
• Perona, P., and Freeman, W. (1998), “A Factorization Approach to Grouping,” in Proceedings of European Conference on Computer Vision (ECCV), pp. 655–670.
   Google Scholar
• Rand, W.M. (1971), “Objective Criteria for the Evaluation of Clustering Methods,” Journal of the American Statistical Association, 66(336), 846–850.
   Web of Science ®Google Scholar
• Scott, G., and Longuet-Higgins, H. (1990), “Feature Grouping by Relocalisation of Eigenvectors of Proximity Matrix,” in Proceedings of British Machine Vision Conference.
   Google Scholar
• Shi, J., and Malik, J. (2000), “Normalized Cuts and Image Segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888–905.
   Web of Science ®Google Scholar
• Shi, T., Belkin, M., and Yu, B. (2008), “Data Spectroscopy: Learning Mixture Models Using Eigenspaces of Convolution Operators,” in Proceedings of the 25th Annual International Conference on Machine Learning (ICML 2008), eds. A. McCallum and S. Roweis, Eastbourne: Omnipress, pp. 936–943.
   Google Scholar
• (2009), “Data Spectroscopy: Eigenspace of Convolution Operators and Clustering,” The Annals of Statistics, 37(6B), 3960–3984.
   Web of Science ®Google Scholar
• Shi, T., and Yu, B. (2006), “Binning in Gaussian Kernel Regularization,” Statistica Sinica, 16, 541–567.
   Web of Science ®Google Scholar
• Tibshirani, R., Walther, G., and Hastie, T. (2001), “Estimating the Number of Clusters in a Data Set via the Gap Statistic,” Journal of the Royal Statistical Society, Series B, 63(2), 411–423.
   Google Scholar
• Luxburg, U. (2007), “A Tutorial on Spectral Clustering,” Statistics and Computing, 17(4), 395–416.
   Web of Science ®Google Scholar
• Luxburg, U., Belkin, M., and Bousquet, O. (2008), “Consistency of Spectral Clustering,” The Annals of Statistics, 36(2), 555–586.
   Web of Science ®Google Scholar
• Weiss, Y. (1999), “Segmentation Using Eigenvectors: A Unifying View,” in International Conference on Computer Vision.
   Google Scholar
• Williams, C.K.I., Rasmussen, C. E., Schwaighofer, A., and Tresp, V. (2002), “Observations on the Nyström Method for Gaussian Process Prediction,” Technical Report, University of Edinburgh.
   Google Scholar
• Williams, C. K.I., and Seeger, M. (2001), “Using the Nyström Method to Speed Up Kernel Machines,” in Annual Advances in Neural Information Processing Systems, Vol. 21, pp. 682–688.
   Google Scholar
• Zhang, H., Fritts, J.E., and Goldman, S.A. (2008), “Image Segmentation Evaluation: A Survey of Unsupervised Methods,” Computer Vision and Image Understanding, 110(2), 260–280.
   Web of Science ®Google Scholar