Abstract
Recently, graph-based semi-supervised learning (GB-SSL) has received a lot of attentions in pattern recognition, computer vision and information retrieval. The key parts of GB-SSL are designing loss function and constructing graph. In this paper, we proposed a new semi-supervised learning method where the loss function is modeled via graph constrained non-negative matrix factorization (GCNMF). The model can effectively cooperate the precious label information and the local consistency among samples including labeled and unlabeled data. Meanwhile, an adaptive graph construction method is presented so that the selected neighbors of one sample are as similar as possible, which makes the local consistency be correctly preserved in the graph. The experimental results on real world data sets including object image, face and handwritten digit have shown the superiority of our proposed method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Proceedings of NIPS (2001)
Belkin, M., Niyogi, P., Sindhwani, V.: Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res. 735, 2399–2434 (2006)
Blum, A., Chawla, S.: Learning from labeled and unlabeled data using graph mincuts. In: Proceedings of ICML, pp. 19–26 (2001)
Blum, A., Lafferty, J., Rwebangira, M., Reddy, R.: Semi-supervised learning using randomized mincuts. In: Proceedings of ICML, pp. 13–20 (2004)
Cai, D., He, X., Han, J., Huang, T.: Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. PAMI 33, 1548–1560 (2011)
Jebara, T., Wang, J., Chang, S.: Graph construction and \(b\)-matching for semi-supervised learning. In: Proceedings of ICML (2009)
Lee, D., Seung, H.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)
Lee, D., Seung, S.: Algorithms for non-negative matrix factorization. In: Proceedings of NIPS, pp. 556–562 (2001)
Lin, C.: On the convergence of multiplicative update algorithms for nonnegative matrix factorization. IEEE Trans. on Neural Netw. 18, 1589–1596 (2007)
Liu, H., Wu, Z.: Non-negative matrix factorization with constraints. In: Proceedings of AAAI (2010)
Liu, W., Chang, J.S.: Large graph construction for scalable semi-supervised learning. In: Proceedigs of ICML (2010)
Miller, D., Uyar, H.: A mixture of experts classifier with learning based on both labeled and unlabelled data. In: Proceedings of NIPS, pp. 571–577 (1997)
Nadler, B., Srebro, N., Zhou, X.: Statistical analysis of semi-supervised learning: the limit of infinite unlabelled data. In: Proceedings of NIPS, pp. 1330–1338 (2009)
Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)
Tenenbaum, J., Silva, V., Langford, J.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)
Wang, F., Zhang, T.C., Li, T.: Semi-supervised learning via matrix factorization. In: Proceedings of SIAM DM (2008)
Yan, S., Wang, H.: Semi-supervised learning by sparse representation. In: Proceedings of SIAM DM (2009)
Zhang, T., Oles, F.: A probability analysis on the value of unlabeled data for classification problems. In: Proceedings of ICML, pp. 1191–1198 (2000)
Zhong, S., Ghosh, J.: A comparative study of generative models for document clustering. In: Proceedings of SDW workshop on clustering high dimensional data and its applications, San Francisco, CA (2003)
Zhou, D., Bousquet, O., Lal, T., Scholkopf J.B.: Learning with local and global consistency. In: Proceedings of NIPS, Weston (2004)
Zhou, Z., Li, M.: Semi-supervised learning by disagreement. Knolwl. Inf. Syst. 24, 415–439 (2010)
Zhu, X.: Semi-supervised learning literature survey. Technical Report 15304, University of Wisconsin, Madison (2006)
Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using gaussian fields and harmonic functions. In: Proceedings of ICML (2003)
Zhu, Y., Jing, L., Yu, J.: Text clustering via constrained nonnegative matrix factorization. In: Proceedings of ICDM, pp. 1278–1283 (2010)
Zhuang, L., Gao, H., Huang. J., Yu, N.: Semi-supervised classification via low rank graph. In: Proceedings of ICIG, Huang (2011)
Acknowledgments
This work was supported by the Fundamental Research Funds for the Central Universities (2011JBM030, 2013JBZ005) and the National Natural Science Foundation of China (60905028, 61033013).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Q., Jing, L., Yu, J. (2013). Adaptive Graph Constrained NMF for Semi-Supervised Learning. In: Zhou, ZH., Schwenker, F. (eds) Partially Supervised Learning. PSL 2013. Lecture Notes in Computer Science(), vol 8183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40705-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-40705-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40704-8
Online ISBN: 978-3-642-40705-5
eBook Packages: Computer ScienceComputer Science (R0)