{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:39Z","timestamp":1760245059949,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Guangdong Key Research and Development Project of China","award":["2019B010118001","2019B01019001","2019B010121001"],"award-info":[{"award-number":["2019B010118001","2019B01019001","2019B010121001"]}]},{"name":"National Key Research and Development Project of China","award":["2018YFB1802400"],"award-info":[{"award-number":["2018YFB1802400"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1911401"],"award-info":[{"award-number":["U1911401"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3008004","type":"journal-article","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T20:19:22Z","timestamp":1594239562000},"page":"126284-126296","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Tensor Completion Method Via New Latent Nuclear Norm"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7930-5146","authenticated-orcid":false,"given":"Jinshi","family":"Yu","sequence":"first","affiliation":[]},{"given":"Weijun","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0268-0890","authenticated-orcid":false,"given":"Yuning","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Yonghui","family":"Huang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"Tensor ring decomposition with rank minimization on latent space: An efficient approach for tensor completion","author":"yuan","year":"2018","journal-title":"arXiv 1809 02288"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683685"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33019151"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.607"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.23919\/APSIPA.2018.8659708"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2019.2946050"},{"key":"ref37","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":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683115"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2672439"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682231"},{"key":"ref27","article-title":"Tensor ring decomposition","author":"zhao","year":"2016","journal-title":"arXiv 1606 05535"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2020.2994411"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/a11070094"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2850324"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.164"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11045-013-0269-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462592"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-019-01044-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2018.2841825"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2936042"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.23919\/APSIPA.2018.8659492"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2374695"},{"key":"ref13","first-page":"3167","article-title":"A latent factor model for highly multi-relational data","author":"jenatton","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"1","article-title":"Efficient sparse low-rank tensor completion using the Frank-Wolfe algorithm","author":"guo","year":"2017","journal-title":"Proc 31st AAAI Conf Artif Intell"},{"key":"ref15","first-page":"2825","article-title":"Multitask learning meets tensor factorization: Task imputation via convex optimization","author":"wimalawarne","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1201"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2017.2760287"},{"key":"ref18","article-title":"Coupled graphs and tensor factorization for recommender systems and community detection","author":"ioannidis","year":"2018","journal-title":"arXiv 1809 08353"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(97)00032-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2894622"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2019.2901311"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-013-0455-z"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref8","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":"ref7","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2015.9.601"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.05.005"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2019.09.003"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref47","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"2013","journal-title":"Proc ICML"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2020.2987954"},{"key":"ref41","article-title":"Estimation of low-rank tensors via convex optimization","author":"tomioka","year":"2010","journal-title":"arXiv 1010 0789"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2891760"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2019.2940534"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09136661.pdf?arnumber=9136661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:34Z","timestamp":1641949774000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9136661\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3008004","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}