Semi-supervised learning on riemannian manifolds

Machine Learning

Volumn 56, Issue 1-3, 2004, Pages 209-239

  Belkin, Mikhail ^a   Niyogi, Partha ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Graph laplacian; Graph regularization; Laplace operator; Manifold learning; Semi supervised learning

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTER AIDED ANALYSIS; DATA ACQUISITION; GRAPH THEORY; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OBJECT RECOGNITION; RANDOM PROCESSES; SPEECH RECOGNITION; VECTORS;

GRAPH LAPLACIAN; GRAPH REGULARIZATION; LAPLACE OPERATORS; MANIFOLD LEARNING; SEMI-SUPERVISED LEARNING;

LEARNING SYSTEMS;

EID: 3142725535     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MACH.0000033120.25363.1e     Document Type: Article

References (28)

1. Belkln, M., & Niyogi, P. (2003). Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15:6, 1373-1396.
2. Belkin, M., Matveeva, I., & Niyogi, P. (2003). Regression and regularization on large graphs. University of Chicago Computer Science, Technical Report TR-2003-11.
3. Blum, A., & Chawla, S. (2001). Learning from labeled and unlabeled data using graph mincuts. In Proceedings of the International Conference on Machine Learning.
4. Bousquet, O., & Elisseeff, A. (2001). Stability and generalization. Journal of Machine Learning Research.
5. Buser, P. (1982). A note on the isoperimetric constant. Ann. Sci. EC. Norm. Sup. 15.
6. Castelli, V., & Cover, T. M. (1995). On the exponential value of labeled samples. Pattern Recognition Letters, 16.
7. Cheeger, J. (1970). A lower bound for the smallest eigenvalue of the laplacian. In R.C. Gunnings (Ed.), Problems in analysis. Princeton University Press.
8. Chapelle, O., Weston, J., & Scholkopf, B. (2003). Cluster kernels for semi-supervised learning. Advances in Neural Information Processing Systems.
9. Cucker, F., & Smale, S. (2001). On the mathematical foundations of learning. Bulletin of the AMS, 39, 1-49.
10. Chung, F. R. K. (1997). Spectral graph theory. Regional Conference Series in Mathematics, number 92.
11. Chung, F. R. K., Grigor'yan, A., & Yau, S.-T. (2000). Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs. Communications on Analysis and Geometry, 8, 969-1026.
12. Haykin, S. (1999). Neural networks, A comprehensive foundation. Prentice Hall.
13. Joachims, T. (2003). Transductive learning via spectral graph partitioning. In Proceedings of the International Conference on Machine Learning.
14. Kannan, R., Vempala, S., & Adrian Vetta. (2000). On clusterings: Good, bad and spectral. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science.
15. Kondor, R., & Lafferty, J. (2002). Diffusion kernels on graphs and other discrete input spaces. In Proceedings of the International Conference on Machine Learning.
16. Kutin, S., & Niyogi, P. (2002). Almost everywhere algorithmic stability and generalization error. In Proceedings of Uncertainty in Artificial Intelligence.
17. Nigam, K., McCallum, A. K., Thrun, S., & Mitchell, T. (2000). Text classification from labeled and unlabeled data. Machine Learning, 39:2/3.
18. Rosenberg, S. (1997). The Laplacian on a riemmannian manifold. Cambridge University Press.
19. Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290.
20. Schölkopf, B., Smola, A., & Mller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:5.
21. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22:8.
22. Smola, A., & Kondor, R. (2003). Kernels and regularization on graphs. In The Sixteenth Annual Conference on Learning Theory/Tht Seventh Workshop on Kernel Machines.
23. Szummer, M., & Jaakkola, T. (2002). Partially labeled classification with Markov random walks. Advances in Neural Information Processing Systems.
24. Tenenbaum, J. B., de Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290.
25. Tikhonov, A. N., & Arsenin, V. Y. (1977). Solutions of ill-posed problems. W. H. Winston, Washington, D.C.
26. Wahba, G. (1990). Spline models for observational data. Society for Industrial and Applied Mathematics.
27. Zhou, D., Bousquet, O., Lal, T.N., Weston, J., & Schölkopf, B. (2003). Learning with local and global consistency, Max Planck Institute for Biological Cybernetics Technical Report.
28. Zhu, X., Lafferty, J., & Ghahramani, Z. (2003). Semi-supervised learning using Gaussian fields and harmonic functions. In Proceedings of the International Conference on Machine Learning.