Abstract
Traditional graph-based semi-supervised learning can not capture both the global and local structures of the data exactly. In this paper, we propose a novel low rank and weighted sparse graph. First, we utilize exact low rank representation by the nuclear norm and Forbenius norm to capture the global subspace structure. Meanwhile, we build the weighted sparse regularization term with shape interaction information to capture the local linear structure. Then, we employ the linearized alternating direction method with adaptive penalty to solve the objective function. Finally, the graph is constructed by an effective post-processing method. We evaluate the proposed method by performing semi-supervised classification experiments on ORL, Extended Yale B and AR face database. The experimental results show that our approach improves the accuracy of semi-supervised learning and achieves the state-of-the-art performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zhu, X.: Semi-supervised Learning Literature Survey. Technical report, University of Wisconsin, Madison (2006)
Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: Advances in Neural Information Processing Systems, pp. 321–328. MIT Press, Cambridge (2004)
Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using gaussian fields and harmonic functions. In: Proceedings of the 20th International Conference on Machine Learning, pp. 912–919. AAAI Press, Washington, DC (2003)
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., Ma, Y.: Robust recovery of subspace structures by low-rank representation. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 171–184 (2013)
Zhuang, L., Gao, H., Lin, Z., Ma, Y., Zhang, X., Yu, N.: Non-negative low rank and sparse graph for semi-supervised learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2328–2335. IEEE Press, Providence (2012)
Zheng, Y., Zhang, X., Yang, S., Jiao, L.: Low-rank representation with local constraint for graph construction. Neurocomputing 122, 398–405 (2013)
Tang, K., Liu, R., Su, Z., Zhang, J.: Structure-constrained low-rank representation. IEEE Trans. Neural Netw. Learn. Systems 25(12), 2167–2179 (2014)
Kang, Z., Peng, C., Cheng, Q.: Robust subspace clustering via smoothed rank approximation. IEEE Signal Process. Lett. 22(11), 2088–2092 (2015)
De Mol, C., De Vito, E., Rosasco, L.: Elastic-net regularization in learning theory. J. Complex. 25(2), 201–230 (2009)
Lin, Z., Liu, R., Su, Z.: Linearized alternating direction method with adaptive penalty for low-rank representation. In: Advances in Neural Information Processing Systems, pp. 612–620. Springer Press, Granada (2011)
Lin, Z., Chen, M., Ma, Y.: The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. Technical report, UILU-ENG-09-2215 (2009)
Li, H., Chen, N., Li, L.: Error analysis for matrix elastic-net regularization algorithms. IEEE Trans. Neural Netw. Learn. Syst. 23(5), 737–748 (2012)
Liu, B., Jing, L., Yu, J., Li, J.: Robust graph learning via constrained elastic-net regularization. Neurocomputing 171, 299–312 (2016)
Cai, J.F., Candès, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956–1982 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Zhang, T., Tang, Z., Qian, B. (2016). A Semi-supervised Learning Algorithm Based on Low Rank and Weighted Sparse Graph for Face Recognition. In: You, Z., et al. Biometric Recognition. CCBR 2016. Lecture Notes in Computer Science(), vol 9967. Springer, Cham. https://doi.org/10.1007/978-3-319-46654-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-46654-5_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46653-8
Online ISBN: 978-3-319-46654-5
eBook Packages: Computer ScienceComputer Science (R0)