{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T08:40:02Z","timestamp":1741423202209,"version":"3.38.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100016150","name":"Fondation OCP","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100016150","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s40314-024-03031-8","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T19:53:22Z","timestamp":1734983602000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A tensor network low rank completion method"],"prefix":"10.1007","volume":"44","author":[{"given":"Abdeslem Hafid","family":"Bentbib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalide","family":"Jbilou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanaa","family":"Khobizy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,23]]},"reference":[{"key":"3031_CR1","unstructured":"Ahad A, Long Z, Zhu C, Liu Y (2020) Hierarchical tensor ring completion. arXiv preprint arXiv:2004.11720"},{"issue":"5","key":"3031_CR2","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua JA, Phien HN, Tuan HD, Do MN (2017) Efficient tensor completion for color image and video recovery: low-rank tensor train. IEEE Trans Image Process 26(5):2466\u20132479","journal-title":"IEEE Trans Image Process"},{"issue":"2","key":"3031_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10957-021-01947-3","volume":"192","author":"AH Bentbib","year":"2022","unstructured":"Bentbib AH, Hachimi AE, Jbilou K, Ratnani A (2022) A tensor regularized nuclear norm method for image and video completion. J Optim Theory Appl 192(2):401\u2013425","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"3031_CR4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.105.034305","volume":"105","author":"K Bergermann","year":"2022","unstructured":"Bergermann K, Stoll M (2022) Fast computation of matrix function-based centrality measures for layer-coupled multiplex networks. Phys Rev E 105(3):034305","journal-title":"Phys Rev E"},{"issue":"6","key":"3031_CR5","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1002\/nla.2444","volume":"29","author":"M Che","year":"2022","unstructured":"Che M, Wang X, Wei Y, Zhao X (2022) Fast randomized tensor singular value thresholding for low-rank tensor optimization. Numer Linear Algebra Appl 29(6):2444","journal-title":"Numer Linear Algebra Appl"},{"key":"3031_CR6","unstructured":"Cichocki A (2014) Era of big data processing: a new approach via tensor networks and tensor decompositions. arXiv preprint arXiv:1403.2048"},{"issue":"12","key":"3031_CR7","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1007\/s11265-022-01817-9","volume":"94","author":"K El Qate","year":"2022","unstructured":"El Qate K, El Rhabi M, Hakim A, Moreau E, Thirion-Moreau N (2022) Hyperspectral image completion via tensor factorization with a bi-regularization term. J Signal Process Syst 94(12):1545\u20131555","journal-title":"J Signal Process Syst"},{"issue":"1","key":"3031_CR8","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s11075-022-01418-4","volume":"92","author":"S El-Halouy","year":"2023","unstructured":"El-Halouy S, Noschese S, Reichel L (2023) Perron communicability and sensitivity of multilayer networks. Numer Algorithms 92(1):597\u2013617","journal-title":"Numer Algorithms"},{"key":"3031_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0405-2","volume":"6","author":"R Forsati","year":"2016","unstructured":"Forsati R, Barjasteh I, Ross D, Esfahanian A-H, Radha H (2016) Network completion by leveraging similarity of nodes. Soc Netw Anal Min 6:1\u201322","journal-title":"Soc Netw Anal Min"},{"issue":"3","key":"3031_CR10","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1007\/s10957-024-02507-1","volume":"202","author":"F Han","year":"2024","unstructured":"Han F, Wei Y, Xie P (2024) Regularized and structured tensor total least squares methods with applications. J Optim Theory Appl 202(3):1101\u20131136","journal-title":"J Optim Theory Appl"},{"issue":"9","key":"3031_CR11","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2012","unstructured":"Hu Y, Zhang D, Ye J, Li X, He X (2012) Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans Pattern Anal Mach Intell 35(9):2117\u20132130","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3031_CR12","unstructured":"Jain P, Meka R, Dhillon I (2010) Guaranteed rank minimization via singular value projection. Adv Neural Inf Process Syst 23"},{"key":"3031_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.ins.2015.07.049","volume":"326","author":"T-Y Ji","year":"2016","unstructured":"Ji T-Y, Huang T-Z, Zhao X-L, Ma T-H, Liu G (2016) Tensor completion using total variation and low-rank matrix factorization. Inf Sci 326:243\u2013257","journal-title":"Inf Sci"},{"issue":"3","key":"3031_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.camwa.2017.04.017","volume":"74","author":"H Jin","year":"2017","unstructured":"Jin H, Bai M, Ben\u00edtez J, Liu X (2017) The generalized inverses of tensors and an application to linear models. Comput Math Appl 74(3):385\u2013397","journal-title":"Comput Math Appl"},{"issue":"3","key":"3031_CR15","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer ME, Martin CD (2011) Factorization strategies for third-order tensors. Linear Algebra Appl 435(3):641\u2013658","journal-title":"Linear Algebra Appl"},{"key":"3031_CR16","doi-asserted-by":"crossref","unstructured":"Kim M, Leskovec J (2011) The network completion problem: Inferring missing nodes and edges in networks. In: Proceedings of the 2011 SIAM international conference on data mining. SIAM, pp 47\u201358","DOI":"10.1137\/1.9781611972818.5"},{"issue":"3","key":"3031_CR17","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500","journal-title":"SIAM Rev"},{"key":"3031_CR18","first-page":"221","volume":"3","author":"M Laurent","year":"2009","unstructured":"Laurent M (2009) Matrix completion problems. Encycl Optimiz 3:221\u2013229","journal-title":"Encycl Optimiz"},{"issue":"3","key":"3031_CR19","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/090755436","volume":"31","author":"Z Liu","year":"2010","unstructured":"Liu Z, Vandenberghe L (2010) Interior-point method for nuclear norm approximation with application to system identification. SIAM J Matrix Anal Appl 31(3):1235\u20131256","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3031_CR20","doi-asserted-by":"crossref","unstructured":"Long Z, Zhu C, Liu J, Liu Y (2020) Bayesian low rank tensor ring model for image completion. arXiv preprint arXiv:2007.01055","DOI":"10.1109\/TIP.2021.3062195"},{"key":"3031_CR21","unstructured":"Lu C (2018) Tensor-tensor product toolbox. arXiv preprint arXiv:1806.07247"},{"issue":"4","key":"3031_CR22","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TPAMI.2019.2891760","volume":"42","author":"C Lu","year":"2019","unstructured":"Lu C, Feng J, Chen Y, Liu W, Lin Z, Yan S (2019) Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Trans Pattern Anal Mach Intell 42(4):925\u2013938","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3031_CR23","doi-asserted-by":"crossref","unstructured":"Mo C, Ding W, Wei Y (2024) Perturbation analysis on t-eigenvalues of third-order tensors. J Optimiz Theory Appl:1\u201335","DOI":"10.1007\/s10957-024-02444-z"},{"key":"3031_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115652","volume":"185","author":"A Mongia","year":"2021","unstructured":"Mongia A, Majumdar A (2021) Matrix completion on learnt graphs: application to collaborative filtering. Expert Syst Appl 185:115652","journal-title":"Expert Syst Appl"},{"issue":"1","key":"3031_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3278607","volume":"13","author":"Q Song","year":"2019","unstructured":"Song Q, Ge H, Caverlee J, Hu X (2019) Tensor completion algorithms in big data analytics. ACM Trans Knowl Discov Data (TKDD) 13(1):1\u201348","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"5","key":"3031_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s40314-024-02772-w","volume":"43","author":"M Wang","year":"2024","unstructured":"Wang M, Li H (2024) Svd-based algorithms for fully-connected tensor network decomposition. Comput Appl Math 43(5):265","journal-title":"Comput Appl Math"},{"key":"3031_CR27","doi-asserted-by":"crossref","unstructured":"Wang W, Aggarwal V, Aeron S (2017) Efficient low rank tensor ring completion. In: Proceedings of the IEEE international conference on computer vision, pp 5697\u20135705","DOI":"10.1109\/ICCV.2017.607"},{"issue":"4","key":"3031_CR28","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s40314-024-02751-1","volume":"43","author":"M Wang","year":"2024","unstructured":"Wang M, Cui H, Li H (2024) A random sampling algorithm for fully-connected tensor network decomposition with applications. Comput Appl Math 43(4):226","journal-title":"Comput Appl Math"},{"key":"3031_CR29","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10994-019-05846-7","volume":"109","author":"L Yuan","year":"2020","unstructured":"Yuan L, Li C, Cao J, Zhao Q (2020) Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion. Mach Learn 109:603\u2013622","journal-title":"Mach Learn"},{"key":"3031_CR30","doi-asserted-by":"crossref","unstructured":"Yu Y, Li H (2024) Practical sketching-based randomized tensor ring decomposition. Numer Linear Algebra Appl:2548","DOI":"10.1002\/nla.2548"},{"issue":"1","key":"3031_CR31","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s10915-024-02653-8","volume":"101","author":"H Zhang","year":"2024","unstructured":"Zhang H, Huang T-Z, Zhao X-L, Che M (2024) A fast algorithm for rank-(l, m, n) block term decomposition of multi-dimensional data. J Sci Comput 101(1):16","journal-title":"J Sci Comput"},{"key":"3031_CR32","unstructured":"Zhao Q, Zhou G, Xie S, Zhang L, Cichocki A (2016) Tensor ring decomposition. arXiv preprint arXiv:1606.05535"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03031-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-03031-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03031-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T07:58:19Z","timestamp":1741420699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-03031-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,23]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["3031"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-03031-8","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,12,23]]},"assertion":[{"value":"15 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest that could have influenced the work presented in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"87"}}