Diffusion maps - A probabilistic interpretation for spectral embedding and clustering algorithms

Lecture Notes in Computational Science and Engineering

Volumn 58, Issue , 2008, Pages 238-260

  Nadler, Boaz ^a   Lafon, Stephane ^b,c   Coifman, Ronald ^c   Kevrekidis, Ioannis G ^d  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b GOOGLE INC   (United States)

^c YALE UNIVERSITY   (United States)

^d Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; DATA SETS; DIFFUSION DISTANCE; DIFFUSION MAPS; EIGENVECTORS; EMBEDDING ALGORITHMS; EUCLIDEAN DISTANCE; HIGH DIMENSIONAL DATASETS; MULTISCALE; MULTISCALE METHOD; NONLINEAR DIMENSIONALITY REDUCTION; NORMALIZED GRAPH LAPLACIAN; PROBABILISTIC ANALYSIS; PROBABILISTIC INTERPRETATION; RANDOM WALK; SPECTRAL CLUSTERING; TWO-POINT;

CLUSTER ANALYSIS; DATA VISUALIZATION; DIFFUSION; FACE RECOGNITION; LAPLACE TRANSFORMS; RELAXATION PROCESSES; SOIL STRUCTURE INTERACTIONS;

CLUSTERING ALGORITHMS;

EID: 77952984416     PISSN: 14397358     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-73750-6_10     Document Type: Conference Paper

References (40)

1. Schölkopf, B. and Smola, A.J., and Müller, K.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10 (5), 1299-1319 (1998)
2. Weiss, Y.: Segmentation using eigenvectors: a unifying view. ICCV (1999)
3. Shi, J. and Malik, J.: Normalized cuts and image segmentation. PAMI, 22 (8), 888-905, (2000)
4. Ding, C., He, X., Zha, H., Gu, M., and Simon, H.: A min-max cut algorithm for graph partitioning and data clustering. In: Proc. IEEE International Conf. Data Mining, 107-114, (2001)
5. Cristianini, N., Shawe-Taylor, J., and Kandola, J.: Spectral kernel methods for clustering. NIPS, 14 (2002)
6. Belkin, M. and Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. NIPS, 14 (2002)
7. Belkin, M. and Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15, 1373-1396 (2003)
8. Ng, A.Y., Jordan, M., and Weiss, Y.: On spectral clustering, analysis and an algorithm. NIPS, 14 (2002)
9. Zhu, X., Ghahramani, Z., and Lafferty J.: Semi-supervised learning using Gaussian fields and harmonic functions. In: Proceedings of the 20th international conference on machine learning (2003)
10. Saerens, M., Fouss, F., Yen L., and Dupont, P.: The principal component analysis of a graph and its relationships to spectral clustering. In: Proceedings of the 15th European Conference on Machine Learning, ECML, 371-383 (2004)
11. Diffusion Maps, Spectral Embedding, and Clustering Algorithms 259
12. Coifman, R.R., Lafon, S.: Diffusion Maps. Appl. Comp. Harm. Anal., 21, 5-30 (2006)
13. Coifman, R.R., Lafon, S., Lee, A.B., Maggioni, M., Nadler, B., Warner, F., and Zucker S.: Geometric diffusion as a tool for harmonic analysis and structure definition of data, parts I and II. Proc. Nat. Acad. Sci., 102 (21), 7426-7437 (2005)
14. Berard, P., Besson, G., and Gallot, S.: Embedding Riemannian manifolds by their heat kernel. Geometric and Functional Analysis, 4 (1994)
15. Meila, M., Shi, J.: A random walks view of spectral segmentation. AI and Statistics (2001)
16. Yen, L., Vanvyve, D., Wouters, F., Fouss, F., Verleysen M., and Saerens, M.: Clustering using a random-walk based distance measure. In: Proceedings of the 13th Symposium on Artificial Neural Networks, ESANN, 317-324 (2005)
17. Tishby, N. and Slonim, N.: Data Clustering by Markovian Relaxation and the information bottleneck method. NIPS (2000)
18. Chennubhotla, C. and Jepson, A.J.: Half-lives of eigenflows for spectral clustering. NIPS (2002)
19. Harel, D. and Koren, Y.: Clustering spatial data using random walks. In: Proceedings of the 7th ACM Int. Conference on Knowledge Discovery and Data Mining, 281-286. ACM Press (2001)
20. Pons, P. and Latapy, M.: Computing Communities in Large Networks Using Random Walks. In: 20th International Symposium on Computer and Information Sciences (ISCIS'05). LNCS 3733 (2005)
21. Nadler, B., Lafon, S., Coifman, R.R., and Kevrekidis, I.G.: Diffusion maps spectral clustering and eigenfunctions of Fokker-Planck operators. NIPS (2005)
22. Parzen, E.: On estimation of a probability density function and mode. Ann. Math. Stat. 33, 1065-1076 (1962)
23. Lafon, S. and Lee, A.B.: Diffusion maps: A unified framework for dimension reduction, data partitioning and graph subsampling. IEEE Trans. Patt. Anal. Mach. Int., 28 (9), 1393-1403 (2006)
24. Yu, S. and Shi, J.: Multiclass spectral clustering. ICCV (2003)
25. Nadler, B., Lafon, S., Coifman, R.R., and Kevrekidis, I.G.: Diffusion maps, spectral clustering, and the reaction coordinates of dynamical systems. Appl. Comp. Harm. Anal., 21, 113-127 (2006)
26. von Luxburg, U., Bousquet, O., and Belkin, M.: On the convergence of spectral clustering on random samples: the normalized case. NIPS (2004)
27. Belkin, M. and Niyogi, P.: Towards a theoeretical foundation for Laplacian-based manifold methods. COLT (2005)
28. Hein, M., Audibert, J., and von Luxburg, U.: From graphs to manifolds - weak and strong pointwise consistency of graph Laplacians. COLT (2005)
29. Singer, A.: From graph to manifold Laplacian: the convergence rate. Applied and Computational Harmonic Analysis, 21 (1), 135-144 (2006)
30. Belkin, M. and Niyogi, P.: Convergence of Laplacian eigenmaps. NIPS (2006)
31. Gardiner, C.W.: Handbook of Stochastic Methods, 3rd edition. Springer, NY (2004)
32. Risken, H.: The Fokker Planck equation, 2nd edition. Springer NY (1999)
33. Matkowsky, B.J. and Schuss, Z.: Eigenvalues of the Fokker-Planck operator and the approach to equilibrium for diffusions in potential fields. SIAM J. App. Math. 40 (2), 242-254 (1981)
34. Basri, R., Roth, D., and Jacobs, D.: Clustering appearances of 3D objects. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR-98), 414-420 (1998)
35. Roweis, S.T. and Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323-2326 (2000)
36. Kato, T.: Perturbation Theory for Linear Operators, 2nd edition. Springer (1980)
37. Nadler, B. and Galun, M.: Fundamental limitations of spectral clustering. NIPS, 19 (2006)
38. Nadler, B.: Finite Sample Convergence Results for Principal Component Analysis: A Matrix Perturbation Approach, submitted.
39. Zhou, D., Bousquet, O., Navin Lal, T., Weston J., and Scholkopf, B.: Learning with local and global consistency. NIPS, 16 (2004)
40. Kevrekidis, I.G., Gear, C.W., Hummer, G.: Equation-free: The computer-aided analysis of complex multiscale systems. AIChE J. 50 1346-1355 (2004)