论文信息 - Large-Scale Multiclass Transduction

Large-Scale Multiclass Transduction

We present a method for performing transductive inference on very large datasets. Our algorithm is based on multiclass Gaussian processes and is effective whenever the multiplication of the kernel matrix or its inverse with a vector can be computed sufficiently fast. This holds, for instance, for certain graph and string kernels. Transduction is achieved by varia-tional inference over the unlabeled data subject to a balancing constraint.

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

[2] N. Fisher,et al. Probability Inequalities for Sums of Bounded Random Variables , 1994 .

[3] Thorsten Joachims,et al. Learning to classify text using support vector machines - methods, theory and algorithms , 2002, The Kluwer international series in engineering and computer science.

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

[5] Kristin P. Bennett,et al. Combining support vector and mathematical programming methods for classification , 1999 .

[6] David Barber,et al. Bayesian Classification With Gaussian Processes , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[7] Michael I. Jordan,et al. An Introduction to Variational Methods for Graphical Models , 1999, Machine Learning.

[8] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .

[9] Michael I. Jordan. Graphical Models , 2003 .

[10] Alexander J. Smola,et al. Fast Kernels for String and Tree Matching , 2002, NIPS.

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

[12] Bernhard Schölkopf,et al. Learning from labeled and unlabeled data on a directed graph , 2005, ICML.