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

[Symeonidis et al. 2008] Symeonidis, P., Nanopoulos, A. and Manolopoulos, Y.: "Tag recommendations based on tensor dimensionality reduction"; RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems, ACM, New York, NY, USA (2008), 43--50.

[Luxburg 2007] Luxburg, U.: "A tutorial on spectral clustering"; Statistics and Computing 17 (4) , Kluwer Academic Publishers, Hingham, MA, USA (2007), 395--416.

[Newman 2006] Newman, M.: "Finding community structure in networks using the eigenvectors of matrices"; Physical Review E 74 (3) , APS (2006), 36104.

[Newman 2006] Newman, M.: "Modularity and community structure in networks"; Proceedings of the National Academy of Sciences 103 (23) , National Acad Sciences (2006), 8577--8582.

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

[White and Smyth 2005] White, S. and Smyth, P.: "A spectral clustering approach to finding communities in graph"; SIAM Data Mining (2005).

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

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

[Dhillon 2001] Dhillon, I. S.: "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, ACM Press, New York, NY, USA (2001), 269--274.

[Ng et al. 2001] Ng, A. Y., Jordan, M. I. and Weiss, Y.: "On spectral clustering: Analysis and an algorithm"; Advances in Neural Information Processing Systems 14, MIT Press (2001), 849--856.

[Spielman and Teng 1996] Spielman, D. A. and Teng, S.: "Spectral Partitioning Works: Planar Graphs and Finite Element Meshes", University of California at Berkeley, Berkeley, CA, USA (1996).

[Alpert et al. 1995] Alpert, C. J., Kahng, A. B. and zen Yao, S.: "Spectral partitioning: The more eigenvectors, the better"; Proc. ACM/IEEE Design Automation Conf (1995), 195--200.

[Chan et al. 1994] Chan, P. K., Schlag, M. D. F. and Zien, J. Y.: "Spectral K-way ratio-cut partitioning and clustering."; IEEE Trans. on CAD of Integrated Circuits and Systems 13 (9)  (1994), 1088-1096.

[Pothen et al. 1990] Pothen, A., Simon, H. and Liou, K.: "Partitioning Sparse Matrices with Eigenvectors of Graphs"; SIAM J. MATRIX ANAL. APPLIC. 11 (3)  (1990), 430--452.

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