{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T23:48:48Z","timestamp":1770680928214,"version":"3.49.0"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2017YFB0802200"],"award-info":[{"award-number":["2017YFB0802200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772393"],"award-info":[{"award-number":["61772393"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007567","name":"City University of Hong Kong","doi-asserted-by":"publisher","award":["7200543"],"award-info":[{"award-number":["7200543"]}],"id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/tcyb.2018.2834898","type":"journal-article","created":{"date-parts":[[2018,6,5]],"date-time":"2018-06-05T19:20:13Z","timestamp":1528226413000},"page":"2941-2954","source":"Crossref","is-referenced-by-count":36,"title":["Multiobjective Sparse Non-Negative Matrix Factorization"],"prefix":"10.1109","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0415-8556","authenticated-orcid":false,"given":"Maoguo","family":"Gong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4650-1308","authenticated-orcid":false,"given":"Xiangming","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6294-6761","authenticated-orcid":false,"given":"Hao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6802-2463","authenticated-orcid":false,"given":"Kay Chen","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/s11704-016-5552-0","article-title":"Optimization methods for regularization-based ill-posed problems: A survey and a multi-objective framework","volume":"11","author":"gong","year":"2017","journal-title":"Front Comput Sci"},{"key":"ref38","first-page":"1328","article-title":"Approximate \n$l_{0}$\n constrained non-negative matrix and tensor factorization","author":"morup","year":"2008","journal-title":"Proc IEEE Int Symp Circuits Syst"},{"key":"ref33","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":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/NNSP.2002.1030067"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2399533"},{"key":"ref30","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"},{"key":"ref37","first-page":"1391","article-title":"The entire regularization path for the support vector machine","volume":"5","author":"hastie","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2016.2535298"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2287153"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2004.824557"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/JSTARS.2013.2280063"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2016.12.010"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2013.2240001"},{"key":"ref63","author":"cichocki","year":"2009","journal-title":"Nonnegative Matrix and Tensor Factorizations Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2011.02.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/110821172"},{"key":"ref29","article-title":"Sparse NMF—Half-baked or well done?","author":"le roux","year":"2015"},{"key":"ref2","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":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2006.1661352"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472216"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1109\/TCYB.2013.2281332","article-title":"Machine learning source separation using maximum a posteriori nonnegative matrix factorization","volume":"44","author":"gao","year":"2014","journal-title":"IEEE Trans Cybern"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref23","article-title":"Accelerating the Lee–Seung algorithm for non-negative matrix factorization","author":"gonzalez","year":"2005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.31"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2212015"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2016.2585201"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2012.2191590"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.09.010"},{"key":"ref57","first-page":"722","article-title":"Finding knees in multi-objective optimization","author":"branke","year":"2004","journal-title":"Proc PPSN"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-540-88908-3_6","article-title":"Consideration of partial user preferences in evolutionary multiobjective optimization","author":"branke","year":"2008","journal-title":"Multiobjective optimization"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498345075"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1976.1101194"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592275"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2296117"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2585355"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref12","first-page":"27","article-title":"Fisher non-negative matrix factorization for learning local features","author":"jia","year":"2004","journal-title":"Proc Asian Conf Comput Vis"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TSMCB.2010.2044788","article-title":"Graph-preserving sparse nonnegative matrix factorization with application to facial expression recognition","volume":"41","author":"zhi","year":"2011","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref14","first-page":"iii-293","article-title":"Non-negative matrix factorization for visual coding","volume":"3","author":"liu","year":"2003","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(03)00089-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2010.2040784"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10588-005-5380-5","article-title":"Email surveillance using non-negative matrix factorization","volume":"11","author":"berry","year":"2005","journal-title":"Comput Math Org Theory"},{"key":"ref18","first-page":"273","article-title":"A constrained non-negative matrix factorization in information retrieval","author":"xu","year":"2003","journal-title":"Proc IEEE Int Conf Inf Reuse Integr"},{"key":"ref19","first-page":"2","article-title":"Nonnegative matrix factorization and applications","volume":"34","author":"chu","year":"2005","journal-title":"IMAGE - Bulletin of the International Linear Algebra Society"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3390\/e13010134"},{"key":"ref3","first-page":"283","article-title":"Generalized nonnegative matrix approximations with Bregman divergences","volume":"18","author":"dhillon","year":"2006","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7439(87)80084-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00168"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2294215"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(00)00026-5"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1198\/016214506000000735"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860485"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref48","first-page":"1081","article-title":"Analysis of multi-stage convex relaxation for sparse regularization","volume":"11","author":"zhang","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-59904-498-9.ch001"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.03.001"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2613067"},{"key":"ref43","article-title":"Optimizing conflicting objectives in NMF using Pareto simulated annealing","author":"foley","year":"2010","journal-title":"Proc AICSP"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8708695\/08372963.pdf?arnumber=8372963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:54:01Z","timestamp":1657745641000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8372963\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":63,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2018.2834898","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}