Graph-based methods for semi-supervised learning use graph to smooth the labels of the points. However, most of them are transductive thus can't give predictions for the unlabeled data outside the training set directly. In this paper, we propose an inductive graph-based algorithm that produces a classifier defined on the whole ambient space. A smooth nonlinear projection between the sample space and the label value space is achieved by local dimension reduction and coordination. The effectiveness of the proposed algorithm is demonstrated by the experiment. © 2010 Springer-Verlag.
CITATION STYLE
Yang, G., Xu, X., Yang, G., & Zhang, J. (2010). Semi-supervised classification by local coordination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6444 LNCS, pp. 517–524). https://doi.org/10.1007/978-3-642-17534-3_64
Mendeley helps you to discover research relevant for your work.