Transductive Inference with Graphs

We propose a general regularization framework for transductive inference. The given data are thought of as a graph, where the edges encode the pairwise relationships among data. We develop discrete analysis and geometry on graphs, and then naturally adapt the classical regularization in the continuous case to the graph situation. A new and effective algorithm is derived from this general framework, as well as an approach we developed before.

[1]  Grace Wahba,et al.  Spline Models for Observational Data , 1990 .

[2]  Zoubin Ghahramani,et al.  Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.

[3]  Bernhard Schölkopf,et al.  Learning with Local and Global Consistency , 2003, NIPS.

[4]  Tony F. Chan,et al.  Variational Restoration of Nonflat Image Features: Models and Algorithms , 2001, SIAM J. Appl. Math..

[5]  Bernhard Schölkopf,et al.  Cluster Kernels for Semi-Supervised Learning , 2002, NIPS.

[6]  Alexander J. Smola,et al.  Kernels and Regularization on Graphs , 2003, COLT.

[7]  Thorsten Joachims,et al.  Transductive Learning via Spectral Graph Partitioning , 2003, ICML.

[8]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[9]  Tommi S. Jaakkola,et al.  Partially labeled classification with Markov random walks , 2001, NIPS.

[10]  F. Lin,et al.  Mappings minimizing the Lp norm of the gradient , 1987 .

[11]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[12]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[13]  A. N. Tikhonov,et al.  Solutions of ill-posed problems , 1977 .

[14]  Bernhard Schölkopf,et al.  Learning Theory and Kernel Machines , 2003, Lecture Notes in Computer Science.

[15]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[16]  J. Eells,et al.  Harmonic Mappings of Riemannian Manifolds , 1964 .

[17]  Avrim Blum,et al.  Learning from Labeled and Unlabeled Data using Graph Mincuts , 2001, ICML.

[18]  J. Jost Riemannian geometry and geometric analysis , 1995 .