{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:23:22Z","timestamp":1740140602113,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472145","61372141"],"award-info":[{"award-number":["61472145","61372141"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Special Program for Applied Research on Super Computation of the NSFC-Guangdong Joint Fund"},{"DOI":"10.13039\/501100012245","name":"Science and Technology Planning Project of Guangdong Province","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012245","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011276","name":"State Key Laboratory of Oncology in South China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011276","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Fund for the Central Universities","doi-asserted-by":"crossref","award":["2015ZZ025"],"award-info":[{"award-number":["2015ZZ025"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2019,9,1]]},"DOI":"10.1109\/tcbb.2017.2690282","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T18:39:13Z","timestamp":1490985553000},"page":"1760-1772","source":"Crossref","is-referenced-by-count":3,"title":["Recovering Hidden Diagonal Structures via Non-Negative Matrix Factorization with Multiple Constraints"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7418-5357","authenticated-orcid":false,"given":"Xi","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9687-3900","authenticated-orcid":false,"given":"Guoqiang","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2747-7234","authenticated-orcid":false,"given":"Hongmin","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2009","author":"liu","journal-title":"SLEP Sparse Learning with Efficient Projections","key":"ref39"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1137\/090774823"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1137\/1.9781611972825.10"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1145\/2501654.2501657"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1093\/bioinformatics\/btw003"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1093\/bioinformatics\/btr206"},{"key":"ref37","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Proc Advances Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1002\/env.3170050203"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1093\/bioinformatics\/btr322"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1093\/bioinformatics\/btp708"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1016\/j.ipm.2009.12.007"},{"key":"ref27","first-page":"51","article-title":"Estimation of simultaneously sparse and low rank matrices","author":"richard","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1093\/nar\/gks725"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1039\/c3ay41907j"},{"key":"ref1","first-page":"1457","article-title":"Non-negative matrix factorization with sparseness constraints","volume":"5","author":"hoyer","year":"2004","journal-title":"J Mach Learn Res"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/j.neucom.2015.06.049"},{"key":"ref22","first-page":"673","article-title":"Robust nonnegative matrix factorization using l21-norm","author":"kong","year":"2011","journal-title":"Proc 20th ACM Int Conf Inf Knowl Manag"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/j.neucom.2014.12.124"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","article-title":"Graph regularized nonnegative matrix factorization for data representation","volume":"33","author":"cai","year":"2011","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/2601434"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1186\/1751-0473-8-10"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1016\/j.neucom.2014.05.076"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1093\/nar\/gkg624"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1006\/geno.2002.6698"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TIP.2012.2206040"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TCBB.2014.2328342"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1145\/1835804.1835847"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TSP.2014.2306181"},{"key":"ref13","first-page":"1249","article-title":"Robust near-separable nonnegative matrix factorization using linear optimization","volume":"15","author":"gillis","year":"2014","journal-title":"J Mach Learn Res"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TBME.2012.2228651"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1007\/s11760-014-0661-4"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.sigpro.2015.03.006"},{"key":"ref17","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref18","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"2009","journal-title":"Proc Advances Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1093\/bioinformatics\/btm134"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TIP.2012.2192742"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1371\/journal.pone.0073309"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TBME.2013.2288783"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/j.neucom.2015.07.032"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TSP.2013.2285514","article-title":"Non-negative matrix factorization revisited: Uniqueness and algorithm for symmetric decomposition","volume":"62","author":"sidiropoulos","year":"2014","journal-title":"IEEE Trans Signal Process"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1635","DOI":"10.1109\/TIP.2010.2042645","article-title":"Enhanced local texture feature sets for face recognition under difficult lighting conditions","volume":"19","author":"tan","year":"2010","journal-title":"IEEE Trans Image Process"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1038\/415436a"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/j.ins.2015.10.038"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1016\/j.neucom.2008.01.022"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1016\/j.patrec.2010.08.001"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1126\/science.286.5439.531"},{"key":"ref47","first-page":"1079","article-title":"Clustering by nonnegative matrix factorization using graph random walk","author":"yang","year":"2012","journal-title":"Proc Advances Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1561\/2200000016"},{"key":"ref41","article-title":"Detecting copy number variants from ngs with sparse and smooth constraints","volume":"pp","author":"zhang","year":"2016","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1016\/j.patrec.2009.09.011"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1109\/TNN.2005.845141"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/8863041\/07891000.pdf?arnumber=7891000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:13:23Z","timestamp":1657746803000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7891000\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,1]]},"references-count":51,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2017.2690282","relation":{},"ISSN":["1545-5963","1557-9964","2374-0043"],"issn-type":[{"type":"print","value":"1545-5963"},{"type":"electronic","value":"1557-9964"},{"type":"electronic","value":"2374-0043"}],"subject":[],"published":{"date-parts":[[2019,9,1]]}}}