Regularization and semi-supervised learning on large graphs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3120, Issue , 2004, Pages 624-638

  Belkin, Mikhail ^a   Matveeva, Irina ^a   Niyogi, Partha ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; PATTERN RECOGNITION; PROBLEM SOLVING;

DATA SETS; GENERALIZATION; NON-TRIVIAL GEOMETRIC STRUCTURES; REGULARIZATION; ALGORITHMIC STABILITY; GENERALIZATION BOUND; GENERALIZATION ERROR; PRACTICAL IMPORTANCE; REGULARIZATION ALGORITHMS; SEMI- SUPERVISED LEARNING; STRUCTURAL INVARIANTS; SYSTEM OF LINEAR EQUATIONS;

LEARNING SYSTEMS; SUPERVISED LEARNING;

EID: 9444289383     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-27819-1_43     Document Type: Conference Paper

References (17)

1. M. Belkin, P. Niyogi, Using Manifold Structure for Partially Labeled Classification Advances in Neural Information Processing Systems 15, MIT Press, 2003
2. A. Blum, S. Chawla, Learning from Labeled and Unlabeled Data using Graph Mincuts, ICML, 2001
3. Bousquet, O., A. Elisseeff, Algorithmic Stability and Generalization Performance. Advances in Neural Information Processing Systems 13, 196-202, MIT Press, 2001
4. Chapelle, O., J. Weston and B. Scholkopf,Cluster Kernels for Semi-Supervised Learning, Advances in Neural Information Processing Systems 15. (Eds.) S. Becker, S. Thrun and K. Obermayer
5. Fan R. K. Chung, Spectral Graph Theory, Regional Conference Series in Mathematics, number 92, 1997
6. L.P. Devroye, T. J. Wagner, Distribution-free Performance Bounds for Potential Function Rules, IEEE Trans. on Information Theory, 25(5): 202-207, 1979.
7. M. Fiedler, Algebraic connectibity of graphs, Czechoslovak Mathematical Journal, 23(98):298-305, 1973.
8. D. Harville, Matrix Algebra From A Statisticinan's Perspective, Springer, 1997.
9. T. Joachims, Transductive Inference for Text Classification using Support Vector Machines,Proceedings of ICML-99, pps 200-209, 1999.
10. Jon M. Kleinberg, Eva Tardos, Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields, J. ACM 49(5): 616-639, 2002.
11. I.R. Kondor, J. Lafferty, Diffusion Kernels on Graphs and Other Discrete Input Spaces, Proceedings of ICML, 2002.
12. K. Nigam, A.K. McCallum, S. Thrun, T. Mitchell, Text Classification from Labeled in Unlabeled Data, Machine Learning 39(2/3), 2000.
13. A. Smola and R. Kondor, Kernels and Regularization on Graphs, COLT/KW 2003.
14. Martin Szummer, Tommi Jaakkola, Partially labeled classification with Markov random walks, Neural Information Processing Systems (NIPS) 2001, vol 14.,.
15. V. Vapnik, Statistical Learning Theory, Wiley, 1998.
16. D. Zhou, O. Bousquet, T.N. Lal, J. Weston and B. Schoelkopf, Learning with Local and Global Consistency, Max Planck Institute for Biological Cybernetics Technical Report, June 2003.
17. X. Zhu, J. Lafferty and Z. Ghahramani, Semi-supervised learning using Gaussian fields and harmonic functions, Machine Learning: Proceedings of the Twentieth International Conference, 2003.