{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T14:10:52Z","timestamp":1773411052538,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012271","name":"Shenzhen Fundamental Research and Discipline Layout project","doi-asserted-by":"publisher","award":["JCYJ20190813171003723"],"award-info":[{"award-number":["JCYJ20190813171003723"]}],"id":[{"id":"10.13039\/501100012271","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Research Fund from Shenzhen Research Institute of Big Data","award":["2019ORF01002"],"award-info":[{"award-number":["2019ORF01002"]}]},{"name":"NSFC, China","award":["61731018"],"award-info":[{"award-number":["61731018"]}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-18-1-0382"],"award-info":[{"award-number":["FA9550-18-1-0382"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3102106","type":"journal-article","created":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T19:59:30Z","timestamp":1628279970000},"page":"5273-5288","source":"Crossref","is-referenced-by-count":35,"title":["Clustering by Orthogonal NMF Model and Non-Convex Penalty Optimization"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6457-9478","authenticated-orcid":false,"given":"Shuai","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1349-2764","authenticated-orcid":false,"given":"Tsung-Hui","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Jong-Shi","family":"Pang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2307\/1217208"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.9.763"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.165"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1038\/nature07385","article-title":"Comprehensive genomic characterization defines human glioblastoma genes and core pathways","volume":"455","author":"mclendon","year":"2008","journal-title":"Nature"},{"key":"ref30","year":"0","journal-title":"The tcga database"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0795"},{"key":"ref36","article-title":"Supplementary material of clustering by orthogonal NMF model and non-convex penalty optimization","author":"wang","year":"0"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"ref34","volume":"i","author":"facchinei","year":"2003","journal-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems"},{"key":"ref28","author":"nocedal","year":"2006","journal-title":"Numerical Optimization Series in Operations Research and Financial Engineering"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-020-01184-w"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1201\/b15410"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683466"},{"key":"ref20","first-page":"1828","article-title":"Algorithms for orthogonal non-negative matrix factorization","author":"choi","year":"2008","journal-title":"Proc IEEE Int Joint Conf Neural Netw"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.02.018"},{"key":"ref21","first-page":"129","article-title":"A fast hierarchical alternating least squares algorithm for orthogonal non-negative matrix factorization","author":"kimura","year":"2015","journal-title":"Proc ACML"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2014.7025564"},{"key":"ref23","first-page":"343","article-title":"Orthogonal NMF through subspace exploration","author":"asteris","year":"2015","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref26","first-page":"210","article-title":"Proximal gradient method for non-smooth optimization over the Stiefel manifold","volume":"30","author":"chen","year":"2020","journal-title":"Soc Ind Appl Math J Optim"},{"key":"ref25","first-page":"177","article-title":"Nonparametric orthogonal NMF and its application in cancer clustering","author":"a","year":"2013","journal-title":"Proc DaEng"},{"key":"ref10","article-title":"K-means clustering is matrix factorization","author":"bauckhage","year":"0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2614491"},{"key":"ref40","author":"hastie","year":"2009","journal-title":"The Elements of Statistical Learning Data Mining Inference and Prediction"},{"key":"ref12","first-page":"1027","article-title":"K-means: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc SODA"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref14","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2000","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref15","article-title":"A review of non-negative matrix factorization methods for clustering","author":"turkmen","year":"0","journal-title":"CoRR"},{"key":"ref16","first-page":"478","article-title":"Unsupervised deep embedding for clustering analysis","author":"xie","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","first-page":"3861","article-title":"Towards k-means-friendly spaces: Simultaneous deep learning and clustering","author":"yang","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref18","first-page":"20","article-title":"Orthogonal non-negative matrix t-factorizations for clustering","author":"ding","year":"2006","journal-title":"Proc ACM KDD"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.5626\/JCSE.2010.4.2.097"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IC3I.2014.7019655"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2013.65"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0308531101"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TITB.2009.2018115"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref7","first-page":"876","article-title":"Cell subclass identification in single-cell RNA-sequencing data using orthogonal non-negative matrix factorization","author":"wang","year":"2018","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2016.2516339"},{"key":"ref9","first-page":"1339","article-title":"K-means clustering with distributed dimensions","author":"ding","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref46","first-page":"570","article-title":"Distributed clustering via lsh based data clustering","author":"bhaskara","year":"2018","journal-title":"Proc Neural Inf Process Syst Stockholmsmassan"},{"key":"ref45","first-page":"1995","article-title":"Distributed k-means and k-median clustering on general topologies","author":"balcan","year":"2013","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref48","first-page":"419","article-title":"Selecting beta-divergence for nonnegative matrix factorization by score matching","author":"liu","year":"2012","journal-title":"Proc Int Conf Artif Neural Netw"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00168"},{"key":"ref42","first-page":"3059","article-title":"An accelerated proximal coordinate gradient method","author":"lin","year":"2014","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref41","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/130949993"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/190"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09508841.pdf?arnumber=9508841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:33Z","timestamp":1652194233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9508841\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3102106","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}