{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T15:49:38Z","timestamp":1763567378898,"version":"3.45.0"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:00:00Z","timestamp":1762387200000},"content-version":"vor","delay-in-days":5,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12361033"],"award-info":[{"award-number":["12361033"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013078","name":"Natural Science Research Project of Guizhou Province","doi-asserted-by":"publisher","award":["QKHJC-ZK[2024]YB528"],"award-info":[{"award-number":["QKHJC-ZK[2024]YB528"]}],"id":[{"id":"10.13039\/501100013078","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guiyang University Multidisciplinary Team Construction Projects","award":["Gyxk202503"],"award-info":[{"award-number":["Gyxk202503"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s44443-025-00321-x","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T10:59:39Z","timestamp":1762426779000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep hypergraph regularized $$L_{p}$$ smooth semi-nonnegative matrix factorization for hierarchical clustering analysis"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0614-5442","authenticated-orcid":false,"given":"Shunli","family":"Li","sequence":"first","affiliation":[]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Mingjun","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,6]]},"reference":[{"key":"321_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal S, Lim J, Zelnik-Manor L, et\u00a0al (2005) Beyond pairwise clustering. In: 2005 IEEE computer society conference on computer vision and pattern recognition (CVPR\u201905), pp 838\u2013845","DOI":"10.1109\/CVPR.2005.89"},{"issue":"6","key":"321_CR2","volume":"58","author":"MH Aghdam","year":"2021","unstructured":"Aghdam MH, Zanjani MD (2021) A novel regularized asymmetric non-negative matrix factorization for text clustering. Inf Process Manag 58(6):102694","journal-title":"Inf Process Manag"},{"key":"321_CR3","doi-asserted-by":"crossref","unstructured":"Ajagbe SA, Mudali P, Adigun MO (2024) Assessing data-driven of discriminative deep learning models in classification task using synthetic pandemic dataset. In: Southern african conference for artificial intelligence research. Springer Nature Switzerland, Cham","DOI":"10.1007\/978-3-031-78255-8_17"},{"issue":"2","key":"321_CR4","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch H, Bolte J, Redont P et al (2010) Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the kurdyka-lojasiewicz inequality. Math Oper Res 35(2):438\u2013457","journal-title":"Math Oper Res"},{"issue":"1\u20132","key":"321_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch H, Bolte J, Svaiter BF (2013) Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized gauss-seidel methods. Math Program 137(1\u20132):91\u2013129","journal-title":"Math Program"},{"key":"321_CR6","doi-asserted-by":"crossref","unstructured":"Belkin M, Niyogi P (2001) Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Proceedings of the advances in neural information processing systems, Vancouver, BC, Canada, pp 585\u2013591","DOI":"10.7551\/mitpress\/1120.003.0080"},{"issue":"8","key":"321_CR7","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","volume":"33","author":"D Cai","year":"2011","unstructured":"Cai D, He XF, Han JW et al (2011) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548\u20131560","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"321_CR8","doi-asserted-by":"crossref","unstructured":"Cai D, He X, Wu X, et\u00a0al (2008) Non-negative matrix factorization on manifold. In: Proceedings of the Eighth IEEE international conference on data mining, pp 63\u201372","DOI":"10.1109\/ICDM.2008.57"},{"key":"321_CR9","doi-asserted-by":"crossref","unstructured":"Che H, Li C, Leung MF, et\u00a0al (2024) Robust hypergraph regularized deep non-negative matrix factorization for multi-view clustering. IEEE Transactions on Emerging Topics in Computational Intelligence","DOI":"10.1109\/TETCI.2024.3451352"},{"issue":"8","key":"321_CR10","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TMM.2018.2794985","volume":"20","author":"Z Chen","year":"2018","unstructured":"Chen Z, Li L, Peng H et al (2018) A novel digital watermarking based on general non-negative matrix factorization. IEEE Trans Multimedia 20(8):1973\u20131986","journal-title":"IEEE Trans Multimedia"},{"key":"321_CR11","doi-asserted-by":"crossref","first-page":"81599","DOI":"10.1109\/ACCESS.2019.2924140","volume":"7","author":"Z Chen","year":"2019","unstructured":"Chen Z, Li L, Peng H et al (2019) Sparse general non-negative matrix factorization based on left semi-tensor product. IEEE Access 7:81599\u201381611","journal-title":"IEEE Access"},{"key":"321_CR12","volume":"168","author":"Z Chen","year":"2021","unstructured":"Chen Z, Zhao W, Wang S (2021) Kernel meets recommender systems: a multi-kernel interpolation for matrix completion. Expert Syst Appl 168:114436","journal-title":"Expert Syst Appl"},{"key":"321_CR13","volume-title":"Spectral Graph Theory","author":"FRK Chung","year":"1997","unstructured":"Chung FRK (1997) Spectral Graph Theory. American Mathematical Society, Providence, RI"},{"key":"321_CR14","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1049\/el:20060983","volume":"42","author":"A Cichocki","year":"2006","unstructured":"Cichocki A, Zdunek R (2006) Multilayer nonnegative matrix factorisation Electron Lett-IEE 42:947","journal-title":"Multilayer nonnegative matrix factorisation Electron Lett-IEE"},{"key":"321_CR15","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1142\/S0129065707001275","volume":"17","author":"A Cichocki","year":"2007","unstructured":"Cichocki A, Zdunek R (2007) Multilayer nonnegative matrix factorization using projected gradient approaches. Int J Neural Syst 17:431\u2013446","journal-title":"Int J Neural Syst"},{"key":"321_CR16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ins.2020.03.096","volume":"527","author":"X Dai","year":"2020","unstructured":"Dai X, Su X, Zhang W et al (2020) Robust manhattan non-negative matrix factorization for image recovery and representation. Inf Sci 527:70\u201387","journal-title":"Inf Sci"},{"key":"321_CR17","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2022.109102","volume":"134","author":"P De Handschutter","year":"2023","unstructured":"De Handschutter P, Gillis N (2023) A consistent and flexible framework for deep matrix factorizations. Pattern Recogn 134:109102","journal-title":"Pattern Recogn"},{"key":"321_CR18","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2021.100423","volume":"42","author":"P De Handschutter","year":"2021","unstructured":"De Handschutter P, Gillis N, Siebert X (2021) A survey on deep matrix factorizations. Comput Sci Rev 42:100423","journal-title":"Comput Sci Rev"},{"issue":"1","key":"321_CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TPAMI.2008.277","volume":"32","author":"CH Ding","year":"2008","unstructured":"Ding CH, Li T, Jordan MI (2008) Convex and semi-nonnegative matrix factorizations. IEEE Trans Pattern Anal Mach Intell 32(1):45\u201355","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"321_CR20","first-page":"2899","volume":"10","author":"J Duchi","year":"2009","unstructured":"Duchi J, Singer Y (2009) Efficient online and batch learning using forward backward splitting. J Mach Learn Res 10:2899\u20132934","journal-title":"J Mach Learn Res"},{"issue":"10","key":"321_CR21","doi-asserted-by":"crossref","first-page":"6245","DOI":"10.1109\/TGRS.2018.2834567","volume":"56","author":"XR Feng","year":"2018","unstructured":"Feng XR, Li HC, Li J (2018) Hyperspectral unmixing using sparsity constrained deep non-negative matrix factorization with total variation. IEEE Trans Geosci Remote Sens 56(10):6245\u20136257","journal-title":"IEEE Trans Geosci Remote Sens"},{"key":"321_CR22","doi-asserted-by":"crossref","first-page":"4414","DOI":"10.1109\/JSTARS.2022.3175257","volume":"15","author":"XR Feng","year":"2022","unstructured":"Feng XR, Li HC, Wang R et al (2022) Hyperspectral unmixing based on nonnegative matrix factorization: a comprehensive review. IEEE J Sel Topics Appl Earth Obs Remote Sens 15:4414\u20134436","journal-title":"IEEE J Sel Topics Appl Earth Obs Remote Sens"},{"issue":"4","key":"321_CR23","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"M Figueiredo","year":"2007","unstructured":"Figueiredo M, Nowak R, Wright S (2007) Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J Sel Topics Signal Process 1(4):586\u2013597","journal-title":"IEEE J Sel Topics Signal Process"},{"key":"321_CR24","doi-asserted-by":"crossref","unstructured":"Fu X, Huang K, Sidiropoulos ND (2018) Nonnegative matrix factorization for signal and data analytics: Identifiability, algorithms, and applications. IEEE Signal Process Mag","DOI":"10.1109\/MSP.2018.2877582"},{"issue":"1","key":"321_CR25","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10589-021-00328-w","volume":"81","author":"B Gao","year":"2022","unstructured":"Gao B, Absil PA (2022) A riemannian rank-adaptive method for low-rank matrix completion. Comput Optim Appl 81(1):67\u201390","journal-title":"Comput Optim Appl"},{"key":"321_CR26","first-page":"2548","volume":"44","author":"Y Gao","year":"2020","unstructured":"Gao Y, Zhang Z, Lin H et al (2020) Hypergraph learning: methods and practices. IEEE Trans Pattern Anal Mach Intell 44:2548\u20132566","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"321_CR27","unstructured":"Goldstein T, Studer C, Baraniuk R (2014) A field guide to forward-backward splitting with a fasta implementation. ArXiv preprint arXiv:1411.3406"},{"key":"321_CR28","unstructured":"Gregor K, LeCun Y (2010) Learning fast approximations of sparse coding. In: Proceedings of the 24th annual conference on neural information processing systems (NIPS 2010), pp 399\u2013406"},{"key":"321_CR29","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2023.110179","volume":"148","author":"A Hajiveiseh","year":"2024","unstructured":"Hajiveiseh A, Seyedi SA, Tab FA (2024) Deep asymmetric nonnegative matrix factorization for graph clustering. Pattern Recogn 148:110179","journal-title":"Pattern Recogn"},{"issue":"10","key":"321_CR30","doi-asserted-by":"crossref","first-page":"4318","DOI":"10.1109\/TCYB.2019.2926431","volume":"50","author":"T He","year":"2019","unstructured":"He T, Liu Y, Ko TH et al (2019) Contextual correlation preserving multiview featured graph clustering. IEEE Trans Cybern 50(10):4318\u20134331","journal-title":"IEEE Trans Cybern"},{"key":"321_CR31","unstructured":"Hein M, Setzer S (2011) Beyond spectral clustering-tight relaxations of balanced graph cuts. In: Proceedings of the 25th annual conference on neural information processing systems (NIPS 2011), pp 2366\u20132374"},{"issue":"5786","key":"321_CR32","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1126\/science.1127647","volume":"313","author":"GE Hinton","year":"2006","unstructured":"Hinton GE, Salakhutdinov RR (2006) Reducing the dimensionality of data with neural networks. Science 313(5786):504\u2013507","journal-title":"Science"},{"key":"321_CR33","doi-asserted-by":"crossref","first-page":"9600","DOI":"10.1109\/TIP.2020.3029883","volume":"29","author":"A Huang","year":"2020","unstructured":"Huang A, Zhao T, Lin CW (2020) Multi-view data fusion oriented clustering via nuclear norm minimization. IEEE Trans Image Process 29:9600\u20139613","journal-title":"IEEE Trans Image Process"},{"key":"321_CR34","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.107996","volume":"117","author":"S Huang","year":"2021","unstructured":"Huang S, Kang Z, Zenglin X et al (2021) Robust deep k-means: an effective and simple method for data clustering. Pattern Recogn 117:107996","journal-title":"Pattern Recogn"},{"issue":"2","key":"321_CR35","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1007\/s00034-021-01833-3","volume":"41","author":"H Huang","year":"2022","unstructured":"Huang H, Yang Z, Li Z et al (2022) A converged deep graph semi-nmf algorithm for learning data representation. Circuits Syst Signal Process 41(2):1146\u20131165","journal-title":"Circuits Syst Signal Process"},{"key":"321_CR36","first-page":"1","volume":"34","author":"H Huang","year":"2022","unstructured":"Huang H, Zhou G, Liang N et al (2022) Diverse deep matrix factorization with hypergraph regularization for multiview data representation. IEEE\/CAA J Autom Sin 34:1\u201344","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"321_CR37","doi-asserted-by":"crossref","unstructured":"Huang H, Zhou G, Zhao Q, et\u00a0al (2023) Comprehensive multiview representation learning via deep autoencoder-like nonnegative matrix factorization. IEEE Trans Neural Netw Learn Syst","DOI":"10.1109\/TNNLS.2023.3304626"},{"key":"321_CR38","doi-asserted-by":"crossref","unstructured":"J gou H, Furon T, Fuchs JJ (2012) Anti-sparse coding for approximate nearest neighbor search. In: Proceedings of the IEEE international conference on acoustics, speech and signal processing (ICASSP 2012), pp 2029\u20132032","DOI":"10.1109\/ICASSP.2012.6288307"},{"key":"321_CR39","unstructured":"Jenatton R, Mairal J, Obozinski G, et\u00a0al (2010) Proximal methods for sparse hierarchical dictionary learning. In: Proceedings of the 27th international conference on machine learning"},{"key":"321_CR40","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by nonnegative matrix factorization. Nature 401:788\u2013791","journal-title":"Nature"},{"issue":"2","key":"321_CR41","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/JAS.2019.1911417","volume":"6","author":"C Leng","year":"2019","unstructured":"Leng C, Zhang H, Cai G et al (2019) Graph regularized $$l_p$$ smooth non-negative matrix factorization for data representation. IEEE\/CAA J Autom Sin 6(2):584\u2013595","journal-title":"IEEE\/CAA J Autom Sin"},{"issue":"6","key":"321_CR42","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TETCI.2018.2806890","volume":"2","author":"Z Li","year":"2018","unstructured":"Li Z, Ding S, Chen W et al (2018) Proximal alternating minimization for analysis dictionary learning and convergence analysis. IEEE Trans Emerg Topics Comput Intell 2(6):439\u2013449","journal-title":"IEEE Trans Emerg Topics Comput Intell"},{"key":"321_CR43","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.ins.2022.12.063","volume":"623","author":"G Li","year":"2023","unstructured":"Li G, Song D, Bai W (2023) Consensus and complementary regularized nonnegative matrix factorization for multi-view image clustering. Inf Sci 623:524\u2013538","journal-title":"Inf Sci"},{"key":"321_CR44","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/s10489-025-06367-8","volume":"55","author":"S Li","year":"2025","unstructured":"Li S, Lu L, Liu Q et al (2025) Analysis of deep non-smooth symmetric nonnegative matrix factorization on hierarchical clustering. Appl Intell 55:470","journal-title":"Appl Intell"},{"key":"321_CR45","doi-asserted-by":"crossref","first-page":"25816","DOI":"10.1007\/s10489-023-04887-9","volume":"53","author":"X Lin","year":"2023","unstructured":"Lin X, Chen X, Zheng Z (2023) Deep manifold matrix factorization autoencoder using global connectivity for link prediction. Appl Intell 53:25816\u201325835","journal-title":"Appl Intell"},{"key":"321_CR46","volume-title":"Matching Theory","author":"L Lovasz","year":"1986","unstructured":"Lovasz L, Plummer M (1986) Matching Theory. Akad miai Kiad, North Holland, Budapest"},{"key":"321_CR47","doi-asserted-by":"crossref","unstructured":"Lu X, Wu H, Yuan Y et al (2012) Manifold regularized sparse nmf for hyperspectral unmixing. IEEE Trans Geosci Remote Sens 51:2815\u20132826","DOI":"10.1109\/TGRS.2012.2213825"},{"key":"321_CR48","doi-asserted-by":"crossref","unstructured":"Lyons M, Akamatsu S, Kamachi M, et\u00a0al (1998) Coding facial expressions with gabor wavelets. In: International conference on automatic face and gesture recognition, pp 200\u2013205","DOI":"10.1109\/AFGR.1998.670949"},{"key":"321_CR49","unstructured":"Ng A, Jordan M, Weiss Y (2001) On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems 14"},{"key":"321_CR50","unstructured":"Olsen P, Oztoprak F, Nocedal J, et\u00a0al (2012) Newton-like methods for sparse inverse covariance estimation. In: Proceedings of the 26th Annual Conference on Neural Information Processing Systems (NIPS 2012), pp 764\u2013772"},{"key":"321_CR51","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107683","volume":"111","author":"S Peng","year":"2021","unstructured":"Peng S, Ser W, Chen B et al (2021) Robust semi-supervised nonnegative matrix factorization for image clustering. Pattern Recogn 111:107683","journal-title":"Pattern Recogn"},{"key":"321_CR52","doi-asserted-by":"crossref","unstructured":"Szlam A, Gregor K, LeCun Y (2012) Fast approximations to structured sparse coding and applications to object classification. In: Lect. Notes Comput. Sci., pp 200\u2013213","DOI":"10.1007\/978-3-642-33715-4_15"},{"issue":"3","key":"321_CR53","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TPAMI.2016.2554555","volume":"39","author":"G Trigeorgis","year":"2016","unstructured":"Trigeorgis G, Bousmalis K, Zafeiriou S et al (2016) A deep matrix factorization method for learning attribute representations. IEEE Trans Pattern Anal Mach Intell 39(3):417\u2013429","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"48","key":"321_CR54","doi-asserted-by":"crossref","first-page":"4237","DOI":"10.1016\/j.physleta.2011.09.021","volume":"375","author":"R Venkatesan","year":"2011","unstructured":"Venkatesan R, Plastino A (2011) Deformed statistics kullback-leibler divergence minimization within a scaled bregman framework. Phys Lett A 375(48):4237\u20134243","journal-title":"Phys Lett A"},{"key":"321_CR55","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/JSTARS.2015.2508448","volume":"9","author":"W Wang","year":"2016","unstructured":"Wang W, Qian Y, Tan Y (2016) Hypergraph-regularized sparse nmf for hyperspectral unmixing. IEEE J Sel Top Appl Earth Obs Remot Sens 9:681\u2013694","journal-title":"IEEE J Sel Top Appl Earth Obs Remot Sens"},{"key":"321_CR56","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.ins.2018.01.008","volume":"435","author":"W Wu","year":"2018","unstructured":"Wu W, Kong S, Zhou Y (2018) Nonnegative matrix factorization with mixed hypergraph regularization for community detection. Inf Sci 435:263\u2013281","journal-title":"Inf Sci"},{"key":"321_CR57","volume-title":"Graph Neural Networks","author":"L Wu","year":"2022","unstructured":"Wu L, Cui P, Pei J (2022) Graph Neural Networks. Springer, Singapore"},{"key":"321_CR58","doi-asserted-by":"crossref","first-page":"2821","DOI":"10.3390\/math11132821","volume":"11","author":"Y Xu","year":"2023","unstructured":"Xu Y, Lu L, Liu Q et al (2023) Hypergraph-regularized lp smooth nonnegative matrix factorization for data representation. Mathematics 11:2821","journal-title":"Mathematics"},{"key":"321_CR59","doi-asserted-by":"crossref","unstructured":"Ye F, Chen C, Zheng Z (2018) Deep autoencoder-like nonnegative matrix factorization for community detection. In: Proceedings of the twenty-seventh ACM international conference on information and knowledge management, pp 1393\u20131402","DOI":"10.1145\/3269206.3271697"},{"key":"321_CR60","doi-asserted-by":"crossref","first-page":"3262","DOI":"10.1109\/TIP.2012.2190083","volume":"21","author":"J Yu","year":"2012","unstructured":"Yu J, Tao D, Wang M (2012) Adaptive hypergraph learning and its application in image classification. IEEE Trans Image Process 21:3262\u20133272","journal-title":"IEEE Trans Image Process"},{"key":"321_CR61","doi-asserted-by":"crossref","first-page":"58096","DOI":"10.1109\/ACCESS.2018.2873385","volume":"6","author":"J Yu","year":"2018","unstructured":"Yu J, Zhou G, Cichocki A et al (2018) Learning the hierarchical parts of objects by deep non-smooth nonnegative matrix factorization. IEEE Access 6:58096\u201358105","journal-title":"IEEE Access"},{"key":"321_CR62","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1007\/s11431-021-1957-3","volume":"65","author":"D Zhang","year":"2022","unstructured":"Zhang D (2022) Semi-supervised multi-view clustering with dual hypergraph regularized partially shared nonnegative matrix factorization. Sci China Technol Sci 65:1349\u20131365","journal-title":"Sci China Technol Sci"},{"key":"321_CR63","volume":"132","author":"Y Zhao","year":"2022","unstructured":"Zhao Y, Deng F, Pei J (2022) Progressive deep non-negative matrix factorization architecture with graph convolution-based basis image reorganization. Pattern Recogn 132:108984","journal-title":"Pattern Recogn"},{"key":"321_CR64","first-page":"1601","volume-title":"Advances in Neural Information Processing Systems","author":"D Zhou","year":"2006","unstructured":"Zhou D, Huang J, Scholkopf B (2006) Learning with hypergraphs: clustering, classification, and embedding. Advances in Neural Information Processing Systems, vol 19. MIT Press, Cambridge, MA, USA, pp 1601\u20131608"},{"key":"321_CR65","volume":"174","author":"L Zhou","year":"2021","unstructured":"Zhou L, Du G, Lu K et al (2021) A network-based sparse and multi-manifold regularized multiple non-negative matrix factorization for multi-view clustering. Expert Syst Appl 174:114783","journal-title":"Expert Syst Appl"},{"issue":"9","key":"321_CR66","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1109\/43.784130","volume":"18","author":"JY Zien","year":"2002","unstructured":"Zien JY, Schlag MD, Chan PK (2002) Multilevel spectral hypergraph partitioning with arbitrary vertex sizes. IEEE Trans Comput Aided Des Integr Circuits Syst 18(9):1389\u20131399","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00321-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00321-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00321-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T15:46:28Z","timestamp":1763567188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00321-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":66,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["321"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00321-x","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"type":"print","value":"1319-1578"},{"type":"electronic","value":"2213-1248"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"29 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that no financial and personal conflict of interest with any person or organization could inappropriately influence our work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"303"}}