Abstract
In this paper, by bringing in a user defined nonnegative control matrix to form a new objective function, I modify the update rules correspondingly and propose a novel decreasing accelerated gradient descent method for nonnegative matrix factorization (DAGDM) which can make the matrix of the decomposition results achieve sparse. The control matrix also contains the weighting information, which puts different weight on different parts of the result matrix to be produced. This will provide a control interface of nonnegative matrix factorization to make a sparse and light basis matrix. Experimental results demonstrate the effectiveness of the proposed method.
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
Paatero P, Tapper U (1994) Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environ metrics 5:111–126
Lee DD, Seung HS (1999) Learning the parts of objects by nonnegative matrix factorization. Nature 401:788–791
Hyvärinen A, Karhunen J, Oja E (2001) Independent component analysis, vol 24. Wiley, New York, pp 624–631
Kim PM, Tidor B (2003) Subsystem identification through dimensionality reduction of large-scale gene expression data. Genome Res 13:1706–1718
Guillamet D, Vitria J (2002) Nonnegative matrix factorization for face recognition. Proc Conf Top Artif Intell 35:336–344
Mel BW (1999) Computational neuroscience: think positive to find parts. Nature 401:759–760
Hoyer PO (2004) Nonnegative matrix factorization with sparseness constraints. J Machine Learning Res 5:1457–1469
Liu W, Zheng N, Lu X (2003) Nonnegative matrix factorization for visual coding. Proc IEEE Intl Conf Acoust Speech and Signal Process 746:25–27
Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. Adv Proc Conf Neural Inform Process Syst 85:556–562
Chu M, Diele F, Plemmons R, Ragni S (2004) Optimality, computation, and interpretations of nonnegative matrix factorizations. SIAM J Matrix Anal 47:267–269
Zuo W, Lin Z, Guo ZD (2011) The multiscale competitive code via sparse representation for palmprint verification. Proc Conf Comput Vision and Pattern Recognit 95:36–38
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this paper
Cite this paper
Liu, F. (2013). Decreasing Accelerated Gradient Descent Method for Nonnegative Matrix Factorization. In: Zhong, Z. (eds) Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012. Lecture Notes in Electrical Engineering, vol 216. Springer, London. https://doi.org/10.1007/978-1-4471-4856-2_79
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4856-2_79
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4855-5
Online ISBN: 978-1-4471-4856-2
eBook Packages: EngineeringEngineering (R0)