[1] Fevzi Alimoglu and Ethem Alpaydin. Methods of combining multiple classifiers based on different representations for pen-based handwriting recognition. In Proceedings of the fifth Turkish artificial intelligence and artificial neural networks symposium (TAINN '96), 1996.
[2] Davide Anguita, Alessandro Ghio, Luca Oneto, Xavier Parra, and Jorge Luis Reyes-Ortiz. A public domain dataset for human activity recognition using smartphones. In 21st European Symposium on Artificial Neural Networks (ESANN'13), 2013.
[3] David Arthur and Sergei Vassilvitskii. K-means++: the advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07), pages 1027-1035, 2007.
[4] Christos Boutsidis, Prabhanjan Kambadur, and Alex Gittens. Spectral clustering via the power method-provably. In 32nd International Conference on Machine Learning (ICML'15), pages 40-48. PMLR, 2015.
[5] Christos Boutsidis and Malik Magdon-Ismail. Deterministic feature selection for k-means clustering. IEEE Transactions on Information Theory, 59(9):6099-6110, 2013.
[6] Anna Choromanska, Tony Jebara, Hyungtae Kim, Mahesh Mohan, and Claire Monteleoni. Fast spectral clustering via the nystrom method. In Algorithmic Learning Theory: 24th International Conference (ALT'13), pages 367-381, 2013.
[7] Fan R K Chung. Spectral graph theory. American Mathematical Society, 1997.
[8] Dan Feldman, Morteza Monemizadeh, and Christian Sohler. A PTAS for k-means clustering based on weak coresets. In Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG'07), pages 11-18, 2007.
[9] Peter W Frey and David J Slate. Letter recognition using holland-style adaptive classifiers. Machine learning, 6:161-182, 1991.
[10] Alexander J. Gates and Yong-Yeol Ahn. The impact of random models on clustering similarity. The Journal of Machine Learning Research, 18(1):3049-3076, 2017.
[11] Gene H Golub and Henk A Van der Vorst. Eigenvalue computation in the 20th century. Journal of Computational and Applied Mathematics, 123(1-2):35-65, 2000.
[12] Charles R. Harris, K. Jarrod Millman, Stéfan J. van der Walt, Ralf Gommers, Pauli Virtanen, David Cournapeau, Eric Wieser, Julian Taylor, Sebastian Berg, Nathaniel J. Smith, Robert Kern, Matti Picus, Stephan Hoyer, Marten H. van Kerkwijk, Matthew Brett, Allan Haldane, Jaime Fernández del Río, Mark Wiebe, Pearu Peterson, Pierre Gérard-Marchant, Kevin Sheppard, Tyler Reddy, Warren Weckesser, Hameer Abbasi, Christoph Gohlke, and Travis E. Oliphant. Array programming with NumPy. Nature, 585(7825):357-362, 2020.
[13] William B Johnson. Extensions of lipschitz mappings into a hilbert space. Contemporary Mathematics, 26:189-206, 1984.
[14] Tapas Kanungo, David M Mount, Nathan S Netanyahu, Christine D Piatko, Ruth Silverman, and Angela Y Wu. A local search approximation algorithm for k-means clustering. In Proceedings of the 18th Annual Symposium on Computational Geometry (SoCG'02), pages 10-18, 2002.
[15] Pavel Kolev and Kurt Mehlhorn. A note on spectral clustering. In 24th Annual European Symposium on Algorithms (ESA'16), pages 1-14, 2016.
[16] Amit Kumar, Yogish Sabharwal, and Sandeep Sen. A simple linear time  $(1 + \epsilon)$ -approximation algorithm for k-means clustering in any dimensions. In 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pages 454-462. IEEE, 2004.
[17] Andrea Lancichinetti, Santo Fortunato, and János Kertész. Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics, 11(3), 2009.
[18] Yann LeCun. The mnist database of handwritten digits. ATT Labs [Online]. Available: http://yann.lecun.com/exdb/mnist, 1998.