메뉴 건너뛰기




Volumn 18, Issue 3, 2009, Pages

FastNMF: Highly efficient monotonic fixed-point nonnegative matrix factorization algorithm with good applicability

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ACCURACY; BASIC PROPERTIES; DESIGN PHILOSOPHY; DIMENSIONALITY REDUCTION; EASE OF USE; FIXED-POINT ALGORITHMS; HIGHER EFFICIENCY; LEAST SQUARE; MINIMIZATION PROBLEMS; NON-NEGATIVE FACTORIZATION; NON-NEGATIVE MATRIX FACTORIZATION ALGORITHMS; NONNEGATIVE MATRIX FACTORIZATION;

EID: 80455168744     PISSN: 10179909     EISSN: 1560229X     Source Type: Journal    
DOI: 10.1117/1.3184771     Document Type: Article
Times cited : (30)

References (24)
  • 1
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by nonnegative matrix factorization
    • D. D. Lee and H. S. Seung, "Learning the parts of objects by nonnegative matrix factorization," Nature (London) 401(6755), 788-791 (1999).
    • (1999) Nature (London) , vol.401 , Issue.6755 , pp. 788-791
    • Lee, D.D.1    Seung, H.S.2
  • 2
    • 49449120034 scopus 로고
    • Hierarchical structure in perceptual representation
    • S. E. Palmer, "Hierarchical structure in perceptual representation," Cogn. Psychol. 9(3), 441-474 (1977).
    • (1977) Cogn. Psychol. , vol.9 , Issue.3 , pp. 441-474
    • Palmer, S.E.1
  • 3
    • 0027980942 scopus 로고
    • Recognition of objects and their component parts: Responses of single units in the temporal cortex of the macaque
    • E. Wachsmuth, M. W. Oram, and D. I. Perrett, "Recognition of objects and their component parts: Responses of single units in the temporal cortex of the macaque," Cereb. Cortex 4(5), 509-522 (1994). (Pubitemid 24297014)
    • (1994) Cerebral Cortex , vol.4 , Issue.5 , pp. 509-522
    • Wachsmuth, E.1    Oram, M.W.2    Perrett, D.I.3
  • 5
    • 0000929221 scopus 로고
    • What is the goal of sensory coding?"
    • D. J. Field, "What is the goal of sensory coding?" Neural Comput. 6(4), 559-601 (1994).
    • (1994) Neural Comput. , vol.6 , Issue.4 , pp. 559-601
    • Field, D.J.1
  • 6
    • 12344317125 scopus 로고    scopus 로고
    • Improving non-negative matrix factorizations through structured initialization," Pattern Recogn. 37(11), 2217-2232 (2004).7. O. Okun and H. Priisalu, "Fast nonnegative matrix factorization and its application for protein fold recognition
    • S. Wild, J. Curry, and A. Dougherty, "Improving non-negative matrix factorizations through structured initialization," Pattern Recogn. 37(11), 2217-2232 (2004).7. O. Okun and H. Priisalu, "Fast nonnegative matrix factorization and its application for protein fold recognition," EURASIP J. Appl. Signal Process. 71817 (2006).
    • (2006) EURASIP J. Appl. Signal Process. , pp. 71817
    • Wild, S.1    Curry, J.2    Dougherty, A.3
  • 7
    • 1642488120 scopus 로고    scopus 로고
    • Relative gradient speeding up additive updates for nonnegative matrix factorization
    • DOI 10.1016/j.neucom.2004.01.002, PII S0925231204000049, New Aspects in Neurocomputing: 10th European Symposium on Arti
    • W. Liu, N. Zheng, and X. Li, "Relative gradient speeding up additive updates for nonnegative matrix factorization," Neurocomputing 57, 493-499 (2004). (Pubitemid 38401037)
    • (2004) Neurocomputing , vol.57 , Issue.1-4 , pp. 493-499
    • Liu, W.1    Zheng, N.2    Li, X.3
  • 8
    • 33745765253 scopus 로고    scopus 로고
    • Learning sparse representations by nonnegative matrix factorization and sequential cone programming
    • M. Heiler and C. Schnorr, "Learning sparse representations by nonnegative matrix factorization and sequential cone programming," J. Mach. Learn. Res. 7(7), 1385-1407 (2005).
    • (2005) J. Mach. Learn. Res. , vol.7 , Issue.7 , pp. 1385-1407
    • Heiler, M.1    Schnorr, C.2
  • 9
    • 84864031935 scopus 로고    scopus 로고
    • Generalized nonnegative matrix approximations with Bregman divergences
    • MIT Press, Cambridge, MA
    • I. Dhillon and S. Sra, "Generalized nonnegative matrix approximations with Bregman divergences," in Adv. Neural Inf. Process. Syst. 283-290, MIT Press, Cambridge, MA (2005).
    • (2005) Adv. Neural Inf. Process. Syst. , pp. 283-290
    • Dhillon, I.1    Sra, S.2
  • 13
    • 84898964201 scopus 로고    scopus 로고
    • Algorithms for non-negative matrix factorization
    • D. D. Lee and H. S. Seung, "Algorithms for non-negative matrix factorization," in Adv. Neural Inf. Process. Syst. 2001(13), 556-562 (2001).
    • (2001) Adv. Neural Inf. Process. Syst. , vol.2001 , Issue.13 , pp. 556-562
    • Lee, D.D.1    Seung, H.S.2
  • 14
    • 84900510076 scopus 로고    scopus 로고
    • Non-negative matrix factorization with sparseness constraints
    • P. O. Hoyer, "Non-negative matrix factorization with sparseness constraints," J. Mach. Learn. Res. 5(9), 1457-1469 (2004).
    • (2004) J. Mach. Learn. Res. , vol.5 , Issue.9 , pp. 1457-1469
    • Hoyer, P.O.1
  • 16
    • 0041339710 scopus 로고    scopus 로고
    • Introducing a weighted non-negative matrix factorization for image classification
    • DOI 10.1016/S0167-8655(03)00089-8
    • D. Guillamet, J. Vitrià, and B. Schiele, "Introducing a weighted nonnegative matrix factorization for image classification," Pattern Recogn. Lett. 24(14), 2447-2454 (2003). (Pubitemid 36911088)
    • (2003) Pattern Recognition Letters , vol.24 , Issue.14 , pp. 2447-2454
    • Guillamet, D.1    Vitria, J.2    Schiele, B.3
  • 17
    • 33646181805 scopus 로고    scopus 로고
    • LS-NMF: A modified non-negative matrix factorization algorithm utilizing uncertainty estimates
    • G. L. Wang, A. V. Kossenkov, and M. F. Ochs, "LS-NMF: A modified non-negative matrix factorization algorithm utilizing uncertainty estimates," BMC Bioinf. 7, 175 (2006).
    • (2006) BMC Bioinf. , vol.7 , pp. 175
    • Wang, G.L.1    Kossenkov, A.V.2    Ochs, M.F.3
  • 18
    • 84875600885 scopus 로고
    • ORL face database, at the AT&T (Olivetti) Research Laboratory
    • ORL face database, at the AT&T (Olivetti) Research Laboratory, http://www.cl.cam.ac.uk/Research/DTG/archive/facedatabase.html (1992).
    • (1992)
  • 19
  • 21
    • 84875625392 scopus 로고    scopus 로고
    • MIT CBCL PEDESTRIAN database, at MIT CBCL Center for Biological and Computational Learning
    • MIT CBCL PEDESTRIAN database, at MIT CBCL Center for Biological and Computational Learning, http://cbcl.mit.edu/softwaredatasets/PedestrianData.html (2000).
    • (2000)
  • 22
    • 74449093261 scopus 로고    scopus 로고
    • Fast local algorithms for large scale nonnegative matrix and tensor factorizations
    • A. Cichocki and A.-H. Phan, "Fast local algorithms for large scale nonnegative matrix and tensor factorizations," IEICE Trans. Fundamentals E92-A(3), 708-721 (2009).
    • (2009) IEICE Trans. Fundamentals , vol.E92-A , Issue.3 , pp. 708-721
    • Cichocki, A.1    Phan, A.-H.2
  • 23
    • 37749030729 scopus 로고    scopus 로고
    • Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization
    • A. Cichocki, R. Zdunek, and S. Amari, "Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization," Lect. Notes Comput. Sci. 4666, 169-176 (2007).
    • (2007) Lect. Notes Comput. Sci. , vol.4666 , pp. 169-176
    • Cichocki, A.1    Zdunek, R.2    Amari, S.3


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