ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Neurocomputing
Volume 57, March 2004, Pages 493-499
New Aspects in Neurocomputing: 10th European Symposium on Artificial Neural Networks 2002
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (359 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.neucom.2004.01.002    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Letters

Relative gradient speeding up additive updates for nonnegative matrix factorization

Weixiang Liu Corresponding Author Contact Information, E-mail The Corresponding Author, Nanning Zheng and Xi Li

Institute of Artificial Intelligence and Robotics, Xi'an Jiaotong University, Xi'an, Shaanxi Province 710049, PR China

Available online 18 February 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

There exist two kinds of iterative updates for nonnegative matrix factorization: additive and multiplicative. The former does not take into consideration the characteristic of the parameter space of the constrained optimization while the latter holds the nonnegativity well. The relative gradient has better convergence rate than the ordinary gradient, and has been successfully used for neural learning, especially for blind source separation and independent component analysis. This paper applies the relative gradient to speed up the additive updates for nonnegative matrix factorization according to square Euclidean error. The primary experiments on synthetic and real datasets demonstrate the effectiveness of the proposed method.

Author Keywords: Author Keywords: Nonnegative matrix factorization; Relative gradient; Additive updates; Multiplicative updates

Article Outline

1. Introduction
2. Nonnegative matrix factorization and iterative updates
3. Relative gradient method for NMF
4. Experimental results
5. Conclusions and future work
Acknowledgements
References


Neurocomputing
Volume 57, March 2004, Pages 493-499
New Aspects in Neurocomputing: 10th European Symposium on Artificial Neural Networks 2002
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.