Towards a theoretical foundation for Laplacian-based manifold methods

Journal of Computer and System Sciences

Volumn 74, Issue 8, 2008, Pages 1289-1308

  Belkin, Mikhail ^a   Niyogi, Partha ^b  

^a Ohio State University   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Graph Laplacian; Laplace Beltrami operator; Manifold methods

Indexed keywords

GRAPH THEORY; LAPLACE TRANSFORMS; SEMI-SUPERVISED LEARNING;

DATA REPRESENTATIONS; GRAPH LAPLACIAN; LAPLACE-BELTRAMI OPERATOR; LAPLACIAN-BASED MANIFOLD METHODS; MANIFOLD METHODS; THEORETICAL FOUNDATIONS; THEORETICAL GUARANTEES; THEORY AND PRACTICE;

LEARNING SYSTEMS;

EID: 55449104028     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.08.006     Document Type: Article

References (38)

1. M. Belkin, Problems of learning on manifolds, PhD Dissertation, The University of Chicago, 2003
2. M. Belkin, P. Niyogi, Using manifold structure for partially labeled classification, in: NIPS 2002
3. Belkin M., and Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15 6 (2003) 1373-1396
4. M. Belkin, P. Niyogi, Towards a theoretical foundation for Laplacian-Based manifold methods, in: COLT 2005
5. M. Belkin, P. Niyogi, V. Sindhwani, On manifold regularization, in: AI Stats 2005
6. Y. Bengio, J.-F. Paiement, P. Vincent, O. Delalleau, N. Le Roux, M. Ouimet, Out-of-sample extensions for LLE, isomap, MDS, eigenmaps, and spectral clustering, in: NIPS 2003
7. M. Bernstein, V. de Silva, J.C. Langford, J.B. Tenenbaum, Graph approximations to geodesics on embedded manifolds, Technical Report, 2000
8. O. Bousquet, O. Chapelle, M. Hein, Measure based regularization, in: NIPS 2003
9. O. Chapelle, J. Weston, B. Schoelkopf, Cluster kernels for semi-supervised learning, in: NIPS 2002
10. Chung F.R.K. Spectral Graph Theory. Reg. Conf. Ser. Math. vol. 92 (1997)
11. Coifman R.R., Lafon S., Lee A., Maggioni M., Nadler B., Warner F., and Zucker S. Geometric diffusions as a tool for harmonic analysis and structure definition of data, Parts I and II. Proc. Natl. Acad. Sci. 102 (May 2005) 7426-7438
12. do Carmo M. Riemannian Geometry (1992), Birkhäuser
13. Donoho D.L., and Grimes C.E. Hessian eigenmaps: New locally linear embedding techniques for high-dimensional data. Proc. Natl. Acad. Arts Sci. 100 (2003) 5591-5596
14. E. Gine, V. Kolchinski, Empirical graph Laplacian approximation of Laplace-Beltrami operators: Large sample results, preprint, 2006
15. M. Hein, J.-Y. Audibert, U. von Luxburg, From graphs to manifolds-Weak and strong pointwise consistency of graph Laplacians, in: Proceedings of the 18th Annual Conference on Learning Theory (COLT 2005)
16. M. Meila, J. Shi, Learning segmentation by random walks, in: NIPS 2000
17. F. Memoli, G. Sapiro, Comparing point clouds, IMA Technical Report, 2004
18. S. Lafon, Diffusion maps and geodesic harmonics, PhD thesis, Yale University, 2004
19. U. von Luxburg, M. Belkin, O. Bousquet, Consistency of spectral clustering, Max Planck Institute for Biological Cybernetics Technical Report TR 134, 2004
20. A. Ng, M. Jordan, Y. Weiss, On spectral clustering: Analysis and an algorithm, in: NIPS 2001
21. Niyogi P. Estimating functional maps on Riemannian submanifolds from sampled data. http://www.ipam.ucla.edu/publications/mgaws3/mgaws3_5188.pdf presented at IPAM Workshop on Multiscale Structures in the Analysis of High-Dimensional Data, 2004
22. Grigoryan A. Heat Kernels on Weighted Manifolds and Applications. Contemp. Math. vol. 398 (2006)
23. Niyogi P., Smale S., and Weinberger S. Finding the homology of submanifolds with high confidence from random samples. Discrete Comput. Geom. 39 1-3 (2008) 419-441
24. Rosenberg S. The Laplacian on a Riemannian Manifold (1997), Cambridge University Press
25. Roweis S.T., and Saul L.K. Nonlinear dimensionality reduction by locally linear embedding. Science 290 (2000)
26. A. Smola, R. Kondor, Kernels and regularization on graphs, in: COLT/KW 2003
27. Shi J., and Malik J. Normalized Cuts and Image Segmentation. IEEE Trans. Pattern Anal. Machine Intelligence 22 (2000) 8
28. Singer A. From graph to manifold Laplacian: The convergence rate. Appl. Comput. Harmon. Anal. 21 1 (2006) 135-144
29. D. Spielman, S. Teng, Spectral partitioning works: Planar graphs and finite element meshes, in: FOCS 1996
30. Martin Szummer, Tommi Jaakkola, Partially labeled classification with Markov random walks, in: NIPS 2001
31. Tenenbaum J.B., de Silva V., and Langford J.C. A global geometric framework for nonlinear dimensionality reduction. Science 290 (2000)
32. R. Kannan, S. Vempala, A. Vetta, On clusterings-Good, bad and spectral, Technical Report, Computer Science Department, Yale University, 2000
33. I. Kondor, J. Lafferty, Diffusion kernels on graphs and other discrete input spaces, in: Proc. 19th Intl. Conf. on Machine Learning, ICML
34. Smolyanov O.G., von Weizsäcker H., and Wittich O. Brownian motion on a manifold as limit of stepwise conditioned standard Brownian motions. Stochastic Processes, Physics and Geometry: New Interplays. II: A Volume in Honour of S. Albeverio. Can. Math. Soc. Conf. Proc. vol. 29 (2000), Amer. Math. Soc. 589-602
35. Smolyanov O.G., von Weizsacker H., and Wittich O. Chernoff's theorem and discrete time approximations of Brownian motion on manifolds. Potential Anal. 26 (2007) 1-29
36. D. Zhou, O. Bousquet, T.N. Lal, J. Weston, B. Schoelkopf, Learning with local and global consistency, in: NIPS 2003
37. X. Zhu, J. Lafferty, Z. Ghahramani, Semi-supervised learning using Gaussian fields and harmonic functions, in: ICML 2003
38. A. Zomorodian, G. Carlsson, Computing persistent homology, in: 20th ACM Symposium on Computational Geometry, 2004