Abstract
Graph-based semi-supervised learning strategy plays an important role in the semi-supervised learning area. This paper presents a novel label propagation algorithm based on nonnegative sparse representation (NSR) for bioinformatics and biometrics. Firstly, we construct a sparse probability graph (SPG) whose nonnegative weight coefficients are derived by nonnegative sparse representation algorithm. The weights of SPG naturally reveal the clustering relationship of labeled and unlabeled samples; meanwhile automatically select appropriate adjacency structure as compared to traditional semi-supervised learning algorithm. Then the labels of unlabeled samples are propagated until algorithm converges. Extensive experimental results on biometrics, UCI machine learning and TDT2 text datasets demonstrate that label propagation algorithm based on NSR outperforms the standard label propagation algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
He, R., Hu, B.G., Zheng, W.S., Guo, Y.Q.: Two-stage Sparse Representation for Robust Recognition on Large-scale Database. In: Twenty-Fourth AAAI Conference on Artificial Intelligence (2010)
Yan, S.C., Wang, H.: Semi-supervised Learning by Sparse Representation. In: SIAM International Conference on Data Mining SDM, pp. 792–801 (2009)
Donoho, D.L., Tanner, J.: Sparse Nonnegative Solution of Underdetermined Linear Equations by Linear Programming. Proc. of the National Academy of Sciences of the United States of America (2005)
Liu, W.F., Pokharel, P.P., Principe, J.C.: Correntropy: Properties and Applications in Non-Gaussian Signal Processing. IEEE Transactions on Signal Processing 55(11), 5286–5298 (2007)
Cortes, C., Mohri, M.: On transductive regression. In: Neural Information Processing Systems, NIPS (2007)
Donoho, D.: Compressed sensing. IEEE Trans. on Information Theory 52(4), 1289–1306 (2006)
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T., Yan, S.: Sparse representation for computer vision and pattern recognition. In: Proc. of IEEE (2009)
Wang, F., Zhang, C.S.: Label propagation through linear neighborhoods. IEEE Trans. on knowledged and data engineering 20(1), 55–67 (2008)
He, R., Zheng, W.S., Hu, B.G.: Maximum correntropy criterion for robust face recognition. Submitted to IEEE Trans. on Pattern Analysis and Machine Intelligence (2009)
Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323–2326 (2000)
Bjorck, A.: A direct method for sparse least-squares problems with lower and upper bounds. Numerische Mathematik 54(1), 19–32 (1988)
Portugal, L.F., Judice, J.J., Vicente, L.N.: A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Mathematics of Computation 63(208), 625–643 (1994)
Zhou, D., Bousquet, O., Lal, T., Weston, J., Schoelkopf, B.: Learning with local and global consistency. In: Neural Information Processing Systems, NIPS (2004)
Bruckstein, A.M., Elad, M., Zibulevsky, M.: On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations. IEEE Trans. on Information Theory 54(11), 4813–4820 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, N., Sang, Y., He, R., Wang, X. (2010). Label Propagation Algorithm Based on Non-negative Sparse Representation. In: Li, K., Jia, L., Sun, X., Fei, M., Irwin, G.W. (eds) Life System Modeling and Intelligent Computing. ICSEE LSMS 2010 2010. Lecture Notes in Computer Science(), vol 6330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15615-1_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-15615-1_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15614-4
Online ISBN: 978-3-642-15615-1
eBook Packages: Computer ScienceComputer Science (R0)