{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T18:36:32Z","timestamp":1791916592656,"version":"4.3.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10994-020-05927-y","type":"journal-article","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T16:02:59Z","timestamp":1609689779000},"page":"507-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Reshaped tensor nuclear norms for higher order tensor completion"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0452-2343","authenticated-orcid":false,"given":"Kishan","family":"Wimalawarne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroshi","family":"Mamitsuka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,3]]},"reference":[{"key":"5927_CR1","doi-asserted-by":"publisher","first-page":"1806","DOI":"10.1109\/TPAMI.2011.21","volume":"33","author":"J Berclaz","year":"2011","unstructured":"Berclaz, J., Fleuret, F., Turetken, E., & Fua, P. (2011). Multiple object tracking using K-shortest paths optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33, 1806\u201319.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"5927_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"JD Carroll","year":"1970","unstructured":"Carroll, J. D., & Chang, J.-J. (1970). Analysis of individual differences in multidimensional scaling via an n-way generalization of \u201ceckart-young\u201ddecomposition. Psychometrika, 35(3), 283\u2013319.","journal-title":"Psychometrika"},{"key":"5927_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-72927-3_13","volume":"4539","author":"R El-Yaniv","year":"2007","unstructured":"El-Yaniv, R., & Pechyony, D. (2007). Transductive rademacher complexity and its applications. Learning Theory, 4539, 157\u2013171.","journal-title":"Learning Theory"},{"key":"5927_CR4","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., & Boyd, S.\u00a0P. (2001). A rank minimization heuristic with application to minimum order system approximation. In Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) (Vol.\u00a06, pp. 4734\u20134739).","DOI":"10.1109\/ACC.2001.945730"},{"key":"5927_CR5","doi-asserted-by":"crossref","unstructured":"Guo, X., Yao, Q., & Kwok, J.\u00a0T. (2017). Efficient sparse low-rank tensor completion using the frank-wolfe algorithm. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4\u20139, 2017, San Francisco, California, USA. (pp. 1948\u20131954).","DOI":"10.1609\/aaai.v31i1.10886"},{"key":"5927_CR6","doi-asserted-by":"crossref","unstructured":"Hackbusch, W. (2012). Tensor spaces and numerical tensor calculus. Berlin Heidelberg: Springer Series in Computational Mathematics. Springer. ISBN 9783642280276.","DOI":"10.1007\/978-3-642-28027-6"},{"key":"5927_CR7","first-page":"1","volume":"16","author":"RA Harshman","year":"1970","unstructured":"Harshman, R. A. (1970). Foundations of the PARAFAC procedure: Models and conditions for an explanatory multimodal factor analysis. UCLA Working Papers in Phonetics, 16, 1\u201384.","journal-title":"UCLA Working Papers in Phonetics"},{"key":"5927_CR8","doi-asserted-by":"crossref","unstructured":"Hillar, C.\u00a0J., & Lim, L.-H. (2013). Most tensor problems are np-hard. Journal of ACM, 60(6), ISSN 0004-5411.","DOI":"10.1145\/2512329"},{"issue":"1","key":"5927_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F. L. (1927). The expression of a tensor or a polyadic as a sum of products. Journal of Mathematics and Physics, 6(1), 164\u2013189.","journal-title":"Journal of Mathematics and Physics"},{"key":"5927_CR10","unstructured":"Imaizumi, M., Maehara, T., & Hayashi, K. (2017). On tensor train rank minimization: Statistical efficiency and scalable algorithm. In NIPS, pp. 3933\u20133942."},{"key":"5927_CR11","doi-asserted-by":"crossref","unstructured":"Karatzoglou, A., Amatriain, X., Baltrunas, L., & Oliver, N. (2010). Multiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering. In RecSys (pp. 79\u201386). ACM.","DOI":"10.1145\/1864708.1864727"},{"issue":"3","key":"5927_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T. G., & Bader, B. W. (2009). Tensor decompositions and applications. SIAM Review, 51(3), 455\u2013500.","journal-title":"SIAM Review"},{"issue":"5","key":"5927_CR13","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1090\/S0002-9939-04-07800-1","volume":"133","author":"R Lata\u0142a","year":"2005","unstructured":"Lata\u0142a, R. (2005). Some estimates of norms of random matrices. Proceedings of the American Mathematical Society, 133(5), 1273\u20131282.","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"2","key":"5927_CR14","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/TIT.2013.2291876","volume":"60","author":"L Lim","year":"2014","unstructured":"Lim, L., & Comon, P. (2014). Blind multilinear identification. IEEE Transactions on Information Theory, 60(2), 1260\u20131280.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5927_CR15","unstructured":"Liu, J., Musialski, P., Wonka, P., & Ye, J. (2009). Tensor completion for estimating missing values in visual data. In ICCV (pp. 2114\u20132121)."},{"key":"5927_CR16","unstructured":"Mu, C., Huang, B., Wright, J., & Goldfarb, D. (2014). Square deal: Lower bounds and improved relaxations for tensor recovery. In ICML (pp. 73\u201381)."},{"key":"5927_CR17","doi-asserted-by":"crossref","unstructured":"Oseledets, I.\u00a0V. (2011). Tensor-train decomposition. SIAM Journal on Scientific Computing, 33(5), 2295\u20132317, ISSN 1064-8275.","DOI":"10.1137\/090752286"},{"key":"5927_CR18","unstructured":"Rai, P., Hu, C., Harding, M., & Carin, L. (2015). Scalable probabilistic tensor factorization for binary and count data. IJCAI\u201915, pp. 3770\u20133776. AAAI Press. ISBN 978-1-57735-738-4."},{"key":"5927_CR19","unstructured":"Raskutti, G., Chen, H., Yuan, M. (2015). Convex regularization for high-dimensional multi-response tensor regression. CoRR, abs\/1512.01215v2."},{"key":"5927_CR20","first-page":"3401","volume":"15","author":"O Shamir","year":"2014","unstructured":"Shamir, O., & Shalev-Shwartz, S. (2014). Matrix completion with the trace norm: Learning, bounding, and transducing. Journal of Machine Learning Research, 15, 3401\u20133423.","journal-title":"Journal of Machine Learning Research"},{"key":"5927_CR21","unstructured":"Song, Q., Ge, H., Caverlee, J., & Hu, X. (2017). Tensor completion algorithms in big data analytics. CoRR, abs\/1711.10105."},{"key":"5927_CR22","unstructured":"Tomioka, R., & Suzuki, T. (2013). Convex tensor decomposition via structured schatten norm regularization. In NIPS."},{"key":"5927_CR23","unstructured":"Wimalawarne, K., Sugiyama, M., & Tomioka, R. (2014). Multitask learning meets tensor factorization: Task imputation via convex optimization. In NIPS."},{"key":"5927_CR24","doi-asserted-by":"crossref","unstructured":"Yang, Y., Feng, Y., & Suykens, J. A.\u00a0K. (2015). A rank-one tensor updating algorithm for tensor completion. IEEE Signal Processing Letters, 22(10), 1633\u20131637. ISSN 1070-9908.","DOI":"10.1109\/LSP.2015.2420592"},{"issue":"4","key":"5927_CR25","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1007\/s10208-015-9269-5","volume":"16","author":"M Yuan","year":"2016","unstructured":"Yuan, M., & Zhang, C.-H. (2016). On tensor completion via nuclear norm minimization. Foundations of Computational Mathematics, 16(4), 1031\u20131068.","journal-title":"Foundations of Computational Mathematics"},{"key":"5927_CR26","doi-asserted-by":"crossref","unstructured":"Zheng, V.\u00a0W., Cao, B., Zheng, Y., Xie, X., & Yang, Q. (2010). Collaborative filtering meets mobile recommendation: A user-centered approach. In AAAI, AAAI\u201910, pp. 236\u2013241. AAAI Press.","DOI":"10.1609\/aaai.v24i1.7577"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05927-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-020-05927-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05927-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T08:44:41Z","timestamp":1670661881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-020-05927-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,3]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["5927"],"URL":"https:\/\/doi.org\/10.1007\/s10994-020-05927-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,3]]},"assertion":[{"value":"11 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}