1. Some methods for classification and analysis of multivariate observations;MacQueen,1967
2. D. Arthur, S. Vassilvitskii, K-means++: the advantages of careful seeding, in: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 1027–1035.
3. BIRCH: an efficient data clustering method for very large databases;Zhang;SIGMOD Rec.,1996
4. A tutorial on spectral clustering;von Luxburg;Stat. Comput.,2007
5. M. Ester, H.-P. Kriegel, J. Sander, X.W. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, USA, August 2-4, 1996, pp. 226–231.