{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T10:18:25Z","timestamp":1768472305382,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T00:00:00Z","timestamp":1680048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T00:00:00Z","timestamp":1680048000000},"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":["12071104"],"award-info":[{"award-number":["12071104"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LD19A010002"],"award-info":[{"award-number":["LD19A010002"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10915-023-02172-y","type":"journal-article","created":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T11:03:31Z","timestamp":1680087811000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Practical Sketching Algorithms for Low-Rank Tucker Approximation of Large Tensors"],"prefix":"10.1007","volume":"95","author":[{"given":"Wandi","family":"Dong","sequence":"first","affiliation":[]},{"given":"Gaohang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Liqun","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Xiaohao","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"issue":"3","key":"2172_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MSP.2014.2298533","volume":"31","author":"P Comon","year":"2014","unstructured":"Comon, P.: Tensors: a brief introduction. IEEE Signal Process. Mag. 31(3), 44\u201353 (2014)","journal-title":"IEEE Signal Process. Mag."},{"issue":"1\u20134","key":"2172_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/sapm19287139","volume":"7","author":"FL Hitchcock","year":"1928","unstructured":"Hitchcock, F.L.: Multiple invariants and generalized rank of a P-Way matrix or tensor. J. Math. Phys. 7(1\u20134), 39\u201379 (1928)","journal-title":"J. Math. Phys."},{"issue":"3","key":"2172_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I","volume":"14","author":"HAL Kiers","year":"2000","unstructured":"Kiers, H.A.L.: Towards a standardized notation and terminology in multiway analysis. J. Chemom Soc. 14(3), 105\u2013122 (2000)","journal-title":"J. Chemom Soc."},{"key":"2172_CR4","first-page":"122","volume":"15","author":"LR Tucker","year":"1963","unstructured":"Tucker, L.R.: Implications of factor analysis of three-way matrices for measurement of change. Probl. Meas. Change 15, 122\u2013137 (1963)","journal-title":"Probl. Meas. Change"},{"issue":"3","key":"2172_CR5","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(3), 279\u2013311 (1966)","journal-title":"Psychometrika"},{"issue":"4","key":"2172_CR6","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(4), 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"2172_CR7","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/s00041-009-9094-9","volume":"15","author":"W Hackbusch","year":"2009","unstructured":"Hackbusch, W., K\u00fchn, S.: A new scheme for the tensor representation. J. Fourier Anal. Appl. 15(5), 706\u2013722 (2009)","journal-title":"J. Fourier Anal. Appl."},{"issue":"4","key":"2172_CR8","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1137\/090764189","volume":"31","author":"L Grasedyck","year":"2010","unstructured":"Grasedyck, L.: Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl. 31(4), 2029\u20132054 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"2172_CR9","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"2172_CR10","doi-asserted-by":"publisher","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-(r1, r2,...,rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21(4), 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2172_CR11","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(2), A1027\u2013A1052 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"2172_CR12","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Decomposition of big tensors with low multilinear rank. arXiv preprint, arXiv:1412.1885 (2014)"},{"issue":"1","key":"2172_CR13","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(1), 395\u2013428 (2019)","journal-title":"Adv. Comput. Math."},{"issue":"1","key":"2172_CR14","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(1), 189\u2013215 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"2","key":"2172_CR15","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 of low multilinear rank approximations of tensors via power scheme and random projection. SIAM J. Matrix Anal. Appl. 41(2), 605\u2013636 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2172_CR16","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(2), 113380 (2021)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"2172_CR17","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., Udell, M.: Low-rank tucker approximation of a tensor from streaming data. SIAM J. Math. Data Sci. 2(4), 1123\u20131150 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"4","key":"2172_CR18","doi-asserted-by":"publisher","first-page":"A2430","DOI":"10.1137\/18M1201068","volume":"41","author":"JA Tropp","year":"2019","unstructured":"Tropp, J.A., Yurtsever, A., Udell, M., Cevher, V.: Streaming low-rank matrix approximation with an application to scientific simulation. SIAM J. Sci. Comput. 41(4), A2430\u2013A2463 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"2172_CR19","first-page":"10116","volume":"31","author":"OA Malik","year":"2018","unstructured":"Malik, O.A., Becker, S.: Low-rank tucker decomposition of large tensors using Tensorsketch. Adv. Neural. Inf. Process. Syst. 31, 10116\u201310126 (2018)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2172_CR20","doi-asserted-by":"publisher","first-page":"28684","DOI":"10.1109\/ACCESS.2021.3058103","volume":"9","author":"S Ahmadi-Asl","year":"2021","unstructured":"Ahmadi-Asl, S., Abukhovich, S., Asante-Mensah, M.G., Cichocki, A., Phan, A.H., Tanaka, T.: Randomized algorithms for computation of Tucker decomposition and higher order SVD (HOSVD). IEEE Access. 9, 28684\u201328706 (2021)","journal-title":"IEEE Access."},{"issue":"2","key":"2172_CR21","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(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"issue":"4","key":"2172_CR22","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(4), 1454\u20131485 (2017)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2172_CR23","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/080736417","volume":"31","author":"V Rokhlin","year":"2009","unstructured":"Rokhlin, V., Szlam, A., Tygert, M.: A randomized algorithm for principal component analysis. SIAM J. Matrix Anal. Appl. 31(3), 1100\u20131124 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2172_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01493-0","volume":"87","author":"C Xiao","year":"2021","unstructured":"Xiao, C., Yang, C., Li, M.: Efficient alternating least squares algorithms for low multilinear rank approximation of tensors. J. Sci. Comput. 87(3), 1\u201325 (2021)","journal-title":"J. Sci. Comput."},{"issue":"5","key":"2172_CR25","doi-asserted-by":"publisher","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(5), e2179 (2018)","journal-title":"Numer. Linear Algebra Appl."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02172-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02172-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02172-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T20:36:02Z","timestamp":1682714162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02172-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,29]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2172"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02172-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,29]]},"assertion":[{"value":"24 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2023","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 have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"52"}}