Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut

References

• Azzalini, A., and Menardi, G. (2014), “Clustering via Nonparametric Density Estimation: The R Package pdfCluster,” Journal of Statistical Software, 57, 1–26.
   PubMed Web of Science ®Google Scholar
• Baroni, E., van der Hofstad, R., and Komjáthy, J. (2016), “Tight Fluctuations of Weight-Distances in Random Graphs With Infinite-Variance Degrees,” arXiv no. 1609.07269.
   Google Scholar
• Campello, R. J., Moulavi, D., and Sander, J. (2013), “Density-Based Clustering Based on Hierarchical Density Estimates,” in Pacific-Asia Conference on Knowledge Discovery and Data Mining, Berlin, Heidelberg: Springer, pp. 160–172.
   Google Scholar
• Chacón, J. E., and Duong, T. (2013), “Data-Driven Density Derivative Estimation, With Applications to Nonparametric Clustering and Bump Hunting,” Electronic Journal of Statistics, 7, 499–532. DOI: 10.1214/13-EJS781.
   Web of Science ®Google Scholar
• Dheeru, D., and Karra Taniskidou, E. (2017), “UCI Machine Learning Repository,” available at https://archive.ics.uci.edu/ml/datasets.html.
   Google Scholar
• Friedman, J., Hastie, T., and Tibshirani, R. (2001), The Elements of Statistical Learning, Springer Series in Statistics (Vol. 1), New York, NY: Springer-Verlag.
   Google Scholar
• Hagen, L., and Kahng, A. B. (1992), “New Spectral Methods for Ratio Cut Partitioning and Clustering,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11, 1074–1085. DOI: 10.1109/43.159993.
   Web of Science ®Google Scholar
• Hartigan, J. A., and Wong, M. A. (1979), “Algorithm as 136: A k-Means Clustering Algorithm,” Journal of the Royal Statistical Society, Series C, 28, 100–108. DOI: 10.2307/2346830.
   Google Scholar
• Hofmeyr, D. P. (2017), “Clustering by Minimum Cut Hyperplanes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 39, 1547–1560. DOI: 10.1109/TPAMI.2016.2609929.
   PubMed Web of Science ®Google Scholar
• Hofmeyr, D. P. (2018), “Degrees of Freedom and Model Selection for kmeans Clustering,” arXiv no. 1806.02034.
   Google Scholar
• Hubert, L., and Arabie, P. (1985), “Comparing Partitions,” Journal of Classification, 2, 193–218. DOI: 10.1007/BF01908075.
   Web of Science ®Google Scholar
• Kaufman, L., and Rousseeuw, P. J. (2009), Finding Groups in Data: An Introduction to Cluster Analysis (Vol. 344), Hoboken, NJ: Wiley.
   Google Scholar
• Lee, K.-C., Ho, J., and Kriegman, D. J. (2005), “Acquiring Linear Subspaces for Face Recognition Under Variable Lighting,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 27, 684–698.
   PubMed Web of Science ®Google Scholar
• Menardi, G., and Azzalini, A. (2014), “An Advancement in Clustering via Nonparametric Density Estimation,” Statistics and Computing, 24, 753–767. DOI: 10.1007/s11222-013-9400-x.
   Web of Science ®Google Scholar
• Narayanan, H., Belkin, M., and Niyogi, P. (2006), “On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts,” in Advances in Neural Information Processing Systems, pp. 1025–1032.
   Google Scholar
• Ng, A. Y., Jordan, M. I., and Weiss, Y. (2001), “On Spectral Clustering: Analysis and an Algorithm,” in Advances in Neural Information Processing Systems, pp. 849–856.
   Google Scholar
• Pham, D. T., Dimov, S. S., and Nguyen, C. D. (2005), “Selection of K in K-Means Clustering,” Proceedings of the Institution of Mechanical Engineers, Part C, 219, 103–119. DOI: 10.1243/095440605X8298.
   Web of Science ®Google Scholar
• R Core Team (2018), R: A Language and Environment for Statistical Computing, Vienna, Austria: R Foundation for Statistical Computing.
   Google Scholar
• Rinaldo, A., and Wasserman, L. (2010), “Generalized Density Clustering,” The Annals of Statistics, 38, 2678–2722. DOI: 10.1214/10-AOS797.
   Web of Science ®Google Scholar
• Shi, J., and Malik, J. (2000), “Normalized Cuts and Image Segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, 888–905.
   Web of Science ®Google Scholar
• Silverman, B. W. (2018), Density Estimation for Statistics and Data Analysis, New York: Routledge.
   Google Scholar
• Strehl, A., and Ghosh, J. (2002), “Cluster Ensembles—A Knowledge Reuse Framework for Combining Multiple Partitions,” Journal of Machine Learning Research, 3, 583–617.
   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, 411–423. DOI: 10.1111/1467-9868.00293.
   Google Scholar
• Trillos, N. G., Slepcev, D., Von Brecht, J., Laurent, T., and Bresson, X. (2016), “Consistency of Cheeger and Ratio Graph Cuts,” The Journal of Machine Learning Research, 17, 6268–6313.
   Web of Science ®Google Scholar
• Vapnik, V. N., and Chervonenkis, A. Y. (2015), “On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities,” in Measures of Complexity, Cham: Springer, pp. 11–30.
   Google Scholar
• von Luxburg, U. (2007), “A Tutorial on Spectral Clustering,” Statistics and Computing, 17, 395–416. DOI: 10.1007/s11222-007-9033-z.
   Web of Science ®Google Scholar
• Wagner, D., and Wagner, F. (1993), Between Min Cut and Graph Bisection, Berlin, Heidelberg: Springer.
   Google Scholar
• Zelnik-Manor, L., and Perona, P. (2004), “Self-Tuning Spectral Clustering,” in Advances in Neural Information Processing Systems, pp. 1601–1608.
   Google Scholar