메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1147-1151

Non-negative tensor factorization based on alternating large-scale non-negativity-constrained least squares

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; BLIND SOURCE SEPARATION; CHEMICAL ELEMENTS; CURVE FITTING; DIGITAL IMAGE STORAGE; FEATURE EXTRACTION; LEAST SQUARES APPROXIMATIONS; RHODIUM COMPOUNDS; TENSORS;

EID: 47649132194     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2007.4375705     Document Type: Conference Paper
Times cited : (30)

References (24)
  • 1
    • 0028561099 scopus 로고
    • Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values
    • P. Paatero and U. Tapper, "Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values," Environmetrics, vol. 5, pp. 111-126, 1994.
    • (1994) Environmetrics , vol.5 , pp. 111-126
    • Paatero, P.1    Tapper, U.2
  • 2
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by non-negative matrix factorization
    • D. D. Lee and H. S. Seung, "Learning the parts of objects by non-negative matrix factorization," Nature, vol. 401, pp. 788-791, 1999.
    • (1999) Nature , vol.401 , pp. 788-791
    • Lee, D.D.1    Seung, H.S.2
  • 4
    • 0037810449 scopus 로고    scopus 로고
    • Subsystem identification through dimensionality reduction of large-scale gene expression data
    • P. M. Kim and B. Tidor, "Subsystem identification through dimensionality reduction of large-scale gene expression data," Genome Research, vol. 13, pp. 1706-1718, 2003.
    • (2003) Genome Research , vol.13 , pp. 1706-1718
    • Kim, P.M.1    Tidor, B.2
  • 5
    • 1642529511 scopus 로고    scopus 로고
    • Metagenes and molecular pattern discovery using matrix factorization
    • J. P. Brunet, P. Tamayo, T. R. Golub, and J. P. Mesirov, "Metagenes and molecular pattern discovery using matrix factorization," Proc. Natl Acad. Sci. USA, vol. 101, no. 12, pp. 4164-4169, 2004.
    • (2004) Proc. Natl Acad. Sci. USA , vol.101 , Issue.12 , pp. 4164-4169
    • Brunet, J.P.1    Tamayo, P.2    Golub, T.R.3    Mesirov, J.P.4
  • 6
    • 27744601822 scopus 로고    scopus 로고
    • Improving molecular cancer class discovery through sparse non-negative matrix factorization
    • Y. Gao and G. Church, "Improving molecular cancer class discovery through sparse non-negative matrix factorization," Bioinformatics, vol. 21, no. 21, pp. 3970-3975, 2005.
    • (2005) Bioinformatics , vol.21 , Issue.21 , pp. 3970-3975
    • Gao, Y.1    Church, G.2
  • 7
    • 47649121337 scopus 로고    scopus 로고
    • Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis, 2007, Bioinformatics
    • to appear
    • H. Kim and H. Park, "Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis," 2007, Bioinformatics, to appear.
    • Kim, H.1    Park, H.2
  • 8
    • 84893692774 scopus 로고    scopus 로고
    • Non-negative matrix factorization via alternating non-negativity-constrained least squares and active set method
    • submitted
    • _, "Non-negative matrix factorization via alternating non-negativity-constrained least squares and active set method," 2007, submitted.
    • (2007)
    • Kim, H.1    Park, H.2
  • 9
    • 0001093042 scopus 로고    scopus 로고
    • Algorithms for non-negative matrix factorization
    • Online, Available
    • D. D. Lee and H. S. Seung, "Algorithms for non-negative matrix factorization," in Proceedings of Neural Information Processing Systems, 2000, pp. 556-562. [Online]. Available: http://citeseer.ist.psu. edu/lee01algorithms.html
    • (2000) Proceedings of Neural Information Processing Systems , pp. 556-562
    • Lee, D.D.1    Seung, H.S.2
  • 12
    • 0002740437 scopus 로고
    • Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multimodal factor analysis
    • R. A. Harshman, "Foundations of the PARAFAC procedure: models and conditions for an "explanatory" multimodal factor analysis," UCLA working papers in phonetics, vol. 16, no. 16, pp. 1-84, 1970.
    • (1970) UCLA working papers in phonetics , vol.16 , Issue.16 , pp. 1-84
    • Harshman, R.A.1
  • 13
    • 0642334046 scopus 로고    scopus 로고
    • A fast non-negativity-constrained least squares algorithm
    • R. Bro and S. de Jong, "A fast non-negativity-constrained least squares algorithm," J. Chemometrics, vol. 11, pp. 393-401, 1997.
    • (1997) J. Chemometrics , vol.11 , pp. 393-401
    • Bro, R.1    de Jong, S.2
  • 15
    • 47649113524 scopus 로고
    • User's Guide
    • MATLAB, The MathWorks, Inc
    • MATLAB, User's Guide. Natick, MA 01760: The MathWorks, Inc., 1992.
    • (1992) Natick, MA 01760
  • 18
    • 47649111782 scopus 로고    scopus 로고
    • C. J. Lin, Projected gradient methods for non-negative matrix factorization, Department of Computer Science, National Taiwan University, Tech. Rep. Information and Support Service ISSTECH-95-013, 2005.
    • C. J. Lin, "Projected gradient methods for non-negative matrix factorization," Department of Computer Science, National Taiwan University, Tech. Rep. Information and Support Service ISSTECH-95-013, 2005.
  • 20
    • 34547453725 scopus 로고    scopus 로고
    • Cancer class discovery using non-negative matrix factorization based on alternating non-negativity-constrained least squares
    • May
    • _, "Cancer class discovery using non-negative matrix factorization based on alternating non-negativity-constrained least squares," in Springer Verlag Lecture Notes in Bioinformatics (LNBI), vol. 4463, May 2007, pp. 477-487.
    • (2007) Springer Verlag Lecture Notes in Bioinformatics (LNBI) , vol.4463 , pp. 477-487
    • Kim, H.1    Park, H.2
  • 21
    • 24944500827 scopus 로고    scopus 로고
    • Fast algorithm for the solution of large-scale non-negativity-constrained least squares problems
    • M. H. van Benthem and M. R. Keenan, "Fast algorithm for the solution of large-scale non-negativity-constrained least squares problems," J. Chemometrics, vol. 18, pp. 441-450, 2004.
    • (2004) J. Chemometrics , vol.18 , pp. 441-450
    • van Benthem, M.H.1    Keenan, M.R.2
  • 24
    • 47649100606 scopus 로고    scopus 로고
    • Tensor rank and the ill-posedness of the best low-rank approximation problem
    • to appear
    • V. de Silva and L.-H. Lim, "Tensor rank and the ill-posedness of the best low-rank approximation problem," SIAM J. Matrix Anal. Appl., to appear, 2007.
    • (2007) SIAM J. Matrix Anal. Appl
    • de Silva, V.1    Lim, L.-H.2


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