Skip to main content
Erschienen in: Journal of Applied Mathematics and Computing 1-2/2013

01.07.2013 | Original Research

Convergence analysis of a non-negative matrix factorization algorithm based on Gibbs random field modeling

verfasst von: Chenxue Yang, Mao Ye, Zijian Liu

Erschienen in: Journal of Applied Mathematics and Computing | Ausgabe 1-2/2013

Einloggen

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

search-config
loading …

Abstract

Non-negative matrix factorization (NMF) is a new approach to deal with the multivariate nonnegative data. Although the classic multiplicative update algorithm can solve the NMF problems, it fails to find sparse and localized object parts. Then a Gibbs random field (GRF) modeling based NMF algorithm, called the GRF-NMF algorithm, try to directly model the prior object structure of the components into the NMF problem. In this paper, the convergence of the GRF-NMF algorithm and its advantages are investigated. Based on a classic model, the equilibrium points are obtained. Some invariant sets are constructed to prepare for the analysis of the convergence of the GRF-NMF algorithm. Then using stability theory of the equilibrium point, the convergence of the algorithm is proved and the convergence conditions of the algorithm are obtained. We theoretically present the advantages of the GRF-NMF algorithm in the end.

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 "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!

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!

Literatur
1.
Zurück zum Zitat Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999) CrossRef Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999) CrossRef
2.
Zurück zum Zitat Paatero, P., Tapper, U.: Positive matrix factorization: a non-negative factor model with optimal utilization of error. Environmetrics 5, 111–126 (1994) CrossRef Paatero, P., Tapper, U.: Positive matrix factorization: a non-negative factor model with optimal utilization of error. Environmetrics 5, 111–126 (1994) CrossRef
3.
Zurück zum Zitat Chu, M., Diele, F., Plemmons, R., Ragni, S.: Optimality, computation, and interpretation of nonnegative matrix factorizations. Unpublished report (2004) Chu, M., Diele, F., Plemmons, R., Ragni, S.: Optimality, computation, and interpretation of nonnegative matrix factorizations. Unpublished report (2004)
4.
Zurück zum Zitat Kim, P.M., Tidor, B.: Subsystem identification through dimensionality reduction of large-scale gene expression data. Genome Res. 13, 1706–1718 (2003) CrossRef Kim, P.M., Tidor, B.: Subsystem identification through dimensionality reduction of large-scale gene expression data. Genome Res. 13, 1706–1718 (2003) CrossRef
5.
Zurück zum Zitat Pauca, V.P., Piper, J., Plemmons, R.J.: Nonnegative matrix factorization for spectral data analysis. Linear Algebra Appl. 416, 29–47 (2006) MathSciNetMATHCrossRef Pauca, V.P., Piper, J., Plemmons, R.J.: Nonnegative matrix factorization for spectral data analysis. Linear Algebra Appl. 416, 29–47 (2006) MathSciNetMATHCrossRef
6.
Zurück zum Zitat Cichocki, A., Zdunek, R., Amari, S.: New algorithms for non-negative matrix factorization in applications to blind source separation. In: ICASSP, pp. 621–625 (2006) Cichocki, A., Zdunek, R., Amari, S.: New algorithms for non-negative matrix factorization in applications to blind source separation. In: ICASSP, pp. 621–625 (2006)
7.
Zurück zum Zitat Gao, Y., Church, G.: Improving molecular cancer class discovery through sparse non-negative matrix factorization. Bioinformatics 21, 3970–3975 (2005) CrossRef Gao, Y., Church, G.: Improving molecular cancer class discovery through sparse non-negative matrix factorization. Bioinformatics 21, 3970–3975 (2005) CrossRef
8.
Zurück zum Zitat Saul, L.K., Sha, F., Lee, D.D.: Statistical signal processing with nonnegativity constraints. In: Proceedings of EuroSpeech, vol. 2, pp. 1001–1004 (2003) Saul, L.K., Sha, F., Lee, D.D.: Statistical signal processing with nonnegativity constraints. In: Proceedings of EuroSpeech, vol. 2, pp. 1001–1004 (2003)
9.
Zurück zum Zitat Shahnaz, F., Berry, M.W., Pauca, V.P., Plemmons, R.: Document clustering using nonnegative matrix factorization. Inf. Process. Manag. 42, 373–386 (2006) MATHCrossRef Shahnaz, F., Berry, M.W., Pauca, V.P., Plemmons, R.: Document clustering using nonnegative matrix factorization. Inf. Process. Manag. 42, 373–386 (2006) MATHCrossRef
10.
Zurück zum Zitat Sha, F., Saul, L.K.: Real-time pitch determination of one or more voices by nonnegative matrix factorization. University of Pennsylvania Scholarly Commons, Departmental Papers (CIS) (2004) Sha, F., Saul, L.K.: Real-time pitch determination of one or more voices by nonnegative matrix factorization. University of Pennsylvania Scholarly Commons, Departmental Papers (CIS) (2004)
11.
Zurück zum Zitat Smaragdis, P., Brown, J.C.: Non-negative matrix factorization for polyphonic music transcription. In: Proceedings of IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, pp. 177–180 (2003) Smaragdis, P., Brown, J.C.: Non-negative matrix factorization for polyphonic music transcription. In: Proceedings of IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, pp. 177–180 (2003)
12.
Zurück zum Zitat Kim, H., Park, H.: Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares. In: Proceedings of the IASTED International Conference on Computational and Systems Biology (CASB2006), pp. 95–100 (2006) Kim, H., Park, H.: Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares. In: Proceedings of the IASTED International Conference on Computational and Systems Biology (CASB2006), pp. 95–100 (2006)
13.
Zurück zum Zitat Brunet, J.P., Tamayo, P., Golub, T.R., Mesirov, J.P.: Metagenes and molecular pattern discovery using matrix factorization. Proc. Natl. Acad. Sci. USA 101, 4164–4169 (2004) CrossRef Brunet, J.P., Tamayo, P., Golub, T.R., Mesirov, J.P.: Metagenes and molecular pattern discovery using matrix factorization. Proc. Natl. Acad. Sci. USA 101, 4164–4169 (2004) CrossRef
14.
Zurück zum Zitat Berry, M., Browne, M., Langville, A., Pauca, P., Plemmons, R.: Algorithms and applications for approximate nonnegative matrix factorization. Comput. Stat. Data Anal. 52, 155–173 (2006) MathSciNetCrossRef Berry, M., Browne, M., Langville, A., Pauca, P., Plemmons, R.: Algorithms and applications for approximate nonnegative matrix factorization. Comput. Stat. Data Anal. 52, 155–173 (2006) MathSciNetCrossRef
15.
Zurück zum Zitat Lin, C.J.: Projected gradient methods for non-negative matrix factorization. In: Tech. Report Information and Support Service ISSTECH, pp. 95–113 (2005) Lin, C.J.: Projected gradient methods for non-negative matrix factorization. In: Tech. Report Information and Support Service ISSTECH, pp. 95–113 (2005)
16.
Zurück zum Zitat Hoyer, P.O., Dayan, P.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457–1469 (2004) MATH Hoyer, P.O., Dayan, P.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457–1469 (2004) MATH
17.
Zurück zum Zitat Li, S.Z., Hou, X.W., Zhang, H.J.: Learning spatially localized, parts-based representation. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Hawaii, pp. 11–13 (2001) Li, S.Z., Hou, X.W., Zhang, H.J.: Learning spatially localized, parts-based representation. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Hawaii, pp. 11–13 (2001)
18.
Zurück zum Zitat Liao, S., Lei, Z., Li, S.Z.: Nonnegative matrix factorization with Gibbs random field modeling. In: IEEE 12th International Conference on Computer Vision Workshops. ICCV Workshops (2009) Liao, S., Lei, Z., Li, S.Z.: Nonnegative matrix factorization with Gibbs random field modeling. In: IEEE 12th International Conference on Computer Vision Workshops. ICCV Workshops (2009)
19.
Zurück zum Zitat Cichocki, A., Zdunek, R.: Multilayer non-negative matrix factorization using project gradient approaches. Int. J. Neural Syst. 17, 431–446 (2007) CrossRef Cichocki, A., Zdunek, R.: Multilayer non-negative matrix factorization using project gradient approaches. Int. J. Neural Syst. 17, 431–446 (2007) CrossRef
20.
Zurück zum Zitat Salakhutdinov, R., Roweis, S.T., Ghahramani, Z.: The convergence of bound optimization algorithms. In: 19th International Conference on Uncertainty in Artificial Intelligence (2003) Salakhutdinov, R., Roweis, S.T., Ghahramani, Z.: The convergence of bound optimization algorithms. In: 19th International Conference on Uncertainty in Artificial Intelligence (2003)
21.
Zurück zum Zitat Lin, C.J.: On the convergence of multiplicative update algorithms for nonnegative matrix factorization. Trans. Neural Netw. 18(6), 1589–1596 (2007) CrossRef Lin, C.J.: On the convergence of multiplicative update algorithms for nonnegative matrix factorization. Trans. Neural Netw. 18(6), 1589–1596 (2007) CrossRef
22.
Zurück zum Zitat Kocic, V.L., Ladas, G.: Global Behavior of Nonlinear Difference Equations of Higher Order. Kluwer Academic, Dordrecht (1953) Kocic, V.L., Ladas, G.: Global Behavior of Nonlinear Difference Equations of Higher Order. Kluwer Academic, Dordrecht (1953)
23.
Zurück zum Zitat Yang, S.M., Yi, Z.: Convergence analysis of non-negative matrix factorization for BSS algorithm. Neural Process. Lett. 31, 45–64 (2010) MathSciNetCrossRef Yang, S.M., Yi, Z.: Convergence analysis of non-negative matrix factorization for BSS algorithm. Neural Process. Lett. 31, 45–64 (2010) MathSciNetCrossRef
24.
25.
Zurück zum Zitat Dai, J., Meyn, S.: Stability and convergence of moments for multiclass queueing networks via fluid limit models. Trans. Autom. Control 40(11), 1889–1904 (1995) MathSciNetMATHCrossRef Dai, J., Meyn, S.: Stability and convergence of moments for multiclass queueing networks via fluid limit models. Trans. Autom. Control 40(11), 1889–1904 (1995) MathSciNetMATHCrossRef
Metadaten
Titel
Convergence analysis of a non-negative matrix factorization algorithm based on Gibbs random field modeling
verfasst von
Chenxue Yang
Mao Ye
Zijian Liu
Publikationsdatum
01.07.2013
Verlag
Springer-Verlag
Erschienen in
Journal of Applied Mathematics and Computing / Ausgabe 1-2/2013
Print ISSN: 1598-5865
Elektronische ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-013-0646-4

Weitere Artikel der Ausgabe 1-2/2013

Journal of Applied Mathematics and Computing 1-2/2013 Zur Ausgabe