{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:42:09Z","timestamp":1762868529466,"version":"3.41.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["IIS 1652943, IIS 1849359, CNS 1932482, and CCF 2029543"],"award-info":[{"award-number":["IIS 1652943, IIS 1849359, CNS 1932482, and CCF 2029543"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,6,28]]},"abstract":"<jats:p>Nonnegative Matrix Factorization (NMF) is broadly used to determine class membership in a variety of clustering applications. From movie recommendations and image clustering to visual feature extractions, NMF has applications to solve a large number of knowledge discovery and data mining problems. Traditional optimization methods, such as the Multiplicative Updating Algorithm\u00a0(MUA), solves the NMF problem by utilizing an auxiliary function to ensure that the objective monotonically decreases. Although the objective in MUA converges, there exists no proof to show that the learned matrix factors converge as well. Without this rigorous analysis, the clustering performance and stability of the NMF algorithms cannot be guaranteed. To address this knowledge gap, in this article, we study the factor-bounded NMF problem and provide a solution algorithm with proven convergence by rigorous mathematical analysis, which ensures that both the objective and matrix factors converge. In addition, we show the relationship between MUA and our solution followed by an analysis of the convergence of MUA. Experiments on both toy data and real-world datasets validate the correctness of our proposed method and its utility as an effective clustering algorithm.<\/jats:p>","DOI":"10.1145\/3451395","type":"journal-article","created":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T17:08:53Z","timestamp":1621444133000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Factor-Bounded Nonnegative Matrix Factorization"],"prefix":"10.1145","volume":"15","author":[{"given":"Kai","family":"Liu","sequence":"first","affiliation":[{"name":"Clemson University, Clemson, SC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Li","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Denver, Denver, CO"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lodewijk","family":"Brand","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5986-7413","authenticated-orcid":false,"given":"Hua","family":"Wang","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0133-5"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/050644641"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.231"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131672.3131679"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.04.031"},{"issue":"1","key":"e_1_2_1_7_1","first-page":"1","article-title":"Optimality, computation, and interpretation of nonnegative matrix factorizations. SIAM Journal on Matrix Analysis (2004)","volume":"10","author":"Chu Moody","year":"2004","unstructured":"Moody Chu , Fasma Diele , Robert Plemmons , and Stefania Ragni . 2004 . Optimality, computation, and interpretation of nonnegative matrix factorizations. SIAM Journal on Matrix Analysis (2004) . DOI : 10 . 1 . 1 .61.5758&rep=rep1&type=pdf Moody Chu, Fasma Diele, Robert Plemmons, and Stefania Ragni. 2004. Optimality, computation, and interpretation of nonnegative matrix factorizations. SIAM Journal on Matrix Analysis (2004). DOI:10.1.1.61.5758&rep=rep1&type=pdf","journal-title":"DOI"},{"key":"e_1_2_1_8_1","volume-title":"Simon","author":"Ding Chris","year":"2005","unstructured":"Chris Ding , Xiaofeng He , and Horst D . Simon . 2005 . On the equivalence of nonnegative matrix factorization and spectral clustering. In Proceedings of the 2005 SIAM International Conference on Data Mining. SIAM , 606\u2013610. Chris Ding, Xiaofeng He, and Horst D. Simon. 2005. On the equivalence of nonnegative matrix factorization and spectral clustering. In Proceedings of the 2005 SIAM International Conference on Data Mining. SIAM, 606\u2013610."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150420"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806568"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557063"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 16th International Conference on Neural Information Processing. ACM, 153\u2013160","author":"He Xiaofei","year":"2004","unstructured":"Xiaofei He and Partha Niyogi . 2004 . Locality preserving projections . In Proceedings of the 16th International Conference on Neural Information Processing. ACM, 153\u2013160 . Xiaofei He and Partha Niyogi. 2004. Locality preserving projections. In Proceedings of the 16th International Conference on Neural Information Processing. ACM, 153\u2013160."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1044709"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2576427"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1346111.1346125"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063676"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/764206"},{"key":"e_1_2_1_19_1","volume-title":"Learning the parts of objects by non-negative matrix factorization. Nature 401, 6755","author":"Lee Daniel D.","year":"1999","unstructured":"Daniel D. Lee and H. Sebastian Seung . 1999. Learning the parts of objects by non-negative matrix factorization. Nature 401, 6755 ( 1999 ), 788. Daniel D. Lee and H. Sebastian Seung. 1999. Learning the parts of objects by non-negative matrix factorization. Nature 401, 6755 (1999), 788."},{"volume-title":"Proceedings of the 13th International Conference on Neural Information Processing Systems. ACM, 556\u2013562","author":"Lee Daniel D.","key":"e_1_2_1_20_1","unstructured":"Daniel D. Lee and H. Sebastian Seung . 2001. Algorithms for non-negative matrix factorization . In Proceedings of the 13th International Conference on Neural Information Processing Systems. ACM, 556\u2013562 . Daniel D. Lee and H. Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Proceedings of the 13th International Conference on Neural Information Processing Systems. ACM, 556\u2013562."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2936855"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-2065"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2007.12.003"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning. PMLR, 6479\u20136488","author":"Luo Lei","year":"2020","unstructured":"Lei Luo , Yanfu Zhang , and Heng Huang . 2020 . Adversarial nonnegative matrix factorization . In Proceedings of the 37th International Conference on Machine Learning. PMLR, 6479\u20136488 . Lei Luo, Yanfu Zhang, and Heng Huang. 2020. Adversarial nonnegative matrix factorization. In Proceedings of the 37th International Conference on Machine Learning. PMLR, 6479\u20136488."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.60"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 2008 International Symposium on Nonlinear Theory and its Applications.","author":"Phan Anh Huy","year":"2008","unstructured":"Anh Huy Phan and Andrzej Cichocki . 2008 . Multi-way nonnegative tensor factorization using fast hierarchical alternating least squares algorithm (HALS) . In Proceedings of the 2008 International Symposium on Nonlinear Theory and its Applications. Anh Huy Phan and Andrzej Cichocki. 2008. Multi-way nonnegative tensor factorization using fast hierarchical alternating least squares algorithm (HALS). In Proceedings of the 2008 International Symposium on Nonlinear Theory and its Applications."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"volume-title":"Proceedings of the 9th International Conference on Spoken Language Processing.","author":"Mikkel","key":"e_1_2_1_29_1","unstructured":"Mikkel N. Schmidt and Rasmus K. Olsson. 2006. Single-channel speech separation using sparse non-negative matrix factorization . In Proceedings of the 9th International Conference on Spoken Language Processing. Mikkel N. Schmidt and Rasmus K. Olsson. 2006. Single-channel speech separation using sparse non-negative matrix factorization. In Proceedings of the 9th International Conference on Spoken Language Processing."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2999792.2999970"},{"volume-title":"Proceedings of the 2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics. IEEE, 177\u2013180","author":"Smaragdis Paris","key":"e_1_2_1_31_1","unstructured":"Paris Smaragdis and Judith C. Brown . 2003. Non-negative matrix factorization for polyphonic music transcription . In Proceedings of the 2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics. IEEE, 177\u2013180 . Paris Smaragdis and Judith C. Brown. 2003. Non-negative matrix factorization for polyphonic music transcription. In Proceedings of the 2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics. IEEE, 177\u2013180."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/EUSIPCO.2016.7760286"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2012.0273"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2117684.2118202"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283516.2283654"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860485"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952558"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69731-2_68"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2014.6889928"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2188415"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3451395","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3451395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:30Z","timestamp":1750191450000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3451395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,19]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,6,28]]}},"alternative-id":["10.1145\/3451395"],"URL":"https:\/\/doi.org\/10.1145\/3451395","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2021,5,19]]},"assertion":[{"value":"2020-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}