Skip to main content

2013 | OriginalPaper | Buchkapitel

79. Decreasing Accelerated Gradient Descent Method for Nonnegative Matrix Factorization

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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 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
2.
Zurück zum Zitat Lee DD, Seung HS (1999) Learning the parts of objects by nonnegative matrix factorization. Nature 401:788–791CrossRef Lee DD, Seung HS (1999) Learning the parts of objects by nonnegative matrix factorization. Nature 401:788–791CrossRef
3.
Zurück zum Zitat Hyvärinen A, Karhunen J, Oja E (2001) Independent component analysis, vol 24. Wiley, New York, pp 624–631CrossRef Hyvärinen A, Karhunen J, Oja E (2001) Independent component analysis, vol 24. Wiley, New York, pp 624–631CrossRef
4.
Zurück zum Zitat Kim PM, Tidor B (2003) Subsystem identification through dimensionality reduction of large-scale gene expression data. Genome Res 13:1706–1718CrossRef Kim PM, Tidor B (2003) Subsystem identification through dimensionality reduction of large-scale gene expression data. Genome Res 13:1706–1718CrossRef
5.
Zurück zum Zitat Guillamet D, Vitria J (2002) Nonnegative matrix factorization for face recognition. Proc Conf Top Artif Intell 35:336–344CrossRef Guillamet D, Vitria J (2002) Nonnegative matrix factorization for face recognition. Proc Conf Top Artif Intell 35:336–344CrossRef
6.
Zurück zum Zitat Mel BW (1999) Computational neuroscience: think positive to find parts. Nature 401:759–760CrossRef Mel BW (1999) Computational neuroscience: think positive to find parts. Nature 401:759–760CrossRef
7.
Zurück zum Zitat Hoyer PO (2004) Nonnegative matrix factorization with sparseness constraints. J Machine Learning Res 5:1457–1469MathSciNetMATH Hoyer PO (2004) Nonnegative matrix factorization with sparseness constraints. J Machine Learning Res 5:1457–1469MathSciNetMATH
8.
Zurück zum Zitat 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 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
9.
Zurück zum Zitat Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. Adv Proc Conf Neural Inform Process Syst 85:556–562 Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. Adv Proc Conf Neural Inform Process Syst 85:556–562
10.
Zurück zum Zitat Chu M, Diele F, Plemmons R, Ragni S (2004) Optimality, computation, and interpretations of nonnegative matrix factorizations. SIAM J Matrix Anal 47:267–269 Chu M, Diele F, Plemmons R, Ragni S (2004) Optimality, computation, and interpretations of nonnegative matrix factorizations. SIAM J Matrix Anal 47:267–269
11.
Zurück zum Zitat 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 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
Metadaten
Titel
Decreasing Accelerated Gradient Descent Method for Nonnegative Matrix Factorization
verfasst von
Furui Liu
Copyright-Jahr
2013
Verlag
Springer London
DOI
https://doi.org/10.1007/978-1-4471-4856-2_79

Neuer Inhalt