Abstract
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to predict the labels of the unlabeled points. Any supervised learning algorithm can be applied to this problem, for instance, Support Vector Machines (SVMs). The problem of our interest is if we can implement a classifier which uses the unlabeled data information in some way and has higher accuracy than the classifiers which use the labeled data only. Recently we proposed a simple algorithm, which can substantially benefit from large amounts of unlabeled data and demonstrates clear superiority to supervised learning methods. Here we further investigate the algorithm using random walks and spectral graph theory, which shed light on the key steps in this algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (in Preparation), http://stat-www.berkeley.edu/users/aldous/RWG/book.html
Belkin, M., Matveeva, I., Niyogi, P.: Regression and regularization on large graphs. Technical report, University of Chicago (2003)
Chan, T., Shen, J.: Variational restoration of non-flat image features: Models and algorithms. SIAM Journal of Applied Mathematics 61(4), 1338–1361 (2000)
Chung, F.: Spectral Graph Theory. Regional Conference Series in Mathematics, vol. 92. American Mathematical Society, Providence (1997)
Devijver, P.A., Kittier, J.: Pattern Recognition: A Statistical Approach. Prentice-Hall, London (1982)
Ham, J., Lee, D.D., Mika, S., Schölkopf, B.: A kernel view of the dimensionality reduction of manifolds. In: Proceedings of the 21st International Conference on Machine Learning (2004)
Ng, Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems 14, MIT Press, Cambridge (2002)
Schölkopf, B., Smola, A.J.: Learning with kernels. MIT Press, Cambridge (2002)
Vapnik, V.N.: Statistical learning theory. Wiley, NY (1998)
Zhang, T., Oles, F.: A probability analysis on the value of unlabeled data for classification problems. In: Proceedings of the 17th International Conference on Machine Learning (2000)
Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: Advances in Neural Information Processing Systems 16, MIT Press, Cambridge (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, D., Schölkopf, B. (2004). Learning from Labeled and Unlabeled Data Using Random Walks. In: Rasmussen, C.E., Bülthoff, H.H., Schölkopf, B., Giese, M.A. (eds) Pattern Recognition. DAGM 2004. Lecture Notes in Computer Science, vol 3175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28649-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-28649-3_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22945-2
Online ISBN: 978-3-540-28649-3
eBook Packages: Springer Book Archive