{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:32:09Z","timestamp":1775579529083,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901471"],"award-info":[{"award-number":["11901471"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007847","name":"Natural Science Foundation of Jilin Province","doi-asserted-by":"publisher","award":["11771099"],"award-info":[{"award-number":["11771099"]}],"id":[{"id":"10.13039\/100007847","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong Innovation and Technology Commission"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10915-021-01545-5","type":"journal-article","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T14:03:59Z","timestamp":1623938639000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["An Efficient Randomized Algorithm for Computing the Approximate Tucker Decomposition"],"prefix":"10.1007","volume":"88","author":[{"given":"Maolin","family":"Che","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6192-0546","authenticated-orcid":false,"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"1545_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N Ailon","year":"2009","unstructured":"Ailon, N., Chazelle, B.: The fast Johnson\u2013Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39, 302\u2013322 (2009)","journal-title":"SIAM J. Comput."},{"key":"1545_CR2","doi-asserted-by":"publisher","first-page":"2525","DOI":"10.1016\/j.camwa.2016.09.014","volume":"72","author":"Y Aizenbud","year":"2016","unstructured":"Aizenbud, Y., Shabat, G., Averbuch, A.: Randomized LU decomposition using sparse projections. Comput. Math. Appl. 72, 2525\u20132534 (2016)","journal-title":"Comput. Math. Appl."},{"key":"1545_CR3","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/1186785.1186794","volume":"32","author":"BW Bader","year":"2006","unstructured":"Bader, B.W., Kolda, T.G.: Algorithm 862: Matlab tensor classes for fast algorithm prototyping. ACM Trans. Math. Softw. 32, 635\u2013653 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"1545_CR4","unstructured":"Bader, B.W., Kolda, T.G. et\u00a0al.: Matlab tensor toolbox version 3.0-dev. Available Online (2017). https:\/\/www.tensortoolbox.org"},{"key":"1545_CR5","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/120874540","volume":"34","author":"C Boutsidis","year":"2013","unstructured":"Boutsidis, C., Gittens, A.: Improved matrix algorithms via the subsampled randomized Hadamard transform. SIAM J. Matrix Anal. Appl. 34, 1301\u20131340 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1545_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10444-018-9622-8","volume":"45","author":"M Che","year":"2019","unstructured":"Che, M., Wei, Y.: Randomized algorithms for the approximations of Tucker and the tensor train decompositions. Adv. Comput. Math. 45, 395\u2013428 (2019)","journal-title":"Adv. Comput. Math."},{"key":"1545_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2059-4","volume-title":"Theory and Computation of Complex Tensors and its Applications","author":"M Che","year":"2020","unstructured":"Che, M., Wei, Y.: Theory and Computation of Complex Tensors and its Applications. Springer, Singapore (2020)"},{"key":"1545_CR8","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/19M1237016","volume":"41","author":"M Che","year":"2020","unstructured":"Che, M., Wei, Y., Yan, H.: The computation for low multilinear rank approximations of tensors via power scheme and random projection. SIAM J. Matrix Anal. Appl. 41, 605\u2013636 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1545_CR9","doi-asserted-by":"publisher","first-page":"113380","DOI":"10.1016\/j.cam.2020.113380","volume":"390","author":"M Che","year":"2021","unstructured":"Che, M., Wei, Y., Yan, H.: Randomized algorithms for the low multilinear rank approximations of tensors. J. Comput. Appl. Math. 390, 113380 (2021)","journal-title":"J. Comput. Appl. Math."},{"key":"1545_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.-I.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. Wiley, New York (2009)"},{"key":"1545_CR11","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low rank approximation and regression in input sparsity time. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pp.\u00a081\u201390 (2013)","DOI":"10.1145\/2488608.2488620"},{"key":"1545_CR12","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21, 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1545_CR13","doi-asserted-by":"crossref","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: On the best rank-1 and rank-$$(r_1, r_2,\\ldots, r_n)$$ approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21, 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1545_CR14","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S0097539704442696","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices II: computing a low-rank approximation to a matrix. SIAM J. Comput. 36, 158\u2013183 (2006)","journal-title":"SIAM J. Comput."},{"key":"1545_CR15","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.laa.2006.08.023","volume":"420","author":"P Drineas","year":"2007","unstructured":"Drineas, P., Mahoney, M.W.: A randomized algorithm for a tensor-based generalization of the singular value decomposition. Linear Algebra Appl. 420, 553\u2013571 (2007)","journal-title":"Linear Algebra Appl."},{"key":"1545_CR16","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2842602","volume":"59","author":"P Drineas","year":"2016","unstructured":"Drineas, P., Mahoney, M.W.: RandNLA: randomized numerical linear algebra. Commun. ACM 59, 80\u201390 (2016)","journal-title":"Commun. ACM"},{"key":"1545_CR17","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/070688316","volume":"31","author":"L Eld\u00e9n","year":"2009","unstructured":"Eld\u00e9n, L., Savas, B.: A Newton\u2013Grassmann method for computing the best multilinear rank-$$(r_1, r_2, r_3)$$ approximation of a tensor. SIAM J. Matrix Anal. Appl. 31, 248\u2013271 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1545_CR18","doi-asserted-by":"publisher","first-page":"A1","DOI":"10.1137\/100792056","volume":"34","author":"SA Goreinov","year":"2012","unstructured":"Goreinov, S.A., Oseledets, I.V., Savostyanov, D.V.: Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case. SIAM J. Sci. Comput. 34, A1\u2013A27 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"1545_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/gamm.201310004","volume":"36","author":"L Grasedyck","year":"2013","unstructured":"Grasedyck, L., Kressner, D., Tobler, C.: A literature survey of low-rank tensor approximation techniques. GAMM-Mitt. 36, 53\u201378 (2013)","journal-title":"GAMM-Mitt."},{"key":"1545_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53, 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"1545_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/090764827","volume":"32","author":"M Ishteva","year":"2011","unstructured":"Ishteva, M., Absil, P.-A., Van Huffel, S., De Lathauwer, L.: Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme. SIAM J. Matrix Anal. Appl. 32, 115\u2013135 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1545_CR22","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.: Tensor decompositions and applications. SIAM Rev. 51, 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"1545_CR23","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.aim.2004.08.004","volume":"195","author":"AE Litvak","year":"2005","unstructured":"Litvak, A.E., Pajor, A., Rudelson, M., Tomczakjaegermann, N.: Smallest singular value of random matrices and geometry of random polytopes. Adv. Math. 195, 491\u2013523 (2005)","journal-title":"Adv. Math."},{"key":"1545_CR24","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ast.2009.12.003","volume":"14","author":"LS Lorente","year":"2010","unstructured":"Lorente, L.S., Vega, J.M., Velazquez, A.: Compression of aerodynamic databases using high-order singular value decomposition. Aerosp. Sci. Technol. 14, 168\u2013177 (2010)","journal-title":"Aerosp. Sci. Technol."},{"key":"1545_CR25","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.2514\/1.35258","volume":"45","author":"LS Lorente","year":"2010","unstructured":"Lorente, L.S., Vega, J.M., Velazquez, A.: Generation of aerodynamic databases using high-order singular value decomposition. J. Aircr. 45, 1779\u20131788 (2010)","journal-title":"J. Aircr."},{"key":"1545_CR26","first-page":"123","volume":"3","author":"MW Mahoney","year":"2011","unstructured":"Mahoney, M.W.: Randomized algorithms for matrices and data. Found. Trends Mach. Learn. 3, 123\u2013224 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1545_CR27","doi-asserted-by":"publisher","first-page":"S485","DOI":"10.1137\/15M1026080","volume":"38","author":"P-G Martinsson","year":"2016","unstructured":"Martinsson, P.-G., Voronin, S.: A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices. SIAM J. Sci. Comput. 38, S485\u2013S507 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"1545_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/19M1261043","volume":"2","author":"R Minster","year":"2020","unstructured":"Minster, R., Saibaba, A.K., Kilmer, M.E.: Randomized algorithms for low-rank tensor decompositions in the Tucker format. SIAM J. Math. Data Sci. 2, 189\u2013215 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"1545_CR29","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1137\/060655894","volume":"30","author":"IV Oseledets","year":"2008","unstructured":"Oseledets, I.V., Savostianov, D.V., Tyrtyshnikov, E.E.: Tucker dimensionality reduction of three-dimensional arrays in linear time. SIAM J. Matrix Anal. Appl. 30, 939\u2013956 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1545_CR30","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1093\/imaiai\/iax011","volume":"7","author":"S Oymak","year":"2018","unstructured":"Oymak, S., Tropp, J.A.: Universality laws for randomized dimension reduction, with applications. Inf. Inference: a J. IMA 7, 337\u2013446 (2018)","journal-title":"Inf. Inference: a J. IMA"},{"key":"1545_CR31","doi-asserted-by":"publisher","first-page":"A2634","DOI":"10.1137\/15M1042802","volume":"38","author":"M Reynolds","year":"2015","unstructured":"Reynolds, M., Doostan, A., Beylkin, G.: Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data. SIAM J. Sci. Comput. 38, A2634\u2013A2664 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"1545_CR32","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.patcog.2006.08.004","volume":"40","author":"B Savas","year":"2007","unstructured":"Savas, B., Elden, L.: Handwritten digit classification using higher order singular value decomposition. Pattern Recogn. 40, 993\u20131003 (2007)","journal-title":"Pattern Recogn."},{"key":"1545_CR33","doi-asserted-by":"publisher","first-page":"3352","DOI":"10.1137\/090763172","volume":"32","author":"B Savas","year":"2010","unstructured":"Savas, B., Lim, L.-H.: Quasi-Newton methods on Grassmannians and multilinear approximations of tensors. SIAM J. Sci. Comput. 32, 3352\u20133393 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1545_CR34","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/19M1257718","volume":"2","author":"Y Sun","year":"2020","unstructured":"Sun, Y., Guo, Y., Luo, C., Tropp, J.A., Udell, M.: Low-rank Tucker approximation of a tensor from streaming data. SIAM J. Math. Data Sci. 2, 1123\u20131150 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"1545_CR35","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TSMC.2015.2482458","volume":"46","author":"P Symeonidis","year":"2016","unstructured":"Symeonidis, P.: ClustHOSVD: item recommendation by combining semantically enhanced tag clustering with tensor HOSVD. IEEE Trans. Syst., Man, Cybern.: Syst. 46, 1240\u20131251 (2016)","journal-title":"IEEE Trans. Syst., Man, Cybern.: Syst."},{"key":"1545_CR36","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1137\/17M1111590","volume":"38","author":"JA Tropp","year":"2017","unstructured":"Tropp, J.A., Yurtsever, A., Udell, M., Cevher, V.: Practical sketching algorithms for low-rank matrix approximation. SIAM J. Matrix Anal. Appl. 38, 1454\u20131485 (2017)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1545_CR37","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika 31, 279\u2013311 (1966)","journal-title":"Psychometrika"},{"key":"1545_CR38","doi-asserted-by":"publisher","first-page":"A1027","DOI":"10.1137\/110836067","volume":"34","author":"N Vannieuwenhoven","year":"2012","unstructured":"Vannieuwenhoven, N., Vandebril, R., Meerbergen, K.: A new truncation strategy for the higher-order singular value decomposition. SIAM J. Sci. Comput. 34, A1027\u2013A1052 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"1545_CR39","doi-asserted-by":"crossref","unstructured":"Vasilescu, M., Terzopoulos, D.: Multilinear image analysis for facial recognition. In: Proceedings, 16th International Conference on Pattern Recognition, vol.\u00a02, pp.\u00a0511\u2013514. IEEE (2002)","DOI":"10.1109\/ICPR.2002.1048350"},{"key":"1545_CR40","doi-asserted-by":"crossref","unstructured":"Vasilescu, M., Terzopoulos, D.: Multilinear subspace analysis of image ensembles. In: IEEE Computer Soc. Conf. Computer Vision and Pattern Recognition, vol.\u00a02, pp.\u00a093\u201399. IEEE (2003)","DOI":"10.1109\/CVPR.2003.1211457"},{"key":"1545_CR41","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/1015706.1015725","volume":"23","author":"M Vasilescu","year":"2004","unstructured":"Vasilescu, M., Terzopoulos, D.: Tensor textures: multilinear image-based rendering. ACM Trans. Graph. 23, 336\u2013342 (2004)","journal-title":"ACM Trans. Graph."},{"key":"1545_CR42","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1017\/CBO9780511794308.006","volume-title":"Compressed Sensing: Theory and Practice","author":"R Vershynin","year":"2012","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. In: Eldar, Y.C., Kutyniok, G. (eds.) Compressed Sensing: Theory and Practice, pp. 210\u2013268. Cambridge University Press, Cambridge (2012)"},{"key":"1545_CR43","unstructured":"Vervliet, N., Debals, O., Sorber, L., Van\u00a0Barel, M., De\u00a0Lathauwer, L.: Tensorlab 3.0. Available Online (2016). http:\/\/tensorlab.net"},{"key":"1545_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends Theor. Comput. Sci. 10, 1\u2013157 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1545_CR45","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.acha.2007.12.002","volume":"25","author":"F Woolfe","year":"2008","unstructured":"Woolfe, F., Liberty, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for the approximation of matrices. Appl. Comput. Harmonic Anal. 25, 335\u2013366 (2008)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"1545_CR46","doi-asserted-by":"publisher","first-page":"3702","DOI":"10.1109\/TSP.2017.2695566","volume":"65","author":"J Ying","year":"2017","unstructured":"Ying, J., Lu, H., Wei, Q., Cai, J., Guo, D., Wu, J., Chen, Z., Qu, X.: Hankel matrix nuclear norm regularized tensor completion for $$n$$-dimensional exponential signals. IEEE Trans. Signal Process. 65, 3702\u20133717 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"1545_CR47","doi-asserted-by":"publisher","first-page":"e2179","DOI":"10.1002\/nla.2179","volume":"25","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Saibaba, A.K., Kilmer, M.E., Aeron, S.: A randomized tensor singular value decomposition based on the t-product. Numer. Linear Algebra Appl. 25, e2179 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1545_CR48","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Decomposition of big tensors with low multilinear rank. ArXiv preprint (2014). arXiv:1412.1885v1"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01545-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-021-01545-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-021-01545-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T01:24:31Z","timestamp":1725240271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-021-01545-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,17]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["1545"],"URL":"https:\/\/doi.org\/10.1007\/s10915-021-01545-5","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,17]]},"assertion":[{"value":"25 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"32"}}