This paper proposes a multi-class semi-supervised learning algorithm of the graph based method. We make use of the Bayesian framework of Gaussian process to solve this problem. We propose the prior based on the normalized graph Laplacian, and introduce a new likelihood based on softmax function model. Both the transductive and inductive problems are regarded as MAP (Maximum A Posterior) problems. Experimental results show that our method is competitive with the existing semi-supervised transductive and inductive methods. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Song, Y., Zhang, C., & Lee, J. (2006). Graph based multi-class semi-supervised learning using Gaussian process. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4109 LNCS, pp. 450–458). Springer Verlag. https://doi.org/10.1007/11815921_49
Mendeley helps you to discover research relevant for your work.