{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T10:40:22Z","timestamp":1783420822733,"version":"3.54.6"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"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":["61620106002"],"award-info":[{"award-number":["61620106002"]}],"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":["61271376"],"award-info":[{"award-number":["61271376"]}],"id":[{"id":"10.13039\/501100001809","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":[[2019,3]]},"DOI":"10.1109\/tnnls.2018.2851612","type":"journal-article","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T18:51:45Z","timestamp":1532631105000},"page":"751-764","source":"Crossref","is-referenced-by-count":58,"title":["A Fused CP Factorization Method for Incomplete Tensors"],"prefix":"10.1109","volume":"30","author":[{"given":"Yuankai","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5968-103X","authenticated-orcid":false,"given":"Huachun","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9685-2571","authenticated-orcid":false,"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9086-7622","authenticated-orcid":false,"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoxuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586759"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2278516"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.35"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.164"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2423694"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2496858"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0280-z"},{"key":"ref60","author":"dai","year":"2009","journal-title":"The Physics of Compressive Sensing and the Gradient-Based Recovery Algorithms"},{"key":"ref62","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref61","author":"rockafellar","year":"2015","journal-title":"Convex Analysis"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5366-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.10.069"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0341-y"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2013.05.008"},{"key":"ref20","first-page":"ii-73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","author":"mu","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"ref21","author":"phien","year":"2016","journal-title":"Efficient tensor completion Low-rank tensor train"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2012.12.007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11045-013-0269-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.10.030"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.11.020"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2114354"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2011.6083060"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2400415"},{"key":"ref58","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1609\/aaai.v24i1.7577","article-title":"Collaborative filtering meets mobile recommendation: A user-centered approach","author":"zheng","year":"2010","journal-title":"Proc AAAI"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2513411"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0157420"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2016.01.004"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"2029","DOI":"10.1002\/atr.1443","article-title":"Short-term highway traffic flow prediction based on a hybrid strategy considering temporal–spatial information","volume":"50","author":"li","year":"2016","journal-title":"J Adv Transp Banner"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2018.03.001"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.18"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2199502"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2545400"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2611525"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"3219","DOI":"10.1109\/TSP.2005.851115","article-title":"Fast algorithms for multidimensional DCT-to-DCT computation between a block and its associated subblocks","volume":"53","author":"dai","year":"2005","journal-title":"IEEE Trans Signal Process"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2011.2151856"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2015.09.105"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2460697"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref4","author":"frolov","year":"2016","journal-title":"Tensor methods and recommender systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2170081"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2632048.2636073"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.201"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2771264"},{"key":"ref49","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":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2690379"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref46","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate $O(1\/k^{2})$","volume":"27","author":"nesterov","year":"1983","journal-title":"Sov Math Dokl"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOAS514"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42294-7_25"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.2307\/1390712"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8645834\/08421043.pdf?arnumber=8421043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T00:04:02Z","timestamp":1693785842000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8421043\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":62,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2018.2851612","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}