Filippone, M., Camastra, F., Masulli, F. and Rovetta, S.. "A survey of kernel and spectral methods for clustering." Pattern recognition 41 , no. 1 (2008): 176--190.

Symeonidis, Panagiotis, Nanopoulos, Alexandros and Manolopoulos, Yannis. "Tag recommendations based on tensor dimensionality reduction." Paper presented at the meeting of the RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems, New York, NY, USA, 2008.

Luxburg, Ulrike. "A tutorial on spectral clustering." Statistics and Computing 17 , no. 4 (2007): 395--416.

Newman, MEJ. "Finding community structure in networks using the eigenvectors of matrices." Physical Review E 74 , no. 3 (2006): 36104.

Newman, MEJ. "Modularity and community structure in networks." Proceedings of the National Academy of Sciences 103 , no. 23 (2006): 8577--8582.

Dhillon, Inderjit S., Guan, Yuqiang and Kulis, Brian A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts. (TR-04-25) , University of Texas Dept. of Computer Science (2005). .

White, S. and Smyth, P.. "A spectral clustering approach to finding communities in graph." (2005): .

Estrada, E. and Rodriguez-Velázquez, J.A.. "Spectral measures of bipartivity in complex networks." SIAM Rev Phys Rev E 72 (2003): 046105.

Verma, D. and Meila, M.. "A comparison of spectral clustering algorithms." University of Washington, Tech. Rep. UW-CSE-03-05-01 (2003): .

Dhillon, Inderjit S.. "Co-clustering documents and words using bipartite spectral graph partitioning." Paper presented at the meeting of the KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, 2001.

Ng, Andrew Y., Jordan, Michael I. and Weiss, Yair. "On spectral clustering: Analysis and an algorithm." Paper presented at the meeting of the Advances in Neural Information Processing Systems 14, 2001.

Spielman, Daniel A. and Teng, Shang Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. , University of California at Berkeley , Berkeley, CA, USA (1996). .

Alpert, Charles J., Kahng, Andrew B. and zen Yao, So. "Spectral partitioning: The more eigenvectors, the better." Paper presented at the meeting of the Proc. ACM/IEEE Design Automation Conf, 1995.

Chan, Pak K., Schlag, Martine D. F. and Zien, Jason Y.. "Spectral K-way ratio-cut partitioning and clustering.." IEEE Trans. on CAD of Integrated Circuits and Systems 13 , no. 9 (1994): 1088-1096.

Pothen, A., Simon, H.D. and Liou, K.P.. "Partitioning Sparse Matrices with Eigenvectors of Graphs." SIAM J. MATRIX ANAL. APPLIC. 11 , no. 3 (1990): 430--452.

Donath, W.E. and Hoffman, A.J.. "Lower bounds for the partitioning of graphs." IBM Journal of Research and Development 17 , no. 5 (1973): 420--425.