{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T04:16:41Z","timestamp":1771647401781,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004853","name":"CUHK","doi-asserted-by":"crossref","award":["14206715"],"award-info":[{"award-number":["14206715"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004853","name":"CUHK","doi-asserted-by":"crossref","award":["14222816"],"award-info":[{"award-number":["14222816"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hong Kong RGC","award":["ITF 6904079"],"award-info":[{"award-number":["ITF 6904079"]}]},{"name":"Hong Kong RGC","award":["3132821"],"award-info":[{"award-number":["3132821"]}]},{"name":"NSF","award":["DGE-1723250"],"award-info":[{"award-number":["DGE-1723250"]}]},{"name":"Microsoft Azure Research","award":["0740132"],"award-info":[{"award-number":["0740132"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Fuzzy Syst."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tfuzz.2017.2760287","type":"journal-article","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T20:31:09Z","timestamp":1508877069000},"page":"2039-2049","source":"Crossref","is-referenced-by-count":26,"title":["Fuzzy Double Trace Norm Minimization for Recommendation Systems"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1040-352X","authenticated-orcid":false,"given":"Fanhua","family":"Shang","sequence":"first","affiliation":[]},{"given":"Yuanyuan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"James","family":"Cheng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4653-0408","authenticated-orcid":false,"given":"Da","family":"Yan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124309"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1108\/03090560710718148"},{"key":"ref32","first-page":"1033","article-title":"Fast image deconvolution using hyper-Laplacian priors","author":"krishnan","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","article-title":"${L}_{1\/2}$\n regularization: A thresholding representation theory and a fast solver","volume":"23","author":"xu","year":"2012","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref30","first-page":"620","article-title":"Tractable\n and scalable Schatten quasi-norm approximations for rank minimization","author":"shang","year":"2016","journal-title":"Proc 19th Int Conf Artif Intell"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.62"},{"key":"ref35","article-title":"The pagerank citation ranking: Bringing\n order to the web","author":"page","year":"1999","journal-title":"Stanford Digital Library Technologies Project"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-59904-207-7.ch003"},{"key":"ref28","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"srebro","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.02.026"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2748590"},{"key":"ref2","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pac J Optim"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2015.2426201"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.09.001"},{"key":"ref21","first-page":"655","article-title":"Low-rank matrix recovery via\n efficient Schatten $p$-norm minimization","author":"nie","year":"2012","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.61"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20303"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref25","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"13","author":"mohan","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref51","first-page":"575","article-title":"Nuclear norm minimization via active subspace selection","author":"hsieh","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref54","first-page":"1763","article-title":"Generalized higher-order orthogonal iteration for tensor decomposition and completion","author":"liu","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref52","first-page":"1257","article-title":"Probabilistic matrix factorization","author":"salakhutdinov","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","first-page":"417","article-title":"Stability of matrix factorization for collaborative filtering","author":"wang","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662083"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref13","first-page":"406","article-title":"RTRMC: A Riemannian trust-region method for low-rank matrix completion","author":"boumal","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458205"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"ref17","first-page":"2712","article-title":"Exploiting local and global social context\n for recommendation","author":"tang","year":"2013","journal-title":"Proc 6th ACM Int Conf Web Search Data Mining"},{"key":"ref18","first-page":"759","article-title":"Collaborative topic regression with social matrix factorization for recommendation systems","author":"purushotham","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2300487"},{"key":"ref4","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/110840364"},{"key":"ref6","first-page":"2016","article-title":"Scalable\n algorithms for tractable Schatten quasi-norm minimization","author":"shang","year":"2016","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref5","first-page":"1421","article-title":"Scaled gradients on Grassmann manifolds for matrix completion","author":"ngo","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","article-title":"PROPACK-Software for large and sparse SVD calculations","author":"larsen","year":"2005"},{"key":"ref7","first-page":"515","article-title":"A Grassmannian manifold algorithm for nuclear norm\n regularized least squares problems","author":"liu","year":"2014","journal-title":"Proc 30th conf uncertainty in artificial intelligence"},{"key":"ref49","first-page":"937","article-title":"Guaranteed\n rank minimization via singular value projection","author":"jain","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2250577"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS860"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2015.02.025"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033976"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref41","first-page":"612","article-title":"Linearized alternating\n direction method with adaptive penalty for low-rank representation","author":"lin","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0194-5"}],"container-title":["IEEE Transactions on Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/91\/8424402\/8061023-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/91\/8424402\/08061023.pdf?arnumber=8061023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:34Z","timestamp":1649443774000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8061023\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":54,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tfuzz.2017.2760287","relation":{},"ISSN":["1063-6706","1941-0034"],"issn-type":[{"value":"1063-6706","type":"print"},{"value":"1941-0034","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}