{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T16:58:34Z","timestamp":1769014714676,"version":"3.49.0"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T00:00:00Z","timestamp":1488758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2017,8,31]]},"abstract":"<jats:p>Matrix factorization is often used for data representation in many data mining and machine-learning problems. In particular, for a dataset without any negative entries, nonnegative matrix factorization (NMF) is often used to find a low-rank approximation by the product of two nonnegative matrices. With reduced dimensions, these matrices can be effectively used for many applications such as clustering. The existing methods of NMF are often afflicted with their sensitivity to outliers and noise in the data. To mitigate this drawback, in this paper, we consider integrating NMF into a robust principal component model, and design a robust formulation that effectively captures noise and outliers in the approximation while incorporating essential nonlinear structures. A set of comprehensive empirical evaluations in clustering applications demonstrates that the proposed method has strong robustness to gross errors and superior performance to current state-of-the-art methods.<\/jats:p>","DOI":"10.1145\/3003730","type":"journal-article","created":{"date-parts":[[2017,3,7]],"date-time":"2017-03-07T19:12:04Z","timestamp":1488913924000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Robust Graph Regularized Nonnegative Matrix Factorization for Clustering"],"prefix":"10.1145","volume":"11","author":[{"given":"Chong","family":"Peng","sequence":"first","affiliation":[{"name":"Southern Illinois University at Carbondale, Carbondale, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Kang","sequence":"additional","affiliation":[{"name":"Southern Illinois University at Carbondale, Carbondale, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunhong","family":"Hu","sequence":"additional","affiliation":[{"name":"Yuncheng University, Shanxi Province, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Cheng","sequence":"additional","affiliation":[{"name":"University of Hawaii at Hilo, Hilo, HI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Cheng","sequence":"additional","affiliation":[{"name":"Southern Illinois University at Carbondale, Carbondale, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,3,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177153"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.598228"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2006.11.006"},{"key":"e_1_2_1_5_1","volume-title":"Constrained optimization and lagrange multiplier methods. Computer Science and Applied Mathematics","author":"Bertsekas Dimitri P.","year":"1982","unstructured":"Dimitri P. Bertsekas . 1982. Constrained optimization and lagrange multiplier methods. Computer Science and Applied Mathematics , Boston : Academic Press , 1982 1 (1982). Dimitri P. Bertsekas. 1982. Constrained optimization and lagrange multiplier methods. Computer Science and Applied Mathematics, Boston: Academic Press, 1982 1 (1982)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"e_1_2_1_7_1","volume-title":"Litekmeans: The fastest matlab implementation of kmeans. Available at: http:\/\/www.zjucadcg.cn\/dengcai\/Data\/Clustering.html","author":"Cai Deng","year":"2011","unstructured":"Deng Cai . 2011 . Litekmeans: The fastest matlab implementation of kmeans. Available at: http:\/\/www.zjucadcg.cn\/dengcai\/Data\/Clustering.html (2011). Deng Cai. 2011. Litekmeans: The fastest matlab implementation of kmeans. Available at: http:\/\/www.zjucadcg.cn\/dengcai\/Data\/Clustering.html (2011)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.231"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"M. Catral Lixing Han Michael Neumann and R. J. Plemmons. 2004. On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices. Linear Algebra and its Applications 393 (2004) 107--126.  M. Catral Lixing Han Michael Neumann and R. J. Plemmons. 2004. On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices. Linear Algebra and its Applications 393 (2004) 107--126.","DOI":"10.1016\/j.laa.2003.11.024"},{"key":"e_1_2_1_11_1","volume-title":"Spectral Graph Theory","author":"Chung Fan R. K.","unstructured":"Fan R. K. Chung . 1997. Spectral Graph Theory . Vol. 92 . American Mathematical Soc . Fan R. K. Chung. 1997. Spectral Graph Theory. Vol. 92. American Mathematical Soc."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MMSP.2002.1203239"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_2_1_14_1","volume-title":"Stork","author":"Duda Richard O.","year":"2012","unstructured":"Richard O. Duda , Peter E. Hart , and David G . Stork . 2012 . Pattern Classification. John Wiley 8 Sons. Richard O. Duda, Peter E. Hart, and David G. Stork. 2012. Pattern Classification. John Wiley 8 Sons."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2190081"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00168"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.226"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2197827"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.879282"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"e_1_2_1_24_1","volume-title":"Distinctive descriptions for face processing. In 8 British Machine Vision Conference","author":"Hond Darryl","unstructured":"Darryl Hond and Libor Spacek . 1997. Distinctive descriptions for face processing. In 8 British Machine Vision Conference . Vol. 1 . 320--329. Darryl Hond and Libor Spacek. 1997. Distinctive descriptions for face processing. In 8 British Machine Vision Conference. Vol. 1. 320--329."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601434"},{"key":"e_1_2_1_26_1","volume-title":"Principal Component Analysis","author":"Jolliffe Ian","unstructured":"Ian Jolliffe . 2002. Principal Component Analysis . Wiley Online Library . Ian Jolliffe. 2002. Principal Component Analysis. Wiley Online Library."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.15"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2460737"},{"key":"e_1_2_1_29_1","volume-title":"Top-N recommender system via matrix completion","author":"Kang Zhao","unstructured":"Zhao Kang , Chong Peng , and Qiang Cheng . 2016. Top-N recommender system via matrix completion . In Proceeding of American Association for Artificial Intelligence . Citeseer, 179--185. Zhao Kang, Chong Peng, and Qiang Cheng. 2016. Top-N recommender system via matrix completion. In Proceeding of American Association for Artificial Intelligence. Citeseer, 179--185."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0035-4"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.10"},{"key":"e_1_2_1_32_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--791. Daniel D. Lee and H. Sebastian Seung. 1999. Learning the parts of objects by non-negative matrix factorization. Nature 401, 6755 (1999), 788--791."},{"key":"e_1_2_1_33_1","volume-title":"Advances in Neural Information Processing Systems","author":"Lee Daniel D.","unstructured":"Daniel D. Lee and H. Sebastian Seung . 2001. Algorithms for non-negative matrix factorization . In Advances in Neural Information Processing Systems . MIT Press , 556--562. Daniel D. Lee and H. Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems. MIT Press, 556--562."},{"key":"e_1_2_1_34_1","unstructured":"M. Lichman. 2013. UCI Machine Learning Repository. (2013). http:\/\/archive.ics.uci.edu\/ml.  M. Lichman. 2013. UCI Machine Learning Repository. (2013). http:\/\/archive.ics.uci.edu\/ml."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2007.895831"},{"key":"e_1_2_1_36_1","volume-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv:1009.5055","author":"Lin Zhouchen","year":"2010","unstructured":"Zhouchen Lin , Minming Chen , and Yi Ma. 2010. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv:1009.5055 ( 2010 ). Zhouchen Lin, Minming Chen, and Yi Ma. 2010. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv:1009.5055 (2010)."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"e_1_2_1_38_1","unstructured":"Michael J. Lyons Shigeru Akamatsu Miyuki Kamachi Jiro Gyoba and Julien Budynek. 1998. The Japanese female facial expression (JAFFE) database. (1998).  Michael J. Lyons Shigeru Akamatsu Miyuki Kamachi Jiro Gyoba and Julien Budynek. 1998. The Japanese female facial expression (JAFFE) database. (1998)."},{"key":"e_1_2_1_39_1","unstructured":"A. M. Martinez and R. Benavente. 1998. The AR face database. CVC Tech. Report #24.  A. M. Martinez and R. Benavente. 1998. The AR face database. CVC Tech. Report #24."},{"key":"e_1_2_1_41_1","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume":"2","author":"Ng Andrew Y.","year":"2002","unstructured":"Andrew Y. Ng , Michael I. Jordan , Yair Weiss , and others. 2002 . On spectral clustering: Analysis and an algorithm . Advances in Neural Information Processing Systems 2 (2002), 849 -- 856 . Andrew Y. Ng, Michael I. Jordan, Yair Weiss, and others. 2002. On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 2 (2002), 849--856.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_42_1","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Nie Feiping","unstructured":"Feiping Nie , Chris Ding , Dijun Luo , and Heng Huang . 2010. Improved minmax cut graph clustering with nonnegative relaxation . In Machine Learning and Knowledge Discovery in Databases . Springer , 451--466. Feiping Nie, Chris Ding, Dijun Luo, and Heng Huang. 2010. Improved minmax cut graph clustering with nonnegative relaxation. In Machine Learning and Knowledge Discovery in Databases. Springer, 451--466."},{"key":"e_1_2_1_43_1","volume-title":"Ding","author":"Nie Feiping","year":"2010","unstructured":"Feiping Nie , Heng Huang , Xiao Cai , and Chris H . Ding . 2010 . Efficient and robust feature selection via joint 2, 1-norms minimization. In Advances in Neural Information Processing Systems . 1813--1821. Feiping Nie, Heng Huang, Xiao Cai, and Chris H. Ding. 2010. Efficient and robust feature selection via joint 2, 1-norms minimization. In Advances in Neural Information Processing Systems. 1813--1821."},{"key":"e_1_2_1_44_1","volume-title":"Ding","author":"Nie Feiping","year":"2012","unstructured":"Feiping Nie , Heng Huang , and Chris H. Q . Ding . 2012 . Low-rank matrix recovery via efficient schatten p-norm minimization. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence. AAAI Press , 655--661. Feiping Nie, Heng Huang, and Chris H. Q. Ding. 2012. Low-rank matrix recovery via efficient schatten p-norm minimization. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence. AAAI Press, 655--661."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.160"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623726"},{"key":"e_1_2_1_47_1","volume-title":"AAAI. Citeseer","author":"Nie Feiping","year":"2016","unstructured":"Feiping Nie , Xiaoqian Wang , Michael I. Jordan , and Heng Huang . 2016 . The constrained Laplacian rank algorithm for graph-based clustering . In AAAI. Citeseer , 1969--1976. Feiping Nie, Xiaoqian Wang, Michael I. Jordan, and Heng Huang. 2016. The constrained Laplacian rank algorithm for graph-based clustering. In AAAI. Citeseer, 1969--1976."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2161607"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2011.2162000"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/2209800.2210163"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0149"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783303"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2573159"},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of the 2nd IEEE Workshop on Applications of Computer Vision","author":"Ferdinando","year":"1994","unstructured":"Ferdinando S. Samaria and Andy C. Harter. 1994. Parameterisation of a stochastic model for human face identification . In Proceedings of the 2nd IEEE Workshop on Applications of Computer Vision , 1994 . IEEE, 138--142. Ferdinando S. Samaria and Andy C. Harter. 1994. Parameterisation of a stochastic model for human face identification. In Proceedings of the 2nd IEEE Workshop on Applications of Computer Vision, 1994. IEEE, 138--142."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289451"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2014.7026069"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958447.1958459"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.51"},{"key":"e_1_2_1_61_1","volume-title":"Advances in Neural Information Processing Systems. Curran Associates","author":"Wright John","year":"2080","unstructured":"John Wright , Arvind Ganesh , Shankar Rao , Yigang Peng , and Yi Ma. 2009. Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization . In Advances in Neural Information Processing Systems. Curran Associates , Inc ., 2080 --2088. John Wright, Arvind Ganesh, Shankar Rao, Yigang Peng, and Yi Ma. 2009. Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In Advances in Neural Information Processing Systems. Curran Associates, Inc., 2080--2088."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3003730","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3003730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:36Z","timestamp":1750220616000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3003730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,6]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,8,31]]}},"alternative-id":["10.1145\/3003730"],"URL":"https:\/\/doi.org\/10.1145\/3003730","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,6]]},"assertion":[{"value":"2015-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-03-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}