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

Symeonidis, P., Nanopoulos, A. & Manolopoulos, Y. (2008). Tag recommendations based on tensor dimensionality reduction. RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems (p./pp. 43--50), New York, NY, USA: ACM. ISBN: 978-1-60558-093-7

Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17, 395--416. doi: http://dx.doi.org/10.1007/s11222-007-9033-z

Newman, M. (2006). Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74, 36104.

Newman, M. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103, 8577--8582.

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

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

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

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

Dhillon, I. S. (2001). Co-clustering documents and words using bipartite spectral graph partitioning. KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (p./pp. 269--274), New York, NY, USA: ACM Press. ISBN: 158113391X

Ng, A. Y., Jordan, M. I. & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 14 (p./pp. 849--856), : MIT Press.

Spielman, D. A. & Teng, S. (1996). Spectral Partitioning Works: Planar Graphs and Finite Element Meshes (). .

Alpert, C. J., Kahng, A. B. & zen Yao, S. (1995). Spectral partitioning: The more eigenvectors, the better. Proc. ACM/IEEE Design Automation Conf (p./pp. 195--200), .

Chan, P. K., Schlag, M. D. F. & Zien, J. Y. (1994). Spectral K-way ratio-cut partitioning and clustering.. IEEE Trans. on CAD of Integrated Circuits and Systems, 13, 1088-1096.

Pothen, A., Simon, H. & Liou, K. (1990). Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. MATRIX ANAL. APPLIC., 11, 430--452.

Donath, W. & Hoffman, A. (1973). Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17, 420--425.