메뉴 건너뛰기




Volumn , Issue , 2013, Pages 297-302

ONP-MF: An orthogonal nonnegative matrix factorization algorithm with application to clustering

Author keywords

[No Author keywords available]

Indexed keywords

DATA CLUSTERING; HYPERSPECTRAL UNMIXING; NON-NEGATIVE MATRIX; NON-NEGATIVE MATRIX FACTORIZATION ALGORITHMS; NONNEGATIVE MATRIX FACTORIZATION; TEXT CLUSTERING;

EID: 84887064763     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (16)
  • 1
    • 56349098310 scopus 로고    scopus 로고
    • Algorithms for orthogonal nonnegative matrix factorization
    • S. Choi. Algorithms for orthogonal nonnegative matrix factorization. In Proc. of the Int. Joint Conf. on Neural Networks, pages 1828-1832, 2008.
    • (2008) Proc. of the Int. Joint Conf. On Neural Networks , pp. 1828-1832
    • Choi, S.1
  • 2
    • 77951938107 scopus 로고    scopus 로고
    • Linear and nonlinear projective nonnegative matrix factorization
    • May
    • Z. Yang and E. Oja. Linear and nonlinear projective nonnegative matrix factorization. IEEE Transactions on Neural Networks, 21:734-749, May 2010.
    • (2010) IEEE Transactions On Neural Networks , vol.21 , pp. 734-749
    • Yang, Z.1    Oja, E.2
  • 4
    • 36749071484 scopus 로고    scopus 로고
    • SVD based initialization: A head start for nonnegative matrix factorization
    • C. Boutsidis and E. Gallopoulos. SVD based initialization: A head start for nonnegative matrix factorization. Pattern Recognition, 41(4):1350-1362, 2008.
    • (2008) Pattern Recognition , vol.41 , Issue.4 , pp. 1350-1362
    • Boutsidis, C.1    Gallopoulos, E.2
  • 7
    • 0032216898 scopus 로고    scopus 로고
    • The geometry of algorithms with orthogonality constraints
    • A. Edelman, T. A. Arias, and S.T. Smith. The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl., 20(2):303-353, 1998.
    • (1998) SIAM J. Matrix Anal. Appl , vol.20 , Issue.2 , pp. 303-353
    • Edelman, A.1    Arias, T.A.2    Smith, S.T.3
  • 9
    • 67349093319 scopus 로고    scopus 로고
    • Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method
    • H. Kim and H. Park. Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J. Matrix Anal. Appl., 30(2):713-730, 2008.
    • (2008) SIAM J. Matrix Anal. Appl , vol.30 , Issue.2 , pp. 713-730
    • Kim, H.1    Park, H.2
  • 11
    • 84861639358 scopus 로고    scopus 로고
    • Projection-like retractions on matrix manifolds
    • P.-A. Absil and Jérôme Malick. Projection-like retractions on matrix manifolds. SIAM J. Optim., 22(1):135-158, 2012.
    • (2012) SIAM J. Optim , vol.22 , Issue.1 , pp. 135-158
    • Absil, P.-A.1    Malick, J.2
  • 12
    • 35548969471 scopus 로고    scopus 로고
    • Projected Gradient Methods for Nonnegative Matrix Factorization
    • MIT press
    • C.-J. Lin. Projected Gradient Methods for Nonnegative Matrix Factorization. Neural Computation, 19:2756-2779, 2007. MIT press.
    • (2007) Neural Computation , vol.19 , pp. 2756-2779
    • Lin, C.-J.1
  • 13
    • 84887106776 scopus 로고    scopus 로고
    • D. Saad, editor, Online Learning and Neural Networks. Cambridge University Press
    • L. Bottou. Online algorithms and stochastic approximations. In D. Saad, editor, Online Learning and Neural Networks. Cambridge University Press, 1998.
    • Online Algorithms and Stochastic Approximations , pp. 1998
    • Bottou, L.1
  • 15
    • 24944501423 scopus 로고    scopus 로고
    • Generative model-based document clustering: A comparative study
    • S. Zhong and J. Ghosh. Generative model-based document clustering: a comparative study. Knowledge and Information Systems, 8(3):374-384, 2005.
    • (2005) Knowledge and Information Systems , vol.8 , Issue.3 , pp. 374-384
    • Zhong, S.1    Ghosh, J.2
  • 16


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