{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T11:06:55Z","timestamp":1760267215186},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T00:00:00Z","timestamp":1364342400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s11075-013-9704-0","type":"journal-article","created":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T10:06:06Z","timestamp":1364292366000},"page":"251-274","source":"Crossref","is-referenced-by-count":6,"title":["Nonnegative rank factorization\u2014a heuristic approach via rank reduction"],"prefix":"10.1007","volume":"65","author":[{"given":"Bo","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew M.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moody T.","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,27]]},"reference":[{"issue":"4","key":"9704_CR1","doi-asserted-by":"crossref","first-page":"2020","DOI":"10.1214\/aop\/1022677559","volume":"27","author":"I B\u00e1r\u00e1ny","year":"1999","unstructured":"B\u00e1r\u00e1ny, I.: Sylvester\u2019s question: the probability that n points are in convex position. Ann. Probab. 27(4), 2020\u20132034 (1999)","journal-title":"Ann. Probab."},{"key":"9704_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0024-3795(02)00250-1","volume":"363","author":"F Barioli","year":"2003","unstructured":"Barioli, F., Berman, A.: The maximal cp-rank of rank k completely positive matrices. Linear Algebra Appl. 363, 17\u201333 (2003). Special issue on nonnegative matrices, M-matrices and their generalizations (Oberwolfach 2000)","journal-title":"Linear Algebra Appl."},{"issue":"12","key":"9704_CR3","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1016\/j.laa.2009.02.034","volume":"431","author":"LB Beasley","year":"2009","unstructured":"Beasley, L.B., Laffey, T.J.: Real rank versus nonnegative rank. Linear Algebra Appl. 431(12), 2330\u20132335 (2009)","journal-title":"Linear Algebra Appl."},{"key":"9704_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative Matrices in the Mathematical Sciences, Classics in Applied Mathematics, vol. 9","author":"A Berman","year":"1994","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences, Classics in Applied Mathematics, vol. 9. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1994). Revised Reprint of the 1979 Original"},{"issue":"1","key":"9704_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.laa.2006.04.001","volume":"419","author":"A Berman","year":"2006","unstructured":"Berman, A., Rothblum, U.G.: A note on the computation of the CP-rank. Linear Algebra Appl. 419(1), 1\u20137 (2006)","journal-title":"Linear Algebra Appl."},{"key":"9704_CR6","doi-asserted-by":"crossref","DOI":"10.1142\/5273","volume-title":"Completely Positive Matrices","author":"A Berman","year":"2003","unstructured":"Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific Publishing Co. Inc., River Edge (2003)"},{"key":"9704_CR7","volume-title":"Nonlinear Programming, 2nd edn","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)"},{"issue":"4","key":"9704_CR8","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1137\/110825455","volume":"32","author":"C Bocci","year":"2011","unstructured":"Bocci, C., Carlini, E., Rapallo, F.: Perturbation of matrices and nonnegative rank with a view toward statistical models. SIAM J. Matrix Anal. Appl. 32(4), 1500\u20131512 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"9704_CR9","doi-asserted-by":"crossref","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. Chemom. 11(5), 393\u2013401 (1997)","journal-title":"J. Chemom."},{"key":"9704_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0024-3795(81)90272-X","volume":"35","author":"SL Campbell","year":"1981","unstructured":"Campbell, S.L., Poole, G.D.: Computing nonnegative rank factorizations. Linear Algebra Appl. 35, 175\u2013182 (1981)","journal-title":"Linear Algebra Appl."},{"key":"9704_CR11","unstructured":"Chu, M.T., Diele, F., Plemmons, R.J., Ragni, S.: Optimality, computation and interpretation of nonnegative matrix factorizations. Available online at http:\/\/www4.ncsu.edu\/mtchu\/Research\/Papers\/nnmf.ps (2005)"},{"issue":"4","key":"9704_CR12","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1137\/1037124","volume":"37","author":"MT Chu","year":"1995","unstructured":"Chu, M.T., Funderlic, R.E., Golub, G.H.: A rank-one reduction formula and its applications to matrix factorizations. SIAM Rev. 37(4), 512\u2013530 (1995)","journal-title":"SIAM Rev."},{"key":"9704_CR13","first-page":"428","volume":"20","author":"MT Chu","year":"1999","unstructured":"Chu, M.T., Funderlic, R.E., Golub, G.H.: Rank modifications of semidefinite matrices associated with a secant update formula. SIAM J. Matrix Anal. Appl. 20, 428\u2013436 (1999, electronic)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"9704_CR14","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1137\/070680436","volume":"30","author":"MT Chu","year":"2008","unstructured":"Chu, M.T., Lin, M.M.: Low-dimensional polytope approximation and its applications to nonnegative matrix factorization. SIAM J. Sci. Comput. 30(3), 1131\u20131155 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"9704_CR15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0024-3795(79)90158-7","volume":"24","author":"RE Cline","year":"1979","unstructured":"Cline, R.E., Funderlic, R.E.: The rank of a difference of matrices and associated generalized inverses. Linear Algebra Appl. 24, 185\u2013215 (1979)","journal-title":"Linear Algebra Appl."},{"key":"9704_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0024-3795(93)90224-C","volume":"190","author":"JE Cohen","year":"1993","unstructured":"Cohen, J.E., Rothblum, U.G.: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices. Linear Algebra Appl. 190, 149\u2013168 (1993)","journal-title":"Linear Algebra Appl."},{"key":"9704_CR17","volume-title":"Proc. 17th Ann. Conf. Neural Information Processing Systems. NIPS","author":"D Donoho","year":"2003","unstructured":"Donoho, D., Stodden, V.: When does nonnegative matrix factorization give a correct decomposition into parts? In: Proc. 17th Ann. Conf. Neural Information Processing Systems. NIPS, Stanford University, Stanford, CA (2003)"},{"key":"9704_CR18","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0024-3795(97)00302-9","volume":"271","author":"L Elsner","year":"1998","unstructured":"Elsner, L., Nabben, R., Neumann, M.: Orthogonal bases that lead to symmetric nonnegative matrices. Linear Algebra Appl. 271, 323\u2013343 (1998)","journal-title":"Linear Algebra Appl."},{"key":"9704_CR19","unstructured":"Gillis, N.: Nonnegative matrix factorization: complexity, algorithms and applications. Ph.D. thesis, Universit\u00e9 catholique de Louvain (2011)"},{"issue":"11","key":"9704_CR20","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1016\/j.laa.2012.06.038","volume":"437","author":"N Gillis","year":"2012","unstructured":"Gillis, N., Glineur, F.: On the geometric interpretation of the nonnegative rank. Linear Algebra Appl. 437(11), 2685\u20132712 (2012)","journal-title":"Linear Algebra Appl."},{"key":"9704_CR21","unstructured":"Goemans, M.X.: Smallest compact formulation for the permutahedron (2009, preprint)"},{"key":"9704_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(83)90162-3","volume":"55","author":"J Hannah","year":"1983","unstructured":"Hannah, J., Laffey, T.J.: Nonnegative factorization of completely positive matrices. Linear Algebra Appl. 55, 1\u20139 (1983)","journal-title":"Linear Algebra Appl."},{"key":"9704_CR23","volume-title":"Receptor Modeling for Air Quality Management","author":"PK Hopke","year":"1991","unstructured":"Hopke, P.K.: Receptor Modeling for Air Quality Management. Elsevier, Amsterdam (1991)"},{"key":"9704_CR24","volume-title":"The Theory of Matrices in Numerical Analysis","author":"AS Householder","year":"1975","unstructured":"Householder, A.S.: The Theory of Matrices in Numerical Analysis. Dover Publications Inc., New York (1975). Reprint of 1964 edition"},{"key":"9704_CR25","unstructured":"Hoyer, P.O.: Nonnegative sparse coding. In: Proc. IEEE Workshop Neural Networks for Signal Processing. Martigny (2002)"},{"key":"9704_CR26","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer, P.O.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457\u20131469 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9704_CR27","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/S0036144598340483","volume":"42","author":"L Hubert","year":"2000","unstructured":"Hubert, L., Meulman, J., Heiser, W.: Two purposes for matrix factorization: a historical appraisal. SIAM Rev. 42(1), 68\u201382 (2000, electronic)","journal-title":"SIAM Rev."},{"issue":"1","key":"9704_CR28","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1080\/0308108021000023471","volume":"51","author":"SK Jain","year":"2003","unstructured":"Jain, S.K., Tynan, J.: Nonnegative rank factorization of a nonnegative matrix A with $A\\sp \\dagger A\\geq 0$ . Linear Multilinear Algebra 51(1), 83\u201395 (2003)","journal-title":"Linear Multilinear Algebra"},{"key":"9704_CR29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0024-3795(81)90018-5","volume":"38","author":"MW Jeter","year":"1981","unstructured":"Jeter, M.W., Pye, W.C.: A note on nonnegative rank factorizations. Linear Algebra Appl. 38, 171\u2013173 (1981)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"9704_CR30","first-page":"37","volume":"32","author":"MW Jeter","year":"1982","unstructured":"Jeter, M.W., Pye, W.C.: Some nonnegative matrices without nonnegative rank factorizations. Ind. Math. 32(1), 37\u201341 (1982)","journal-title":"Ind. Math."},{"key":"9704_CR31","first-page":"429","volume":"3","author":"T Kawamoto","year":"2000","unstructured":"Kawamoto, T., Hotta, K., Mishima, T., Fujiki, J., Tanaka, M., Kurita, T.: Estimation of single tones from chord sounds using non-negative matrix factorization. Neural Netw World 3, 429\u2013436 (2000)","journal-title":"Neural Netw World"},{"issue":"2","key":"9704_CR32","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9704_CR33","volume-title":"Introduction to Geometric Probability. Lezioni Lincee. [Lincei Lectures]","author":"DA Klain","year":"1997","unstructured":"Klain, D.A., Rota, G.C.: Introduction to Geometric Probability. Lezioni Lincee. [Lincei Lectures]. Cambridge University Press, Cambridge (1997)"},{"key":"9704_CR34","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971217","volume-title":"Solving Least Squares Problems, Classics in Applied Mathematics, vol. 15","author":"CL Lawson","year":"1995","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems, Classics in Applied Mathematics, vol. 15. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1995). Revised Reprint of the 1974 Original"},{"key":"9704_CR35","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"9704_CR36","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems, vol. 13, pp. 556\u2013562 (2001)"},{"key":"9704_CR37","volume-title":"On calculating maximum rank one underapproximations for positive arrays. Tech. rep., Division of Biostatistics","author":"B Levin","year":"1985","unstructured":"Levin, B.: On calculating maximum rank one underapproximations for positive arrays. Tech. rep., Division of Biostatistics, Columbia University, New York (1985)"},{"issue":"3","key":"9704_CR38","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.laa.2010.03.038","volume":"433","author":"MM Lin","year":"2010","unstructured":"Lin, M.M., Chu, M.T.: On the nonnegative rank of Euclidean distance matrices. Linear Algebra Appl. 433(3), 681\u2013689 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"9704_CR39","first-page":"854","volume":"8","author":"P Paatero","year":"1999","unstructured":"Paatero, P.: The multilinear engine\u2014a table-driven, least squares program for solving multilinear problems, including the n-way parallel factor analysis model. J. Comput. Graph. Stat. 8(4), 854\u2013888 (1999)","journal-title":"J. Comput. Graph. Stat."},{"key":"9704_CR40","doi-asserted-by":"crossref","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. Environmetrics 5, 111\u2013126 (1994)","journal-title":"Environmetrics"},{"key":"9704_CR41","doi-asserted-by":"crossref","first-page":"140","DOI":"10.13001\/1081-3810.1067","volume":"8","author":"N Shaked-Monderer","year":"2001","unstructured":"Shaked-Monderer, N.: Minimal cp-matrices. ELA 8, 140\u2013157 (2001)","journal-title":"ELA"},{"key":"9704_CR42","first-page":"2","volume":"12","author":"N Shaked-Monderer","year":"2004","unstructured":"Shaked-Monderer, N.: A note on the cp-rank of matrices generated by a soules matrix. ELA 12, 2\u20135 (2004)","journal-title":"ELA"},{"key":"9704_CR43","unstructured":"Sra, S., Dhillon, I.S.: Nonnegative matrix approximation: algorithms and applications. Tech. rep., Department of Computer Sciences, University of Texas at Austin (2006)"},{"key":"9704_CR44","unstructured":"Sylvester, J.J.: On a special class of questions on the theory of probabilities. Birmingham British Assoc. Rept., pp. 8\u20139 (1865)"},{"issue":"3","key":"9704_CR45","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/1016064","volume":"16","author":"LB Thomas","year":"1974","unstructured":"Thomas, L.B.: Solution to problem 73-14: rank factorization of nonnegative matrices by A. Berman and R. J. Plemmons. SIAM Rev. 16(3), 393\u2013394 (1974)","journal-title":"SIAM Rev."},{"issue":"3","key":"9704_CR46","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/070709967","volume":"20","author":"SA Vavasis","year":"2009","unstructured":"Vavasis, S.A.: On the complexity of nonnegative matrix factorization. SIAM. J. Optim. 20(3), 1364\u20131377 (2009)","journal-title":"SIAM. J. Optim."},{"key":"9704_CR47","volume-title":"Lectures on Matrices","author":"JHM Wedderburn","year":"1964","unstructured":"Wedderburn, J.H.M.: Lectures on Matrices. Dover Publications Inc., New York (1964)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-013-9704-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-013-9704-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-013-9704-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T10:24:26Z","timestamp":1595586266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-013-9704-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,27]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9704"],"URL":"https:\/\/doi.org\/10.1007\/s11075-013-9704-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,27]]}}}