MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Semi-supervised learning using Gaussian fields and harmonic functions (2003) [132 citations — 3 self]

Download:
Download as a PDF
by Xiaojin Zhu, Zoubin Ghahramani, John Lafferty
In ICML
http://www.hpl.hp.com/conferences/icml2003/papers/132.pdf
Add To MetaCart

Abstract:

An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, with edge weights encoding the similarity between instances. The learning problem is then formulated in terms of a Gaussian random field on this graph, where the mean of the field is characterized in terms of harmonic functions, and is efficiently obtained using matrix methods or belief propagation. The resulting learning algorithms have intimate connections with random walks, electric networks, and spectral graph theory. We discuss methods to incorporate class priors and the predictions of classifiers obtained by supervised learning. We also propose a method of parameter learning by entropy minimization, and show the algorithm’s ability to perform feature selection. Promising experimental results are presented for synthetic data, digit classification, and text classification tasks. 1.

Citations

965 Normalized cuts and image segmentation – Shi, Malik - 2000
413 Fast approximate energy minimization via graph cuts – Boykov, Veksler, et al. - 2001
380 On spectral clustering: analysis and an algorithm – Ng, Jordan, et al. - 2002
189 Large margin classification using the perceptron algorithm – Freund, Schapire - 1999
160 Random Walks and Electric Networks – Doyle, Snell - 1984
139 Handwritten digit recognition with a backpropagation network – Cun, Boser, et al.
102 Learning from labeled and unlabeled data using graph mincuts – Blum, Chawla - 2001
100 Partially labeled classification with markov random walks – Szummer, Jaakkola - 2001
94 Correctness of belief propagation in Gaussian graphical models of arbitrary topology – Weiss, Freeman - 1999
91 A database for handwritten text recognition research – Hull - 1994
88 A random walks view of spectral segmentation – Meila, Shi - 2001
79 Diffusion kernels on graphs and other discrete input spaces – Kondor, Lafferty - 2002
75 Cluster kernels for semi-supervised learning – Chapelle, Weston, et al. - 1997
40 Using manifold structure for partially labeled classification – Belkin, Niyogi - 2003
19 Learning with labeled and unlabeled data (Technical Report – Seeger - 2001
19 PAC-Bayesian generalization error bounds for Gaussian process classification – Seeger - 2002
13 Discrete Green’s functions – Chung - 2000