메뉴 건너뛰기




Volumn 416, Issue 2-3, 2006, Pages 270-287

Nonnegative matrix factorization and I-divergence alternating minimization

Author keywords

Alternating minimization; Approximate factorization; Auxiliary function; Convergence; I divergence; Lifting; Nonnegative matrix factorization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTION EVALUATION; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING;

EID: 33646910575     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2005.11.012     Document Type: Article
Times cited : (60)

References (16)
  • 1
    • 0000546609 scopus 로고
    • I-divergence geometry of probability distributions and minimization problems
    • Csiszár I. I-divergence geometry of probability distributions and minimization problems. Ann. Prob. 3 (1975) 146-158
    • (1975) Ann. Prob. , vol.3 , pp. 146-158
    • Csiszár, I.1
  • 2
    • 0001560954 scopus 로고
    • Information geometry and alternating minimization procedures
    • Csiszár I., and Tusnády G. Information geometry and alternating minimization procedures. Statist. Decisions 1 supplement issue (1984) 205-237
    • (1984) Statist. Decisions , vol.1 , Issue.SUPPL. issue , pp. 205-237
    • Csiszár, I.1    Tusnády, G.2
  • 3
    • 7444224120 scopus 로고    scopus 로고
    • On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
    • Catral M., Han L., Neumann M., and Plemmons R.J. On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices. Linear Algebra Appl. 393 (2004) 107-126
    • (2004) Linear Algebra Appl. , vol.393 , pp. 107-126
    • Catral, M.1    Han, L.2    Neumann, M.3    Plemmons, R.J.4
  • 4
    • 0028532769 scopus 로고
    • Archetypal analysis
    • Cutler A., and Breiman L. Archetypal analysis. Technometrics 36 (1994) 338-347
    • (1994) Technometrics , vol.36 , pp. 338-347
    • Cutler, A.1    Breiman, L.2
  • 5
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the EM algorithm. With discussion
    • Dempster A.P., Laird N.M., and Rubin D.B. Maximum likelihood from incomplete data via the EM algorithm. With discussion. J. Roy. Statist. Soc. Ser. B 39 1 (1977) 1-38
    • (1977) J. Roy. Statist. Soc. Ser. B , vol.39 , Issue.1 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 6
    • 84939131364 scopus 로고    scopus 로고
    • L. Finesso, P.J.C. Spreij, Approximate realization of finite Hidden Markov Chains, in: Proceedings of the 2002 IEEE Information Theory Workshop, 90-93, Bangalore, India, 2002.
  • 7
    • 33646915933 scopus 로고    scopus 로고
    • L. Finesso, P.J.C. Spreij, Approximate nonnegative matrix factorization via alternating minimization, in: Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems (MTNS2004), Leuven, July 5-9, 2004. Available from: .
  • 8
    • 33646902611 scopus 로고    scopus 로고
    • M. Hazewinkel, On positive vectors, positive matrices and the specialization order, CWI report PM-R8407 (1984).
  • 9
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by non-negative matrix factorization
    • Lee D.D., and Sebastian Seung H.S. Learning the parts of objects by non-negative matrix factorization. Nature 401 (1999) 788-791
    • (1999) Nature , vol.401 , pp. 788-791
    • Lee, D.D.1    Sebastian Seung, H.S.2
  • 10
    • 84898964201 scopus 로고    scopus 로고
    • Algorithms for non-negative matrix factorization
    • Leen T.K., Dietterich T.G., and Tresp V. (Eds), MIT Press
    • Lee D.D., and Sebastian Seung H.S. Algorithms for non-negative matrix factorization. In: Leen T.K., Dietterich T.G., and Tresp V. (Eds). Advances in Neural and Information Processing Systems vol. 13 (2001), MIT Press 556-562
    • (2001) Advances in Neural and Information Processing Systems , vol.13 , pp. 556-562
    • Lee, D.D.1    Sebastian Seung, H.S.2
  • 11
    • 0021292397 scopus 로고    scopus 로고
    • G. Picci, J.H. van Schuppen, On the weak finite stochastic realization problem, Springer LNCIS, vol. 58, 1984, pp. 237-242.
  • 14
    • 0034448145 scopus 로고    scopus 로고
    • J.A. O'Sullivan, Properties of the information value decomposition, in: Proceedings ISIT 2000, Sorrento, Italy, 2000, p. 491.
  • 15
    • 0002210265 scopus 로고
    • On the convergence properties of the EM algorithm
    • Wu C.J. On the convergence properties of the EM algorithm. Ann. Stat. 11 1 (1983) 95-103
    • (1983) Ann. Stat. , vol.11 , Issue.1 , pp. 95-103
    • Wu, C.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.