Filippone, M.; Camastra, F.; Masulli, F. & Rovetta, S. (2008),
'A survey of kernel and spectral methods for clustering', Pattern recognition
41
(1)
, 176--190
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Symeonidis, P.; Nanopoulos, A. & Manolopoulos, Y. (2008),
Tag recommendations based on tensor dimensionality reduction, in
'RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems'
, ACM, New York, NY, USA
, pp. 43--50
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Luxburg, U. (2007),
'A tutorial on spectral clustering', Statistics and Computing
17
(4)
, 395--416
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Newman, M. (2006),
'Finding community structure in networks using the eigenvectors of matrices', Physical Review E
74
(3)
, 36104
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Newman, M. (2006),
'Modularity and community structure in networks', Proceedings of the National Academy of Sciences
103
(23)
, 8577--8582
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Dhillon, I. S.; Guan, Y. & Kulis, B. (2005),
'A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts'
(TR-04-25)
, Technical report, University of Texas Dept. of Computer Science
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
White, S. & Smyth, P. (2005),
'A spectral clustering approach to finding communities in graph',
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Estrada, E. & Rodriguez-Velázquez, J. (2003),
'Spectral measures of bipartivity in complex networks', SIAM Rev Phys Rev E
72
, 046105
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Verma, D. & Meila, M. (2003),
'A comparison of spectral clustering algorithms', University of Washington, Tech. Rep. UW-CSE-03-05-01
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Dhillon, I. S. (2001),
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'
, ACM Press, New York, NY, USA
, pp. 269--274
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Ng, A. Y.; Jordan, M. I. & Weiss, Y. (2001),
On spectral clustering: Analysis and an algorithm, in
'Advances in Neural Information Processing Systems 14'
, MIT Press,
, pp. 849--856
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Spielman, D. A. & Teng, S. (1996),
'Spectral Partitioning Works: Planar Graphs and Finite Element Meshes'
, University of California at Berkeley
, Berkeley, CA, USA
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Alpert, C. J.; Kahng, A. B. & zen Yao, S. (1995),
Spectral partitioning: The more eigenvectors, the better, in
'Proc. ACM/IEEE Design Automation Conf'
, pp. 195--200
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
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
(9)
, 1088-1096
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pothen, A.; Simon, H. & Liou, K. (1990),
'Partitioning Sparse Matrices with Eigenvectors of Graphs', SIAM J. MATRIX ANAL. APPLIC.
11
(3)
, 430--452
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Donath, W. & Hoffman, A. (1973),
'Lower bounds for the partitioning of graphs', IBM Journal of Research and Development
17
(5)
, 420--425
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]