{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:00:48Z","timestamp":1760058048795,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T00:00:00Z","timestamp":1741651200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MAKE"],"abstract":"<jats:p>Non-negative Matrix Factorization (NMF) has gained popularity due to its effectiveness in clustering and feature selection tasks. It is particularly valuable for managing high-dimensional data by reducing dimensionality and providing meaningful semantic representations. However, traditional NMF methods may encounter challenges when dealing with noisy data, outliers, or when the underlying manifold structure of the data is overlooked. This paper introduces an innovative approach called SGRiT, which employs Stiefel manifold optimization to enhance the extraction of latent features. These learned features have been shown to be highly informative for clustering tasks. The method leverages a spectral decomposition criterion to obtain a low-dimensional embedding that captures the intrinsic geometric structure of the data. Additionally, this paper presents a solution for addressing the Stiefel manifold problem and utilizes a Riemannian-based trust region algorithm to optimize the loss function. The outcome of this optimization process is a new representation of the data in a transformed space, which can subsequently serve as input for the NMF algorithm. Furthermore, this paper incorporates a novel subspace graph regularization term that considers high-order geometric information and introduces a sparsity term for the factor matrices. These enhancements significantly improve the discrimination capabilities of the learning process. This paper conducts an impartial analysis of several essential NMF algorithms. To demonstrate that the proposed approach consistently outperforms other benchmark algorithms, four clustering evaluation indices are employed.<\/jats:p>","DOI":"10.3390\/make7010025","type":"journal-article","created":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T06:52:30Z","timestamp":1741675950000},"page":"25","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SGRiT: Non-Negative Matrix Factorization via Subspace Graph Regularization and Riemannian-Based Trust Region Algorithm"],"prefix":"10.3390","volume":"7","author":[{"given":"Mohsen","family":"Nokhodchian","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Mashhad Branch, Islamic Azad University, Mashhad 9187147578, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8968-6744","authenticated-orcid":false,"given":"Mohammad Hossein","family":"Moattar","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Mashhad Branch, Islamic Azad University, Mashhad 9187147578, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2465-4933","authenticated-orcid":false,"given":"Mehrdad","family":"Jalali","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Mashhad Branch, Islamic Azad University, Mashhad 9187147578, Iran"},{"name":"Institute of Functional Interfaces, Karlsruhe Institute of Technology (KIT), 76131 Karlsruhe, Germany"},{"name":"Applied Data Science and Analytics, SRH University Heidelberg, 69123 Heidelberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,11]]},"reference":[{"key":"ref_1","first-page":"1068","article-title":"Hybrid adaptive modularized tri-factor non-negative matrix factorization for community detection in complex networks","volume":"30","author":"Ghadirian","year":"2023","journal-title":"Sci. Iran."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ins.2019.12.004","article-title":"Low-rank nonnegative matrix factorization on Stiefel manifold","volume":"514","author":"He","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Kumbhar, R., Mhamane, S., Patil, H., Patil, S., and Kale, S. (2020, January 10\u201312). Text document clustering using k-means algorithm with dimension reduction techniques. Proceedings of the 2020 5th International Conference on Communication and Electronics Systems (ICCES), Coimbatore, India.","DOI":"10.1109\/ICCES48766.2020.9137928"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"11068","DOI":"10.1109\/TCYB.2021.3106485","article-title":"Multiview PCA: A methodology of feature extraction and dimension reduction for high-order data","volume":"52","author":"Xia","year":"2021","journal-title":"IEEE Trans. Cybern."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Chen, Y., Miura, Y., Sakurai, T., Chen, Z., Shrestha, R., Kato, S., Okada, E., Ukawa, S., Nakagawa, T., and Nakamura, K. (2021). Comparison of dimension reduction methods on fatty acids food source study. Sci. Rep., 11.","DOI":"10.1038\/s41598-021-97349-6"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"3227","DOI":"10.1007\/s10489-021-02522-z","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_7","doi-asserted-by":"crossref","first-page":"3952","DOI":"10.1109\/TCYB.2020.3000799","article-title":"Correntropy-based hypergraph regularized NMF for clustering and feature selection on multi-cancer integrated data","volume":"51","author":"Yu","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2553","DOI":"10.1162\/neco_a_00995","article-title":"Nonnegative matrix factorization with rank regularization and hard constraint","volume":"29","author":"Shang","year":"2017","journal-title":"Neural Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"106054","DOI":"10.1016\/j.knosys.2020.106054","article-title":"Robust orthogonal nonnegative matrix tri-factorization for data representation","volume":"201","author":"Peng","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_10","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_11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.neucom.2018.07.062","article-title":"Sparse dual graph-regularized NMF for image co-clustering","volume":"316","author":"Sun","year":"2018","journal-title":"Neurocomputing"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/LSP.2022.3179168","article-title":"Nonlinear orthogonal nmf on the stiefel manifold with graph-based total variation regularization","volume":"29","author":"Rahiche","year":"2022","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"55714","DOI":"10.1109\/ACCESS.2021.3071192","article-title":"An orthogonal locality and globality dimensionality reduction method based on twin eigen decomposition","volume":"9","author":"Su","year":"2021","journal-title":"IEEE Access"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Nayak, R., and Luong, K. (2023). Non-negative Matrix Factorization-Based Multi-aspect Data Clustering. Multi-Aspect Learning: Methods and Applications, Springer.","DOI":"10.1007\/978-3-031-33560-0"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"104060","DOI":"10.1016\/j.dsp.2023.104060","article-title":"Learning transferable non-negative feature representation for facial expression recognition","volume":"139","author":"Ji","year":"2023","journal-title":"Digit. Signal Process."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Mirlekar, S., and Kanojia, K.P. (2022, January 29\u201330). A comprehensive study on machine learning algorithms for intrusion detection system. Proceedings of the 2022 10th International Conference on Emerging Trends in Engineering and Technology-Signal and Information Processing (ICETET-SIP-22), Nagpur, India.","DOI":"10.1109\/ICETET-SIP-2254415.2022.9791586"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"100435","DOI":"10.1016\/j.cosrev.2021.100435","article-title":"Beyond linear subspace clustering: A comparative study of nonlinear manifold clustering algorithms","volume":"42","author":"Abdolali","year":"2021","journal-title":"Comput. Sci. Rev."},{"key":"ref_18","unstructured":"Yin, W., Ma, Z., and Liu, Q. (2021). Riemannian Manifold Optimization for Discriminant Subspace Learning. arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"10569","DOI":"10.1109\/TKDE.2023.3249765","article-title":"Structure-aware subspace clustering","volume":"35","author":"Kou","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Wang, Q., Gao, J., and Li, H. (2017, January 21\u201326). Grassmannian manifold optimization assisted sparse spectral clustering. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Honolulu, HI, USA.","DOI":"10.1109\/CVPR.2017.335"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10844-018-0513-8","article-title":"ISoTrustSeq: A social recommender system based on implicit interest, trust and sequential behaviors of users using matrix factorization","volume":"52","author":"Nobahari","year":"2019","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10844-020-00613-w","article-title":"TSCMF: Temporal and social collective matrix factorization model for recommender systems","volume":"56","author":"Tahmasbi","year":"2021","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Absil, P.-A., Mahony, R., and Sepulchre, R. (2009). Optimization algorithms on matrix manifolds. Optimization Algorithms on Matrix Manifolds, Princeton University Press.","DOI":"10.1515\/9781400830244"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","article-title":"Robust recovery of subspace structures by low-rank representation","volume":"35","author":"Liu","year":"2012","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1432","DOI":"10.1109\/TCYB.2013.2286106","article-title":"Robust subspace segmentation via low-rank representation","volume":"44","author":"Chen","year":"2013","journal-title":"IEEE Trans. Cybern."},{"key":"ref_26","unstructured":"Zhang, K., Zhang, S., Liu, J., Wang, J., and Zhang, J. (2019, January 9\u201315). Greedy orthogonal pivoting algorithm for non-negative matrix factorization. Proceedings of the 36th International Conference on Machine Learning, Long Beach, CA, USA."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Wang, S., Chang, T.H., Cui, Y., and Pang, J.S. (2019, January 12\u201317). Clustering by orthogonal non-negative matrix factorization: A sequential non-convex penalty approach. Proceedings of the ICASSP 2019\u20142019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brighton, UK.","DOI":"10.1109\/ICASSP.2019.8683466"},{"key":"ref_28","unstructured":"Charikar, M., and Hu, L. (2021, January 13\u201315). Approximation algorithms for orthogonal non-negative matrix factorization. Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, Virtual."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ins.2021.06.058","article-title":"Integrating multiple genomic imaging data for the study of lung metastasis in sarcomas using multi-dimensional constrained joint non-negative matrix factorization","volume":"576","author":"Deng","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_30","unstructured":"Choi, S. (2008, January 1\u20138). Algorithms for orthogonal nonnegative matrix factorization. Proceedings of the 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence), Hong Kong, China."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2421","DOI":"10.1162\/NECO_a_00168","article-title":"Algorithms for nonnegative matrix factorization with the \u03b2-divergence","volume":"23","author":"Idier","year":"2011","journal-title":"Neural Comput."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"4810","DOI":"10.1109\/TIP.2015.2468177","article-title":"Nonlinear hyperspectral unmixing with robust nonnegative matrix factorization","volume":"24","author":"Dobigeon","year":"2015","journal-title":"IEEE Trans. Image Process."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Zhang, W.E., Tan, M., Sheng, Q.Z., Yao, L., and Shi, Q. (2016, January 24\u201328). Efficient orthogonal non-negative matrix factorization over Stiefel manifold. Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, Indianapolis, IN, USA.","DOI":"10.1145\/2983323.2983761"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","article-title":"Sparse subspace clustering: Algorithm, theory, and applications","volume":"35","author":"Elhamifar","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/3589767","article-title":"Low-rank representation with adaptive dimensionality reduction via manifold optimization for clustering","volume":"17","author":"Chen","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Piao, X., Hu, Y., Gao, J., Sun, Y., and Yin, B. (2019, January 15\u201320). Double nuclear norm based low rank representation on Grassmann manifolds for clustering. Proceedings of the 2019 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, CA, USA.","DOI":"10.1109\/CVPR.2019.01235"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Piao, X., Hu, Y., Gao, J., Sun, Y., Yang, X., Yin, B., Zhu, W., and Li, G. (2020, January 6\u201310). Kernel clustering on symmetric positive definite manifolds via double approximated low rank representation. Proceedings of the 2020 IEEE International Conference on Multimedia and Expo (ICME), London, UK.","DOI":"10.1109\/ICME46284.2020.9102821"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1109\/TIP.2016.2553459","article-title":"Convex sparse spectral clustering: Single-view to multi-view","volume":"25","author":"Lu","year":"2016","journal-title":"IEEE Trans. Image Process."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Srebro, N., and Shraibman, A. (2005). Rank, trace-norm and max-norm. International Conference on Computational Learning Theory, Springer.","DOI":"10.1007\/11503415_37"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/TNNLS.2018.2844866","article-title":"Solving partial least squares regression via manifold optimization approaches","volume":"30","author":"Chen","year":"2018","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"2041","DOI":"10.1109\/TSP.2018.2795539","article-title":"Riemannian optimization and approximate joint diagonalization for blind source separation","volume":"66","author":"Bouchard","year":"2018","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1016\/j.ins.2022.08.023","article-title":"Robust local-coordinate non-negative matrix factorization with adaptive graph for robust clustering","volume":"610","author":"Tang","year":"2022","journal-title":"Inf. Sci."}],"container-title":["Machine Learning and Knowledge Extraction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-4990\/7\/1\/25\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:50:25Z","timestamp":1760028625000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-4990\/7\/1\/25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,11]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["make7010025"],"URL":"https:\/\/doi.org\/10.3390\/make7010025","relation":{},"ISSN":["2504-4990"],"issn-type":[{"type":"electronic","value":"2504-4990"}],"subject":[],"published":{"date-parts":[[2025,3,11]]}}}