{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T17:33:54Z","timestamp":1782408834787,"version":"3.54.5"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"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":["61772493"],"award-info":[{"award-number":["61772493"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61933007"],"award-info":[{"award-number":["61933007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"publisher","award":["cstc2019jcyjjqX0013"],"award-info":[{"award-number":["cstc2019jcyjjqX0013"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002367","name":"Pioneer Hundred Talents Program of Chinese Academy of Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/tnnls.2020.2990990","type":"journal-article","created":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T19:30:31Z","timestamp":1589225431000},"page":"1737-1749","source":"Crossref","is-referenced-by-count":83,"title":["Convergence Analysis of Single Latent Factor-Dependent, Nonnegative, and Multiplicative Update-Based Nonnegative Latent Factor Models"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3669-3764","authenticated-orcid":false,"given":"Zhigang","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1348-5305","authenticated-orcid":false,"given":"Xin","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9576-7401","authenticated-orcid":false,"given":"Zidong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2469673"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2417509"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2469281"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm134"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref31","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume":"13","author":"lee","year":"2000","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2014.2368594"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2554555"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2472277"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2576427"},{"key":"ref60","first-page":"338","article-title":"A constrained alternating least squares nonnegative matrix factorization algorithm enhances task-related neuronal activity detection from single subject&#x2019;s fMRI data","author":"ding","year":"2011","journal-title":"Proc Int Conf Mach Learn Cybern"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/1297231.1297235"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/1944339.1944341"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TII.2014.2308433","article-title":"An efficient non-negative matrix-factorization-based approach to collaborative filtering for recommender systems","volume":"10","author":"luo","year":"2014","journal-title":"IEEE Trans Ind Informat"},{"key":"ref64","doi-asserted-by":"crossref","first-page":"447d","DOI":"10.1093\/nar\/gku1003","article-title":"STRING v10: Protein-protein interaction networks, integrated over the tree of life","volume":"43","author":"szklarczyk","year":"2015","journal-title":"Nucleic Acids Res"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2289327"},{"key":"ref65","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"dem\u0161ar","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806527"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2018.7511189"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2828699"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2202400"},{"key":"ref2","first-page":"795","article-title":"Linear convergence of gradient and proximal-gradient methods under the polyak-?ojasiewicz condition","author":"karimi","year":"2016","journal-title":"Proc 2016 Joint Eur Conf Mach Learn Knowl Discovery Databases"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.52"},{"key":"ref20","article-title":"Finding approximate local minima faster than gradient descent","author":"agarwal","year":"2016","journal-title":"arXiv 1611 01146"},{"key":"ref22","article-title":"Global optimality of local search for low rank matrix recovery","author":"bhojanapalli","year":"2016","journal-title":"arXiv 1605 07221"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/17M1114296"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2879951"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2925609"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2724769"},{"key":"ref25","first-page":"1724","article-title":"How to escape saddle points efficiently","volume":"70","author":"jin","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref50","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"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9593-0"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065707001275"},{"key":"ref58","article-title":"An instance-frequency-weighted regularization scheme for non-negative latent factor analysis on high-dimensional and sparse data","author":"luo","year":"2019","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2884191"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571978"},{"key":"ref55","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TNN.2011.2172457","article-title":"Symmetric nonnegative matrix factorization: Algorithms and applications to probabilistic clustering","volume":"22","author":"he","year":"2011","journal-title":"IEEE Trans Neural Netw"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0181-y"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860485"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2651"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2014.2348555"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2487323"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2443723"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2210409"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2377154"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2843726"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.06.113"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2212430"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.51"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2460691"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2412037"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref5","first-page":"1","article-title":"Gradient descent only converges to minimizers","volume":"49","author":"lee","year":"2016","journal-title":"Proc JMLR Workshop Conf Proc"},{"key":"ref8","article-title":"Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent","author":"zheng","year":"2016","journal-title":"arXiv 1605 07051"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/srep07702"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.98"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/nature14541"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2296627"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507164"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2757914"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2875452"},{"key":"ref42","author":"boyd","year":"2009","journal-title":"Convex optimization"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2306181"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245126"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1435417.1435450"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9394817\/09091142.pdf?arnumber=9091142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:59Z","timestamp":1652194379000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9091142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":70,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2020.2990990","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}