{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:06:41Z","timestamp":1777493201074,"version":"3.51.4"},"reference-count":39,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2025,7,19]],"date-time":"2025-07-19T00:00:00Z","timestamp":1752883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"China Tobacco Hebei industrial co., Ltd. Technology Project, China","award":["HBZY2023A034"],"award-info":[{"award-number":["HBZY2023A034"]}]},{"name":"China Tobacco Hebei industrial co., Ltd. Technology Project, China","award":["24JCYBJC00430"],"award-info":[{"award-number":["24JCYBJC00430"]}]},{"name":"China Tobacco Hebei industrial co., Ltd. Technology Project, China","award":["18JCYBJC16300"],"award-info":[{"award-number":["18JCYBJC16300"]}]},{"name":"China Tobacco Hebei industrial co., Ltd. Technology Project, China","award":["11401433"],"award-info":[{"award-number":["11401433"]}]},{"name":"China Tobacco Hebei industrial co., Ltd. Technology Project, China","award":["A231005802"],"award-info":[{"award-number":["A231005802"]}]},{"name":"Natural Science Foundation of Tianjin City, China","award":["HBZY2023A034"],"award-info":[{"award-number":["HBZY2023A034"]}]},{"name":"Natural Science Foundation of Tianjin City, China","award":["24JCYBJC00430"],"award-info":[{"award-number":["24JCYBJC00430"]}]},{"name":"Natural Science Foundation of Tianjin City, China","award":["18JCYBJC16300"],"award-info":[{"award-number":["18JCYBJC16300"]}]},{"name":"Natural Science Foundation of Tianjin City, China","award":["11401433"],"award-info":[{"award-number":["11401433"]}]},{"name":"Natural Science Foundation of Tianjin City, China","award":["A231005802"],"award-info":[{"award-number":["A231005802"]}]},{"name":"Natural Science Foundation of China","award":["HBZY2023A034"],"award-info":[{"award-number":["HBZY2023A034"]}]},{"name":"Natural Science Foundation of China","award":["24JCYBJC00430"],"award-info":[{"award-number":["24JCYBJC00430"]}]},{"name":"Natural Science Foundation of China","award":["18JCYBJC16300"],"award-info":[{"award-number":["18JCYBJC16300"]}]},{"name":"Natural Science Foundation of China","award":["11401433"],"award-info":[{"award-number":["11401433"]}]},{"name":"Natural Science Foundation of China","award":["A231005802"],"award-info":[{"award-number":["A231005802"]}]},{"name":"Ordinary Universities Undergraduate Education Quality Reform Research Project of Tianjin, China","award":["HBZY2023A034"],"award-info":[{"award-number":["HBZY2023A034"]}]},{"name":"Ordinary Universities Undergraduate Education Quality Reform Research Project of Tianjin, China","award":["24JCYBJC00430"],"award-info":[{"award-number":["24JCYBJC00430"]}]},{"name":"Ordinary Universities Undergraduate Education Quality Reform Research Project of Tianjin, China","award":["18JCYBJC16300"],"award-info":[{"award-number":["18JCYBJC16300"]}]},{"name":"Ordinary Universities Undergraduate Education Quality Reform Research Project of Tianjin, China","award":["11401433"],"award-info":[{"award-number":["11401433"]}]},{"name":"Ordinary Universities Undergraduate Education Quality Reform Research Project of Tianjin, China","award":["A231005802"],"award-info":[{"award-number":["A231005802"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>We propose a novel approach for clustering problem, which refers to as Graph Regularized Orthogonal Subspace Non Negative Matrix Factorization (GNMFOS). This type of model introduces both graph regularization and orthogonality as penalty terms into the objective function. It not only obtains the uniqueness of matrix decomposition but also improves the sparsity of decomposition and reduces computational complexity. Most importantly, using the idea of iteration under weak orthogonality, we construct an auxiliary function for the algorithm and obtain convergence proof to compensate for the lack of convergence proof in similar models. The experimental results show that compared with classical models such as GNMF and NMFOS, our algorithm significantly improves clustering performance and the quality of reconstructed images.<\/jats:p>","DOI":"10.3390\/sym17071154","type":"journal-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T07:56:14Z","timestamp":1753084574000},"page":"1154","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Orthogonal-Constrained Graph Non-Negative Matrix Factorization for Clustering"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-4361-8008","authenticated-orcid":false,"given":"Wen","family":"Li","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Tiangong University, Tianjin 300387, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5222-0994","authenticated-orcid":false,"given":"Junjian","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Tiangong University, Tianjin 300387, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8634-7221","authenticated-orcid":false,"given":"Yasong","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Tiangong University, Tianjin 300387, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Devarajan, K. (2008). Nonnegative matrix factorization: An analytical and interpretive tool in computational biology. PLoS Comput. Biol., 4.","DOI":"10.1371\/journal.pcbi.1000029"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12859-020-3409-x","article-title":"Graph regularized l2, 1-nonnegative matrix factorization for mirna-disease association prediction","volume":"21","author":"Gao","year":"2020","journal-title":"BMC Bioinform."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/s10489-019-01539-9","article-title":"Adaptive graph regularized nonnegative matrix factorization for data representation","volume":"50","author":"Zhang","year":"2020","journal-title":"Appl. Intell."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1016\/j.cam.2011.10.002","article-title":"A multilevel approach for nonnegative matrix factorization","volume":"236","author":"Gillis","year":"2012","journal-title":"J. Comput. Appl. Math."},{"key":"ref_5","first-page":"457","article-title":"Non-negative matrix factorization with sparseness constraints","volume":"5","author":"Hoyer","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.sigpro.2012.07.015","article-title":"On-line learning parts-based representation via incremental orthogonal projective non-negative matrix factorization","volume":"93","author":"Wang","year":"2013","journal-title":"Signal Process."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.csda.2006.11.006","article-title":"Algorithms and applications for approximate nonnegative matrix factorization","volume":"52","author":"Berry","year":"2007","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.laa.2005.06.025","article-title":"Nonnegative matrix factorization for spectral data analysis","volume":"416","author":"Pauca","year":"2006","journal-title":"Linear Algebra Its Appl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TASL.2010.2041381","article-title":"Enforcing harmonicity and smoothness in bayesian non-negative matrix factorization applied to polyphonic music transcription","volume":"18","author":"Bertin","year":"2010","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TNN.2011.2109396","article-title":"Online blind source separation using incremental nonnegative matrix factorization with volume constraint","volume":"22","author":"Zhou","year":"2023","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"10331","DOI":"10.1109\/TMM.2024.3406196","article-title":"SADCMF: Self-Attentive Deep Consistent Matrix Factorization for Micro-Video Multi-Label Classification","volume":"26","author":"Fan","year":"2024","journal-title":"IEEE Trans. Multimed."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Chen, D., and Li, S.X. (2025). An augmented GSNMF model for complete deconvolution of bulk RNA-seq data. Math. Biosci. Eng., 22.","DOI":"10.3934\/mbe.2025036"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/TIFS.2024.3516570","article-title":"NMFAD: Neighbor-aware mask-filling attributed network anomaly detection","volume":"20","author":"Xi","year":"2024","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1109\/TSP.2025.3531872","article-title":"Dynamic Spectrum Cartography: Reconstructing Spatial-Spectral-Temporal Radio Frequency Map via Tensor Completion","volume":"73","author":"Chen","year":"2025","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_15","first-page":"1548","article-title":"Graph regularized nonnegative matrix factorization for data representation","volume":"33","author":"Cai","year":"2010","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.neunet.2014.11.007","article-title":"Convex nonnegative matrix factorization with manifold regularization","volume":"63","author":"Hu","year":"2015","journal-title":"Neural Netw."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.neucom.2018.02.044","article-title":"Feature selection based dual-graph sparse non-negative matrix factorization for local discriminative clustering","volume":"290","author":"Meng","year":"2018","journal-title":"Neurocomputing"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2679","DOI":"10.1007\/s11042-013-1572-z","article-title":"Graph regularized discriminative non-negative matrix factorization for face recognition","volume":"72","author":"Long","year":"2014","journal-title":"Multimed. Tools Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1016\/j.patcog.2011.12.015","article-title":"Graph dual regularization non-negative matrix factorization for co-clustering","volume":"45","author":"Shang","year":"2012","journal-title":"Pattern Recognit."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1109\/TETCI.2024.3451352","article-title":"Robust hypergraph regularized deep non-negative matrix factorization for multi-view clustering","volume":"9","author":"Che","year":"2025","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"ref_21","first-page":"23","article-title":"Auto-weighted multi-view deep non-negative matrix factorization with multi-kernel learning","volume":"11","author":"Yang","year":"2025","journal-title":"IEEE Trans. Signal Inf. Pract."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"10606","DOI":"10.1109\/TNNLS.2024.3489585","article-title":"Beyond euclidean structures: Collaborative topological graph learning for multiview clustering","volume":"36","author":"Liu","year":"2025","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.neucom.2016.04.028","article-title":"Semi-supervised convex nonnegative matrix factorizations with graph regularized for image representation","volume":"237","author":"Li","year":"2017","journal-title":"Neurocomputing"},{"key":"ref_24","unstructured":"Li, S.Z., Hou, X.W., Zhang, H.J., and Cheng, Q.S. (2001, January 8\u201314). Learning spatially localized, parts-based representation. Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2001, Kauai, HI, USA."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Ding, C., Li, T., Peng, W., and Park, H. (2006, January 20\u201323). Orthogonal nonnegative matrix t-factorizations for clustering. Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA.","DOI":"10.1145\/1150402.1150420"},{"key":"ref_26","first-page":"227","article-title":"Semi-supervised bi-orthogonal constraints dual-graph regularized nmf for subspace clustering","volume":"52","author":"Li","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"14607","DOI":"10.1007\/s10489-022-03551-y","article-title":"Incomplete multi-view clustering with incomplete graph-regularized orthogonal non-negative matrix factorization","volume":"52","author":"Liang","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_28","first-page":"1","article-title":"Structured joint sparse orthogonal nonnegative matrix factorization for fault detection","volume":"72","author":"Zhang","year":"2023","journal-title":"IEEE Trans. Instrum. Meas."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"Lee","year":"1999","journal-title":"Nature"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/j.patrec.2009.12.023","article-title":"Nonnegative matrix factorization on orthogonal subspace","volume":"31","author":"Li","year":"2010","journal-title":"Pattern Recognit. Lett."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"103354","DOI":"10.1016\/j.engappai.2019.103354","article-title":"Robust nonnegative matrix factorization with local coordinate constraint for image clustering","volume":"88","author":"Peng","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.patrec.2019.07.005","article-title":"Regularized asymmetric nonnegative matrix factorization for clustering in directed networks","volume":"125","author":"Tosyali","year":"2019","journal-title":"Pattern Recognit. Lett."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"5261830","DOI":"10.1155\/2019\/5261830","article-title":"A modified spectral prp conjugate gradient projection method for solving large-scale monotone equations and its application in compressed sensing","volume":"2019","author":"Guo","year":"2019","journal-title":"Math. Probl. Eng."},{"key":"ref_34","first-page":"76","article-title":"New adaptive barzilai\u2013borwein step size and its application in solving large-scale optimization problems","volume":"61","author":"Li","year":"2019","journal-title":"ANZIAM J."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"85664","DOI":"10.1109\/ACCESS.2020.2992340","article-title":"An efficient single-parameter scaling memoryless broyden-fletcher-goldfarb-shanno algorithm for solving large scale unconstrained optimization problems","volume":"8","author":"Lv","year":"2020","journal-title":"IEEE Access"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cam.2013.09.022","article-title":"A convergent algorithm for orthogonal nonnegative matrix factorization","volume":"260","author":"Mirzal","year":"2014","journal-title":"J. Comput. Appl. Math."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, J., Ke, Q., Zeng, G., and Li, S. (2015). Fast approximate k-means via cluster closures. Multimedia Data Mining and Analytics: Disruptive Innovation, Springer.","DOI":"10.1007\/978-3-319-14998-1_17"},{"key":"ref_38","unstructured":"Hoyer, P.O. (2002, January 6). Non-negative sparse coding. Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing, Martigny, Switzerland."},{"key":"ref_39","first-page":"535","article-title":"Algorithms for non-negative matrix factorization","volume":"13","author":"Lee","year":"2000","journal-title":"Adv. Neural Inf. Process. Syst."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/7\/1154\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:12:29Z","timestamp":1760033549000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/7\/1154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,19]]},"references-count":39,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["sym17071154"],"URL":"https:\/\/doi.org\/10.3390\/sym17071154","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,19]]}}}