{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:51:15Z","timestamp":1770504675018,"version":"3.49.0"},"publisher-location":"London","reference-count":29,"publisher":"Springer London","isbn-type":[{"value":"9781447124368","type":"print"},{"value":"9781447124375","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-1-4471-2437-5_16","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T12:58:27Z","timestamp":1326718707000},"page":"311-326","source":"Crossref","is-referenced-by-count":38,"title":["Fast Nonnegative Tensor Factorization with an Active-Set-Like Method"],"prefix":"10.1007","author":[{"given":"Jingu","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haesun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TKDE.2008.112","volume":"21","author":"E. Acar","year":"2009","unstructured":"Acar, E., Yener, B.: Unsupervised multiway data analysis: A literature survey. IEEE Trans. Knowl. Data Eng. 21(1), 6\u201320 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-1-84800-046-9_8","volume-title":"Survey of Text Mining II: Clustering, Classification, and Retrieval","author":"B.W. Bader","year":"2008","unstructured":"Bader, B.W., Berry, M.W., Browne, M.: Discussion tracking in Enron email using PARAFAC. In: Survey of Text Mining II: Clustering, Classification, and Retrieval, pp. 147\u2013163. Springer, Berlin (2008)"},{"key":"16_CR3","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Scientific, Athena (1999)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/(SICI)1099-128X(199709\/10)11:5<393::AID-CEM483>3.0.CO;2-L","volume":"11","author":"R. Bro","year":"1997","unstructured":"Bro, R., De Jong, S.: A fast non-negativity-constrained least squares algorithm. J. Chem. 11, 393\u2013401 (1997)","journal-title":"J. Chem."},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"J.D. Carroll","year":"1970","unstructured":"Carroll, J.D., Chang, J.J.: Analysis of individual differences in multidimensional scaling via an N-way generalization of \u201cEckart-Young\u201d decomposition. Psychometrika 35(3), 283\u2013319 (1970)","journal-title":"Psychometrika"},{"key":"16_CR6","first-page":"463","volume-title":"Multiway data analysis","author":"J.D. Carroll","year":"1989","unstructured":"Carroll, J.D., Soete, G.D., Pruzansky, S.: Fitting of the latent class model via iteratively reweighted least squares CANDECOMP with nonnegativity constraints. In: Multiway data analysis, pp. 463\u2013472. North-Holland, Amsterdam (1989). http:\/\/portal.acm.org\/citation.cfm?id=120565.120614"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1587\/transfun.E92.A.708","volume":"E92-A","author":"A. Cichocki","year":"2009","unstructured":"Cichocki, A., Phan, A.H.: Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E92-A(3), 708\u2013721 (2009)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"16_CR8","first-page":"169","volume-title":"Lecture Notes in Computer Science","author":"A. Cichocki","year":"2007","unstructured":"Cichocki, A., Zdunek, R., Amari, S.I.: Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization. In: Lecture Notes in Computer Science, vol. 4666, pp. 169\u2013176. Springer, Berlin (2007)"},{"key":"16_CR9","volume-title":"Proceedings of the Irish Signals and Systems Conference","author":"D. FitzGerald","year":"2005","unstructured":"FitzGerald, D., Cranitch, M., Coyle, E.: Non-negative tensor factorisation for sound source separation. In: Proceedings of the Irish Signals and Systems Conference (2005)"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1080\/10556780801996244","volume":"23","author":"M.P. Friedlander","year":"2008","unstructured":"Friedlander, M.P., Hatz, K.: Computing nonnegative tensor factorizations. Comput. Optim. Appl. 23(4), 631\u2013647 (2008). doi:10.1080\/10556780801996244","journal-title":"Comput. Optim. Appl."},{"key":"16_CR11","first-page":"1","volume-title":"UCLA Working Papers in Phonetics","author":"R.A. Harshman","year":"1970","unstructured":"Harshman, R.A.: Foundations of the PARAFAC procedure: Models and conditions for an \u201cexplanatory\u201d multi-modal factor analysis. In: UCLA Working Papers in Phonetics, vol. 16, pp. 1\u201384 (1970)"},{"issue":"5","key":"16_CR12","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/0305-0548(94)90106-6","volume":"21","author":"J.J. J\u00fadice","year":"1994","unstructured":"J\u00fadice, J.J., Pires, F.M.: A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems. Comput. Oper. Res. 21(5), 587\u2013596 (1994)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"16_CR13","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1093\/bioinformatics\/btm134","volume":"23","author":"H. Kim","year":"2007","unstructured":"Kim, H., Park, H.: Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics 23(12), 1495\u20131502 (2007)","journal-title":"Bioinformatics"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/07069239X","volume":"30","author":"H. Kim","year":"2008","unstructured":"Kim, H., Park, H.: Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J. Matrix Anal. Appl. 30(2), 713\u2013730 (2008). doi:10.1137\/07069239X","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"16_CR15","first-page":"1147","volume-title":"Proceedings of IEEE 7th International Conference on Bioinformatics and Bioengineering (BIBE07)","author":"H. Kim","year":"2007","unstructured":"Kim, H., Park, H., Eld\u00e9n, L.: Non-negative tensor factorization based on alternating large-scale non-negativity-constrained least squares. In: Proceedings of IEEE 7th International Conference on Bioinformatics and Bioengineering (BIBE07), vol. 2, pp. 1147\u20131151 (2007)"},{"key":"16_CR16","unstructured":"Kim, J., Park, H.: Sparse nonnegative matrix factorization for clustering. Tech. rep., Georgia Institute of Technology Technical Report GT-CSE-08-01 (2008)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/ICDM.2008.149","volume-title":"Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (ICDM)","author":"J. Kim","year":"2008","unstructured":"Kim, J., Park, H.: Toward faster nonnegative matrix factorization: A new algorithm and comparisons. In: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (ICDM), pp. 353\u2013362 (2008)"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1137\/110821172","volume":"33","author":"J. Kim","year":"2011","unstructured":"Kim, J., Park, H.: Fast nonnegative matrix factorization: An active-set-like method and comparisons. SIAM J. Sci. Comput. 33, 3261 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T.G. Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"16_CR20","volume-title":"Solving Least Squares Problems","author":"C.L. Lawson","year":"1974","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. Prentice Hall, New York (1974)"},{"issue":"6755","key":"16_CR21","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D.D. Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788\u2013791 (1999)","journal-title":"Nature"},{"key":"16_CR22","first-page":"556","volume-title":"Advances in Neural Information Processing Systems","author":"D.D. Lee","year":"2001","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems, vol.\u00a013, pp. 556\u2013562. MIT Press, Cambridge (2001)"},{"issue":"7\u20138","key":"16_CR23","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1002\/cem.1244","volume":"23","author":"L.H. Lim","year":"2009","unstructured":"Lim, L.H., Comon, P.: Nonnegative approximations of nonnegative tensors. J. Chem., 23(7\u20138), 432\u2013441 (2009)","journal-title":"J. Chem."},{"issue":"2","key":"16_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0169-7439(97)00031-2","volume":"38","author":"P. Paatero","year":"1997","unstructured":"Paatero, P.: A weighted non-negative least squares algorithm for three-way PARAFAC factor analysis. Chemom. Intell. Lab. Syst. 38(2), 223\u2013242 (1997)","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"854","DOI":"10.2307\/1390831","volume":"8","author":"P. Paatero","year":"1999","unstructured":"Paatero, P.: The multilinear engine: A table-driven, least squares program for solving multilinear problems, including the n-way parallel factor analysis model. J. Comput. Graph. Stat. 8, 854\u2013888 (1999)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"16_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P. Paatero","year":"1994","unstructured":"Paatero, P., Tapper, U.: Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. EnvironMetrics 5(1), 111\u2013126 (1994)","journal-title":"EnvironMetrics"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/1102351.1102451","volume-title":"ICML \u201905: Proceedings of the 22nd International Conference on Machine Learning","author":"A. Shashua","year":"2005","unstructured":"Shashua, A., Hazan, T.: Non-negative tensor factorization with applications to statistics and computer vision. In: ICML \u201905: Proceedings of the 22nd International Conference on Machine Learning, pp. 792\u2013799. ACM, New York (2005). doi: http:\/\/doi.acm.org\/10.1145\/1102351.1102451"},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/cem.889","volume":"18","author":"M.H. Van Benthem","year":"2004","unstructured":"Van Benthem, M.H., Keenan, M.R.: Fast algorithm for the solution of large-scale non-negativity-constrained least squares problems. J. Chem. 18, 441\u2013450 (2004). doi:10.1002\/cem.889","journal-title":"J. Chem."},{"issue":"12","key":"16_CR29","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/S0167-8655(01)00070-8","volume":"22","author":"M. Welling","year":"2001","unstructured":"Welling, M., Weber, M.: Positive tensor factorization. Pattern Recognit. Lett. 22(12), 1255\u20131261 (2001). doi:10.1016\/S0167-8655(01)00070-8","journal-title":"Pattern Recognit. Lett."}],"container-title":["High-Performance Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-2437-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T00:49:46Z","timestamp":1674521386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-2437-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9781447124368","9781447124375"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-2437-5_16","relation":{},"subject":[],"published":{"date-parts":[[2012]]}}}