Learning from Labeled and Unlabeled Data Using Random Walks

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.

• Type: Conference
• Year: 2004
• Where: DAGM
• Authors: Dengyong Zhou, Bernhard Schölkopf
• Keywords: DAGM 2004, Supervised Learning, Unlabeled Data, Unlabeled Points