Asymptotic regularity of subdivisions of Euclidean domains by iterated PCA and iterated 2-means

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  H. Whitney.  Geometric Integration Theory , 1957 .

[3]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[4]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[5]  R. Hardt,et al.  Nodal sets for solutions of elliptic equations , 1989 .

[6]  G. Dunteman.  Principal Components Analysis , 1989 .

[7]  J. A. López del Val,et al.  Principal Components Analysis , 2018, Applied Univariate, Bivariate, and Multivariate Statistics Using Python.

[8]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[9]  K. Burdzy,et al.  On the “Hot Spots” Conjecture of J. Rauch , 1999 .

[10]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[11]  Jianbo Shi,et al.  Learning Segmentation by Random Walks , 2000, NIPS.

[12]  Santosh S. Vempala,et al.  On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[13]  Chris H. Q. Ding,et al.  Spectral Relaxation for K-means Clustering , 2001, NIPS.

[14]  Alan M. Frieze,et al.  Clustering Large Graphs via the Singular Value Decomposition , 2004, Machine Learning.

[15]  U. Feige,et al.  Spectral Graph Theory , 2015 .