{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:12:33Z","timestamp":1730297553980,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"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":[],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/smc.2019.8913926","type":"proceedings-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T10:09:34Z","timestamp":1575022174000},"page":"1750-1756","source":"Crossref","is-referenced-by-count":0,"title":["Convergence Analysis of an SLF-NMU Algorithm for Non-negative Latent Factor Analysis on a High-Dimensional and Sparse Matrix"],"prefix":"10.1109","author":[{"given":"Zhigang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2685521"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2585566"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2903736"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2014.2308433"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"ref14","first-page":"556","article-title":"Algorithms for Non-negative Matrix Factorization","volume":"13","author":"lee","year":"2000","journal-title":"Advances in neural information processing systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.58"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0194-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245126"},{"key":"ref19","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 Transactions on Neural Networks"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2415257"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2894283"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1109\/TNNLS.2014.2335234","article-title":"Partially shared latent factor learning with multiview data","volume":"26","author":"liu","year":"2015","journal-title":"IEEE Transactions on Neural Networks & Learning Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2816984"},{"key":"ref6","article-title":"An Effective QoS Estimating Scheme via Alternating Direction Method-based Matrix Factorization","author":"luo","year":"0","journal-title":"IEEE Transactions on Services Computing"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2834898"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2412037"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2843726"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2377154"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref9","article-title":"Latent Factor-based Recommenders Relying on Extended Stochastic Gradient Descent Algorithms","author":"wang","year":"0","journal-title":"IEEE Transactions on Systems Man and Cybernet"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2460691"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9593-0"},{"key":"ref21","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 on Pattern Analysis and Machine Intelligence"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2766528"},{"journal-title":"Convex optimization","year":"2009","author":"boyd","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2014.6999185"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507164"}],"event":{"name":"2019 IEEE International Conference on Systems, Man and Cybernetics (SMC)","start":{"date-parts":[[2019,10,6]]},"location":"Bari, Italy","end":{"date-parts":[[2019,10,9]]}},"container-title":["2019 IEEE International Conference on Systems, Man and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8906183\/8913838\/08913926.pdf?arnumber=8913926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T11:31:52Z","timestamp":1658143912000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8913926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/smc.2019.8913926","relation":{},"subject":[],"published":{"date-parts":[[2019,10]]}}}