Empirical Inference Conference Paper 2007

Transductive Classification via Local Learning Regularization

The idea of local learning, classifying a particular point based on its neighbors, has been successfully applied to supervised learning problems. In this paper, we adapt it for Transductive Classification (TC) problems. Specifically, we formulate a Local Learning Regularizer (LL-Reg) which leads to a solution with the property that the label of each data point can be well predicted based on its neighbors and their labels. For model selection, an efficient way to compute the leave-one-out classification error is provided for the proposed and related algorithms. Experimental results using several benchmark datasets illustrate the effectiveness of the proposed approach.

Author(s): Wu, M. and Schölkopf, B.
Book Title: JMLR Workshop and Conference Proceedings Volume 2: AISTATS 2007
Journal: Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS 2007)
Pages: 628-635
Year: 2007
Month: March
Day: 0
Editors: M Meila and X Shen
Bibtex Type: Conference Paper (inproceedings)
Event Name: 11th International Conference on Artificial Intelligence and Statistics
Event Place: San Juan, Puerto Rico
Digital: 0
Electronic Archiving: grant_archive
Language: en
Organization: Max-Planck-Gesellschaft
School: Biologische Kybernetik
Links:

BibTex

@inproceedings{4271,
  title = {Transductive Classification via Local Learning Regularization},
  journal = {Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS 2007)},
  booktitle = {JMLR Workshop and Conference Proceedings Volume 2: AISTATS 2007},
  abstract = {The idea of local learning, classifying a particular point based on its neighbors, has been successfully applied to supervised learning problems. In this paper, we adapt it for Transductive Classification (TC) problems. Specifically, we formulate a Local Learning Regularizer (LL-Reg) which leads to a solution with the property that the label of each data point can be well predicted based on its neighbors and their labels. For model selection, an efficient way to compute the leave-one-out classification error is provided for the proposed and related algorithms. Experimental results using several benchmark datasets illustrate the effectiveness of the proposed approach.},
  pages = {628-635},
  editors = {M Meila and X Shen},
  organization = {Max-Planck-Gesellschaft},
  school = {Biologische Kybernetik},
  month = mar,
  year = {2007},
  slug = {4271},
  author = {Wu, M. and Sch{\"o}lkopf, B.},
  month_numeric = {3}
}