{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:53:16Z","timestamp":1779382396002,"version":"3.53.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tkde.2022.3206881","type":"journal-article","created":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T19:36:47Z","timestamp":1663270607000},"page":"1-13","source":"Crossref","is-referenced-by-count":13,"title":["Structured Sparse Non-negative Matrix Factorization with $\\ell _{2,0}$-Norm"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2558-2911","authenticated-orcid":false,"given":"Wenwen","family":"Min","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, Yunnan University, Kunming, Yunnan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taosheng","family":"Xu","sequence":"additional","affiliation":[{"name":"Warshel Institute for Computational Biology, The Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2324-6527","authenticated-orcid":false,"given":"Xiang","family":"Wan","sequence":"additional","affiliation":[{"name":"Shenzhen Research Institute of Big Data, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1349-2764","authenticated-orcid":false,"given":"Tsung-Hui","family":"Chang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkz488"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gky440"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-017-0376-0"},{"key":"ref15","first-page":"1457","article-title":"Non-negative matrix factorization with sparseness constraints","volume":"5","author":"hoyer","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref37","first-page":"1265","article-title":"Sparse k-means with $\\ell _\\infty \/\\ell _{0}$??\/?0 penalty for high-dimensional data clustering","volume":"28","author":"chang","year":"2018","journal-title":"Statistica Sinica"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbab034"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2010.tm09415"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"ref30","article-title":"Clustering by orthogonal NMF model and non-convex penalty optimization","author":"wang","year":"2019","journal-title":"arXiv 1906 00570"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2019.05.006"},{"key":"ref33","first-page":"2111","article-title":"Convergence analysis of proximal gradient with momentum for nonconvex optimization","author":"li","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1805681115"},{"key":"ref32","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","author":"li","year":"2015","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/s41576-018-0088-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.15252\/msb.20188746"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2011.09.024"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2967"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm134"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.65"},{"key":"ref19","first-page":"536","article-title":"Group-sparse SVD models via $L_{1}$L1-and $L_{0}$L0-norm penalties and their applications in biological data","volume":"33","author":"min","year":"2021","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2019.2928518"},{"key":"ref24","first-page":"344","article-title":"Towards structural sparsity: An explicit $\\ell _{2}$?2\/$\\ell _{0}$?0 approach","author":"huang","year":"2010","journal-title":"Proc IEEE 10th Int Conf Data Mining"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.7554\/eLife.36998"},{"key":"ref23","first-page":"1813","article-title":"Efficient and robust feature selection via joint $\\ell _{21}$?21-norms minimization","author":"nie","year":"2010","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2914461"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2837100"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms3508"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2847685"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.18632\/oncotarget.6357"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3054635"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0194-5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaf1204"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2551724"},{"key":"ref44","first-page":"1240","article-title":"Exact top-k feature selection via L2,0-norm constraint","author":"cai","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3136625"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-018-0757-z"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150420"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref29","first-page":"7493","article-title":"Greedy orthogonal pivoting algorithm for non-negative matrix factorization","author":"zhang","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0308531101"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2017.2665557"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw607"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbz062"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2877582"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.51"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1038\/nature22796"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09893402.pdf?arnumber=9893402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T22:04:08Z","timestamp":1688767448000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9893402\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/tkde.2022.3206881","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}