{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T20:00:23Z","timestamp":1760385623065,"version":"3.37.3"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Huai\u2019an Key Research And Development Plan (industry and informatization)","award":["HAG2015038"],"award-info":[{"award-number":["HAG2015038"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61373063","61601235","61703209","91420201"],"award-info":[{"award-number":["61373063","61601235","61703209","91420201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Pre-Research Area Foundation","award":["6140312010101"],"award-info":[{"award-number":["6140312010101"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2811396","type":"journal-article","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T14:18:29Z","timestamp":1520000309000},"page":"11559-11572","source":"Crossref","is-referenced-by-count":7,"title":["Tensor Completion Using Spectral $(k,p)$ -Support Norm"],"prefix":"10.1109","volume":"6","author":[{"given":"Dongxu","family":"Wei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0412-2120","authenticated-orcid":false,"given":"Andong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaoqin","family":"Feng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"journal-title":"Tensor decomposition for signal processing and machine learning","year":"2016","author":"sidiropoulos","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/130905010"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref30","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"chen","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983738"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref35","first-page":"1","article-title":"Fitting spectral decay with the k-support norm","author":"mcdonald","year":"2016","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5366-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"article-title":"Matrix rank minimization with applications","year":"2002","author":"fazel","key":"ref29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"journal-title":"Tensor completion algorithms in big data analytics","year":"2017","author":"song","key":"ref20"},{"key":"ref22","first-page":"2967","article-title":"A new convex relaxation for tensor completion","author":"romera-paredes","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","first-page":"1331","article-title":"Convex tensor decomposition via structured schatten norm regularization","author":"tomioka","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref23","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","author":"mu","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2015.9.601"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2672439"},{"journal-title":"Low-rank tensor networks for dimensionality reduction and large-scale optimization problems Perspectives and challenges part 1","year":"2016","author":"cichocki","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2915921"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/15M101628X"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"journal-title":"Estimation of Low-Rank Tensors via Convex Optimization","year":"2010","author":"tomioka","key":"ref13"},{"key":"ref14","first-page":"1","article-title":"Foundations of the PARAFAC procedure: Models and conditions for an ‘explanatory’ multimodal factor analysis","author":"harshman","year":"1970","journal-title":"Proc UCLA Working Papers Phonetics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2770146"},{"key":"ref18","first-page":"45","article-title":"Most tensor problems are NP-hard","volume":"60","author":"hillar","year":"2009","journal-title":"J ACM"},{"key":"ref19","first-page":"972","article-title":"Statistical performance of convex tensor decomposition","author":"tomioka","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2627243"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2245416"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2017.78"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.01.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2715981"},{"journal-title":"Tensor ring decomposition","year":"2016","author":"zhao","key":"ref49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2264678"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2762595"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"984809","DOI":"10.1117\/12.2224039","article-title":"Low-tubal-rank tensor completion using alternating minimization","volume":"9848","author":"liu","year":"2016","journal-title":"Proc SPIE"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5511-2"},{"key":"ref47","first-page":"3284","article-title":"Tight convex relaxations for sparse matrix factorization","author":"richard","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref42","first-page":"1180","article-title":"Unified view of matrix completion under general structural constraints","author":"gunasekar","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","first-page":"3150","article-title":"A universal primal-dual convex optimization framework","author":"yurtsever","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref44","first-page":"339","article-title":"Provable models for robust low-rank tensor completion","volume":"11","author":"huang","year":"2015","journal-title":"Pacific J Optim"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90407-2"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08306106.pdf?arnumber=8306106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:45Z","timestamp":1641987585000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8306106\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2811396","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}