{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:20:43Z","timestamp":1767856843623,"version":"3.49.0"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61971128"],"award-info":[{"award-number":["61971128"]}],"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":["61671144"],"award-info":[{"award-number":["61671144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2018YFB1800801"],"award-info":[{"award-number":["2018YFB1800801"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Graduate Scientific Research Innovation Projections in Jiangsu Province","award":["KYLX16_0226"],"award-info":[{"award-number":["KYLX16_0226"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2946485","type":"journal-article","created":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T19:46:48Z","timestamp":1570650408000},"page":"146922-146938","source":"Crossref","is-referenced-by-count":1,"title":["Low-Complexity Decentralized Recommendation System With Similarity Constraints"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4554-3784","authenticated-orcid":false,"given":"Wen","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunguo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3616-4616","authenticated-orcid":false,"given":"Yongming","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luxi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/110836936"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2331611"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2279080"},{"key":"ref31","article-title":"On the convergence rate of multi-block ADMM","author":"lin","year":"2014","journal-title":"arXiv 1408 4265v1"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","article-title":"The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent","volume":"155","author":"chen","year":"2014","journal-title":"Math Program"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425904"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2162831"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2188719"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2002.1040019"},{"key":"ref62","year":"2015","journal-title":"Netflix Prize"},{"key":"ref61","year":"2015","journal-title":"Opencv"},{"key":"ref63","first-page":"2445","article-title":"PU learning for matrix completion","author":"hsieh","year":"2015","journal-title":"Proc 32nd Int Conf Mach Learn"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760448"},{"key":"ref27","author":"bertsekas","year":"1989","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2015.03.008"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1869652.1869665"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0682-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1297231.1297235"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-015-0448-7"},{"key":"ref26","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","article-title":"Decentralized recommender systems","author":"wang","year":"2015","journal-title":"arXiv 1503 01647"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879347"},{"key":"ref51","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-70873-7","author":"gentle","year":"2007","journal-title":"Matrix Algebra Theory Computations and Applications in Statistics"},{"key":"ref59","year":"2015","journal-title":"Tianchi Competition"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365969"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963776"},{"key":"ref56","volume":"3","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/SUPERC.1988.44680"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref52","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref10","first-page":"415","article-title":"Collaborative recurrent autoencoder: Recommend while learning to fill in the blanks","author":"wang","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3285029"},{"key":"ref40","article-title":"On the linear convergence of the alternating direction method of multipliers","author":"hong","year":"2012","journal-title":"arXiv 1208 3922"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2880197"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"},{"key":"ref14","article-title":"Collaborative filtering: A machine learning perspective","author":"marlin","year":"2004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"ref17","article-title":"Learning with matrix factorizations","author":"srebro","year":"2004"},{"key":"ref18","article-title":"Low-rank matrix factorization with attributes","author":"abernethy","year":"2006","journal-title":"arXiv cs\/0611124"},{"key":"ref19","first-page":"1257","article-title":"Probabilistic matrix factorization","author":"mnih","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref3","year":"2015","journal-title":"Netflix Prize"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783273"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"ref8","first-page":"1","article-title":"Collaborative topic regression with social regularization for tag recommendation","author":"wang","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098077"},{"key":"ref49","first-page":"720","article-title":"Weighted low-rank approximations","volume":"3","author":"srebro","year":"2003","journal-title":"Proc ICML"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08786-3_13"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.3.219"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref42","first-page":"1","article-title":"Maxios: Large scale nonnegative matrix factorization for collaborative filtering","author":"du","year":"2014","journal-title":"Proc NIPS Workshop Distrib Matrix Comput"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661996"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2576427"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1147"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08863356.pdf?arnumber=8863356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T20:06:55Z","timestamp":1721851615000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8863356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":63,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2946485","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}