Spectral clustering based on the graph p-Laplacian

ACM International Conference Proceeding Series

Volumn 382, Issue , 2009, Pages

  Bühler, Thomas ^a   Hein, Matthias ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT NUMERICAL SCHEMES; EIGENVECTORS; GRAPH LAPLACIAN; NONLINEAR GENERALIZATIONS; P-LAPLACIAN; SPECTRAL CLUSTERING; THRESHOLDING;

EIGENVALUES AND EIGENFUNCTIONS; ROBOT LEARNING;

LAPLACE TRANSFORMS;

EID: 70049085507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1553374.1553385     Document Type: Conference Paper

References (12)

1. Amghibech, S. (2003). Eigenvalues of the discrete p-Laplacian for graphs. Ars Combin., 67, 283-302.
2. Bertsekas, D. (1999). Nonlinear programming. Athena Scientific.
3. Bühler, T., & Hein, M. (2009). Supplementary material.http://www.ml.uni-saarland.de/Publications/BueHei09tech.pdf.
4. Chung, F. (1997). Spectral graph theory. AMS.
5. De Bie, T., & Cristianini, N. (2006). Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems. J.Mach.Learn.Res.,7, 1409-1436.
6. Fiedler, M. (1973). Algebraic connectivity of graphs. Czechoslovak Math. J., 23, 298-305.
7. Hagen, L., & Kahng, A. B. (1991). Fast spectral methods for ratio cut partitioning and clustering. Proc.IEEE Intl. Conf. on Computer-Aided Design, 10-13.
8. Hein, M., Audibert, J.-Y., & von Luxburg, U. (2007). Graph Laplacians and their convergence on random neighborhood graphs. J. Mach. Learn. Res., 8, 1325-1368.
9. Paige, C., & Saunders, M. (1975). Solution of sparse indefinite systems of linear equations. SIAM J. Numer.Anal., 12, 617-629.
10. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Trans.Patt.Anal.Mach.Intell., 22, 888-905.
11. von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17, 395-416.
12. Zhou, D., & Schölkopf, B. (2005). Regularization on discrete spaces. Deutsche Arbeitsgemeinschaft für Mustererkennung-Symposium (pp. 361-368).