Filippone, M. ; Camastra, F. ; Masulli, F. ; Rovetta, S.:
{A survey of kernel and spectral methods for clustering}.
In: Pattern recognition,
41
(2008),
Nr. 1,
S. 176--190
Symeonidis, Panagiotis ; Nanopoulos, Alexandros ; Manolopoulos, Yannis:
Tag recommendations based on tensor dimensionality reduction.
In: RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems.
New York, NY, USA
: ACM,
2008. - ISBN
978-1-60558-093-7,
S. 43--50
Luxburg, Ulrike:
A tutorial on spectral clustering.
In: Statistics and Computing,
17
(2007),
Nr. 4,
S. 395--416
Newman, MEJ:
{Finding community structure in networks using the eigenvectors of matrices}.
In: Physical Review E,
74
(2006),
Nr. 3,
S. 36104
Newman, MEJ:
{Modularity and community structure in networks}.
In: Proceedings of the National Academy of Sciences,
103
(2006),
Nr. 23,
S. 8577--8582
Dhillon, Inderjit S. ; Guan, Yuqiang ; Kulis, Brian
; University of Texas Dept. of Computer Science (Hrsg.):
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts.
TR-04-25,
2005
White, S. ; Smyth, P.:
{A spectral clustering approach to finding communities in graph}
(2005)
Estrada, E. ; Rodriguez-Velázquez, J.A.:
{Spectral measures of bipartivity in complex networks}.
In: SIAM Rev Phys Rev E,
72
(2003),
S. 046105
Verma, D. ; Meila, M.:
{A comparison of spectral clustering algorithms}.
In: University of Washington, Tech. Rep. UW-CSE-03-05-01
(2003)
Dhillon, Inderjit S.:
Co-clustering documents and words using bipartite spectral graph partitioning.
In: KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining.
New York, NY, USA
: ACM Press,
2001. - ISBN
158113391X,
S. 269--274
Ng, Andrew Y. ; Jordan, Michael I. ; Weiss, Yair:
On spectral clustering: Analysis and an algorithm.
In: Advances in Neural Information Processing Systems 14
: MIT Press,
2001,
S. 849--856
Spielman, Daniel A. ; Teng, Shang
; (Hrsg.):
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes.
Berkeley, CA, USA,
1996
Alpert, Charles J. ; Kahng, Andrew B. ; zen Yao, So:
Spectral partitioning: The more eigenvectors, the better.
In: Proc. ACM/IEEE Design Automation Conf,
1995,
S. 195--200
Chan, Pak K. ; Schlag, Martine D. F. ; Zien, Jason Y.:
Spectral K-way ratio-cut partitioning and clustering..
In: IEEE Trans. on CAD of Integrated Circuits and Systems,
13
(1994),
Nr. 9,
S. 1088-1096
Pothen, A. ; Simon, H.D. ; Liou, K.P.:
{Partitioning Sparse Matrices with Eigenvectors of Graphs}.
In: SIAM J. MATRIX ANAL. APPLIC.,
11
(1990),
Nr. 3,
S. 430--452
Donath, W.E. ; Hoffman, A.J.:
{Lower bounds for the partitioning of graphs}.
In: IBM Journal of Research and Development,
17
(1973),
Nr. 5,
S. 420--425