{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T14:53:05Z","timestamp":1763131985219,"version":"3.45.0"},"reference-count":24,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12161020"],"award-info":[{"award-number":["12161020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12061025"],"award-info":[{"award-number":["12061025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Non-negative Tucker decomposition (NTD) is one of the general and prominent decomposition tools designed for high-order tensor data, with its advantages reflected in feature extraction and low-dimensional representation of data. Most NTD-based methods only apply intrinsic and different constraints to the last factor matrix that is a low-dimensional representation of the original tensor information. This processing procedure may result in the loss of the relationship between the factor matrices in all dimensions. To enhance the representation ability of NTD, we propose a consistent regularized non-negative Tucker decomposition for three-dimensional tensor data representation. Consistent regularization is symmetrically presented and mathematically expressed by intrinsic cues in multiple dimensions, that is, manifold structure and orthogonality information. The paired constraint constructed by the double parameter operator is utilized to unlock hidden semantics and maintain the consistent geometric structure of the three-dimensional tensor. Moreover, we develop the iterative updating method based on the multiplicative update rule to solve the proposed model and provide its convergence and computational complexity. The extensive numerical results of unsupervised image clustering experiments on eight real-world datasets demonstrated the feasibility and efficiency of the new method.<\/jats:p>","DOI":"10.3390\/sym17111969","type":"journal-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T14:37:52Z","timestamp":1763131072000},"page":"1969","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Consistent Regularized Non-Negative Tucker Decomposition for Three-Dimensional Tensor Data Representation"],"prefix":"10.3390","volume":"17","author":[{"given":"Xiang","family":"Gao","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Guizhou Normal University, Guiyang 550025, China"}]},{"given":"Linzhang","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Guizhou Normal University, Guiyang 550025, China"},{"name":"School of Mathematical Sciences, Xiamen University, Xiamen 361005, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,11,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0169-7439(87)80084-9","article-title":"Principal component analysis","volume":"2","author":"Wold","year":"1987","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2426","DOI":"10.1109\/TNNLS.2015.2487364","article-title":"Group component analysis for multiblock data: Common and individual feature extraction","volume":"27","author":"Zhou","year":"2015","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_3","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_4","unstructured":"Lee, D., and Seung, H.S. (2000, January 1). Algorithms for non-negative matrix factorization. Proceedings of the 14th International Conference on Neural Information Processing Systems, Denver, CO, USA."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Kuang, D., Ding, C., and Park, H. (2012, January 26\u201328). Symmetric nonnegative matrix factorization for graph clustering. Proceedings of the 2012 SIAM International Conference on Data Mining, SIAM, Anaheim, CA, USA.","DOI":"10.1137\/1.9781611972825.10"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"109102","DOI":"10.1016\/j.patcog.2022.109102","article-title":"A consistent and flexible framework for deep matrix factorizations","volume":"134","author":"Gillis","year":"2023","journal-title":"Pattern Recognit."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM Rev."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Kim, Y.D., and Choi, S. (2007, January 17\u201322). Nonnegative tucker decomposition. Proceedings of the 2007 IEEE Conference on Computer Vision and Pattern Recognition, Minneapolis, MN, USA.","DOI":"10.1109\/CVPR.2007.383405"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3731","DOI":"10.1007\/s10994-023-06441-7","article-title":"Bayesian tensor factorisations for time series of counts","volume":"113","author":"Wang","year":"2023","journal-title":"Mach. Learn."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"3114","DOI":"10.1109\/TCYB.2022.3157133","article-title":"Graph-regularized non-negative tensor-ring decomposition for multiway representation learning","volume":"53","author":"Yu","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2582","DOI":"10.1109\/TPAMI.2022.3160205","article-title":"Unsupervised feature selection via graph regularized nonnegative CP decomposition","volume":"45","author":"Chen","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_12","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_13","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_14","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.neucom.2020.06.049","article-title":"Robust nonnegative matrix factorization with structure regularization","volume":"412","author":"Huang","year":"2020","journal-title":"Neurocomputing"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., and Simon, H.D. (2005, January 21\u201323). On the equivalence of nonnegative matrix factorization and spectral clustering. Proceedings of the 2005 SIAM International Conference on Data Mining, SIAM, Newport Beach, CA, USA.","DOI":"10.1137\/1.9781611972757.70"},{"key":"ref_16","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_17","first-page":"843","article-title":"Two efficient algorithms for approximately orthogonal nonnegative matrix factorization","volume":"22","author":"Li","year":"2014","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Qiu, Y., Zhou, G., Zhang, Y., and Xie, S. (2019, January 12\u201317). Graph regularized nonnegative tucker decomposition for tensor data representation. Proceedings of the ICASSP 2019\u20142019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brighton, UK.","DOI":"10.1109\/ICASSP.2019.8683766"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TCYB.2020.2979344","article-title":"A generalized graph regularized non-negative tucker decomposition framework for tensor data representation","volume":"52","author":"Qiu","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"110207","DOI":"10.1016\/j.patcog.2023.110207","article-title":"Nonnegative Tucker Decomposition with Graph Regularization and Smooth Constraint for Clustering","volume":"148","author":"Liu","year":"2023","journal-title":"Pattern Recognit."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"9647","DOI":"10.1007\/s11042-023-15622-4","article-title":"Adaptive graph regularized non-negative Tucker decomposition for multiway dimensionality reduction","volume":"83","author":"Chen","year":"2024","journal-title":"Multimed. Tools Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1109\/TNNLS.2016.2545400","article-title":"MR-NTD: Manifold regularization nonnegative tucker decomposition for tensor data dimension reduction and representation","volume":"28","author":"Li","year":"2016","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"B55","DOI":"10.1137\/19M1294708","article-title":"Orthogonal nonnegative tucker decomposition","volume":"43","author":"Pan","year":"2021","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1007\/s11431-020-1827-0","article-title":"Approximately orthogonal nonnegative Tucker decomposition for flexible multiway clustering","volume":"64","author":"Qiu","year":"2021","journal-title":"Sci. China Technol. Sci."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/11\/1969\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T14:51:01Z","timestamp":1763131861000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/11\/1969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"references-count":24,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2025,11]]}},"alternative-id":["sym17111969"],"URL":"https:\/\/doi.org\/10.3390\/sym17111969","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,14]]}}}