Combining labeled and unlabeled data with graph embedding

Abstract Learning the manifold structure of the data is a fundamental problem for pattern analysis. Utilizing labeled and unlabeled data, this paper presents a novel manifold learning algorithm, called semi-supervised aggregative graph embedding (SSAGE). In SSAGE, the graph of the original data is constructed and preserved according to a certain kind of similarity, which takes special consideration of both the local geometry information (of both labeled and unlabeled data) and the class information (of labeled data). The similarity has several good properties which help to discover the true intrinsic structure of the data, and make SSAGE a robust technique for inductive inference. Experimental results suggest that the proposed SSAGE approach provides a better representation of the data and achieves much higher recognition accuracies than Zhou's algorithm [D. Zhou, O. Bousquet, T.N. Lal, J. Weston, B. Scholkopf, Learning with local and global consistency, Advances in Neural Information Processing Systems, vol. 16, MIT Press, Cambridge, MA, 2003] and PCA.

[1]  Avinash C. Kak,et al.  PCA versus LDA , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Keinosuke Fukunaga,et al.  Introduction to Statistical Pattern Recognition , 1972 .

[3]  Yuxiao Hu,et al.  Face recognition using Laplacianfaces , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[6]  Mikhail Belkin,et al.  Semi-Supervised Learning on Riemannian Manifolds , 2004, Machine Learning.