{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:38:38Z","timestamp":1768073918988,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,11]],"date-time":"2025-05-11T00:00:00Z","timestamp":1746921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,11]],"date-time":"2025-05-11T00:00:00Z","timestamp":1746921600000},"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":["12171105"],"award-info":[{"award-number":["12171105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271206"],"award-info":[{"award-number":["11271206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["FRF-DF-19-004"],"award-info":[{"award-number":["FRF-DF-19-004"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10479-025-06614-8","type":"journal-article","created":{"date-parts":[[2025,5,11]],"date-time":"2025-05-11T03:08:41Z","timestamp":1746932921000},"page":"1933-1955","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An extrapolation trust-region alternating least-squares algorithm for triple decomposition of third-order tensors"],"prefix":"10.1007","volume":"349","author":[{"given":"Xuejuan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6363-7170","authenticated-orcid":false,"given":"Jinling","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,11]]},"reference":[{"key":"6614_CR1","doi-asserted-by":"publisher","unstructured":"Bader, B.W., Berry, M.W., & Browne, M. (2008). Discussion tracking in enron email using parafac. In Survey of Text Mining II Clustering, Classification, and Retrieval, pp. 147\u2013163 https:\/\/doi.org\/10.1007\/978-1-84800-046-9_8","DOI":"10.1007\/978-1-84800-046-9_8"},{"key":"6614_CR2","doi-asserted-by":"publisher","unstructured":"Bader, B.W., Harshman, R.A., & Kolda, T.G. (2007). Temporal analysis of semantic graphs using asalsan. In IEEE International Conference on Data Mining (ICDM 2007), pp. 33\u201342 https:\/\/doi.org\/10.1109\/ICDM.2007.54","DOI":"10.1109\/ICDM.2007.54"},{"issue":"3","key":"6614_CR3","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\u2019\u2019 decomposition. Psychometrika, 35(3), 283\u2013319. https:\/\/doi.org\/10.1007\/BF02310791","journal-title":"Psychometrika"},{"key":"6614_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-022-05042-2","author":"G Cardillo","year":"2022","unstructured":"Cardillo, G., Giordani, P., Levantesi, S., & Nigri, A. (2022). A tensor-based approach to cause-of-death mortality modeling. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-022-05042-2","journal-title":"Annals of Operations Research"},{"key":"6614_CR5","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.cam.2018.05.046","volume":"347","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Sun, W., Xi, M., & Yuan, J. (2019). A seminorm regularized alternating least squares algorithm for canonical tensor decomposition. Journal of Computational and Applied Mathematics, 347, 296\u2013313. https:\/\/doi.org\/10.1016\/j.cam.2018.05.046","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"6614_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-021-01574-0","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Zhang, X., Qi, L., & Xu, Y. (2021). A Barzilai\u2013Borwein gradient algorithm for spatio-temporal internet traffic data completion via tensor triple decomposition. Journal of Scientific Computing. https:\/\/doi.org\/10.1007\/s10915-021-01574-0","journal-title":"Journal of Scientific Computing"},{"issue":"4","key":"6614_CR7","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. (2000). A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications, 21(4), 1253\u20131278. https:\/\/doi.org\/10.1137\/S0895479896305696","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"6614_CR8","unstructured":"Georgia Tech Face Database. http:\/\/www.anefian.com\/research\/face_reco.htm"},{"key":"6614_CR9","unstructured":"Harshman, R. A. (1970). Foundations of the parafac procedure: Models and conditions for an \u201cexplanatory\" multi-model factor analysis. UCLA Working Papers in Phonetics, 16, 1\u201384."},{"key":"6614_CR10","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, 164\u2013189. https:\/\/doi.org\/10.1002\/sapm192761164","journal-title":"Journal of Mathematics and Physics"},{"issue":"2","key":"6614_CR11","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aaea94","volume":"4","author":"W Huggins","year":"2019","unstructured":"Huggins, W., Patil, P., Mitchell, B., Whaley, K. B., & Stoudenmire, E. M. (2019). Towards quantum machine learning with tensor networks. Quantum Science and Technology, 4(2), Article 024001. https:\/\/doi.org\/10.1088\/2058-9565\/aaea94","journal-title":"Quantum Science and Technology"},{"issue":"502","key":"6614_CR12","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/01621459.2013.776499","volume":"108","author":"LL Hua Zhou","year":"2013","unstructured":"Hua Zhou, L. L., & Zhu, H. (2013). Tensor regression with applications in neuroimaging data analysis. Journal of the American Statistical Association, 108(502), 540\u2013552. https:\/\/doi.org\/10.1080\/01621459.2013.776499","journal-title":"Journal of the American Statistical Association"},{"issue":"1","key":"6614_CR13","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. (2011). Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme. SIAM Journal on Matrix Analysis and Applications, 32(1), 115\u2013135. https:\/\/doi.org\/10.1137\/090764827","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"3","key":"6614_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.4208\/jcm.1605-m2016-0828","volume":"36","author":"F Jiang","year":"2018","unstructured":"Jiang, F., Han, D., & Zhang, X. (2018). A trust-region-based alternating least-squares algorithm for tensor decompositions. Journal of Computational Mathematics, 36(3), 351\u2013373. https:\/\/doi.org\/10.4208\/jcm.1605-m2016-0828","journal-title":"Journal of Computational Mathematics"},{"key":"6614_CR15","unstructured":"Kolda, T., & Bader, B. (2006). The tophits model for higher-order web link analysis. Workshop on Link Analysis, Counterterrorism and Security 7"},{"issue":"3","key":"6614_CR16","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. https:\/\/doi.org\/10.1137\/07070111X","journal-title":"SIAM Review"},{"issue":"3","key":"6614_CR17","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. (2000). Towards a standardized notation and terminology in multiway analysis. Journal of Chemometrics, 14(3), 105\u2013122. https:\/\/doi.org\/10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I","journal-title":"Journal of Chemometrics"},{"issue":"1","key":"6614_CR18","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF02293599","volume":"45","author":"PM Kroonenberg","year":"1980","unstructured":"Kroonenberg, P. M., & Leeuw, J. D. (1980). Principal component analysis of three-mode data by means of alternating least squares algorithms. Psychometrika, 45(1), 69\u201397. https:\/\/doi.org\/10.1007\/BF02293599","journal-title":"Psychometrika"},{"key":"6614_CR19","doi-asserted-by":"publisher","unstructured":"Kolda, T. G. (2006). Multilinear operators for higher-order decompositions. https:\/\/doi.org\/10.2172\/923081","DOI":"10.2172\/923081"},{"issue":"2","key":"6614_CR20","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.laa.2011.12.002","volume":"438","author":"N Li","year":"2013","unstructured":"Li, N., Kindermann, S., & Navasca, C. (2013). Some convergence results on the regularized alternating least-squares method for tensor decomposition. Linear Algebra and its Applications, 438(2), 796\u2013812. https:\/\/doi.org\/10.1016\/j.laa.2011.12.002","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"6614_CR21","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1007\/s11045-017-0481-0","volume":"29","author":"CA Lee Namgil","year":"2018","unstructured":"Lee Namgil, C. A. (2018). Fundamental tensor operations for large-scale data analysis using tensor network formats. Multidimensional Systems and Signal Processing, 29(3), 921\u2013960. https:\/\/doi.org\/10.1007\/s11045-017-0481-0","journal-title":"Multidimensional Systems and Signal Processing"},{"issue":"1","key":"6614_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1002\/widm.1","volume":"1","author":"M M\u00f8rup","year":"2011","unstructured":"M\u00f8rup, M. (2011). Applications of tensor (multiway array) factorizations and decompositions in data mining. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 1(1), 24\u201340. https:\/\/doi.org\/10.1002\/widm.1","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"issue":"1","key":"6614_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/20M1323266","volume":"42","author":"L Qi","year":"2021","unstructured":"Qi, L., Chen, Y., Bakshi, M., & Zhang, X. (2021). Triple decomposition and tensor recovery of third order tensors. SIAM Journal on Matrix Analysis and Applications, 42(1), 299\u2013329. https:\/\/doi.org\/10.1137\/20M1323266","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"6614_CR24","doi-asserted-by":"publisher","DOI":"10.27034\/d.cnki.ggxiu.2023.002639","volume-title":"Study on an optimal extrapolation step size alternating least squares algorithm for tensor triple decomposition","author":"K Qin","year":"2023","unstructured":"Qin, K. (2023). Study on an optimal extrapolation step size alternating least squares algorithm for tensor triple decomposition. Guangxi University. https:\/\/doi.org\/10.27034\/d.cnki.ggxiu.2023.002639"},{"key":"6614_CR25","unstructured":"Rabanser, S., Shchur, O., & G\u00fcnnemann, S. (2017). Introduction to tensor decompositions and their applications in machine learning. arxiv:1711.10781"},{"issue":"13","key":"6614_CR26","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1109\/TSP.2017.2690524","volume":"65","author":"ND Sidiropoulos","year":"2017","unstructured":"Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017). Tensor decomposition for signal processing and machine learning. IEEE Transactions on Signal Processing, 65(13), 3551\u20133582. https:\/\/doi.org\/10.1109\/TSP.2017.2690524","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"6614_CR27","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"L Tucker","year":"1966","unstructured":"Tucker, L. (1966). Some mathematical notes on three-mode factor analysis. Psychometrika, 31(3), 279\u2013311. https:\/\/doi.org\/10.1007\/BF02289464","journal-title":"Psychometrika"},{"key":"6614_CR28","unstructured":"Vasilache, N., Zinenko, O., Theodoridis, T., Goyal, P., DeVito, Z., Moses, W.S., Verdoolaege, S., Adams, A., & Cohen, A. (2018). Tensor comprehensions: Framework-agnostic high-performance machine learning abstractions. arxiv:1802.04730"},{"issue":"3","key":"6614_CR29","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s10957-022-02001-6","volume":"192","author":"F Wu","year":"2022","unstructured":"Wu, F., Li, C., & Li, Y. (2022). Manifold regularization nonnegative triple decomposition of tensor sets for image compression and representation. Journal of Optimization Theory and Applications, 192(3), 979\u20131000. https:\/\/doi.org\/10.1007\/s10957-022-02001-6","journal-title":"Journal of Optimization Theory and Applications"},{"key":"6614_CR30","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02293984","volume":"51","author":"TJ Wansbeek","year":"1986","unstructured":"Wansbeek, T. J., Neudecker, H., & Kapteyn, A. J. (1986). An approach to n-mode components analysis. Psychometrika, 51, 269\u2013275. https:\/\/doi.org\/10.1007\/BF02293984","journal-title":"Psychometrika"},{"key":"6614_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-021-01493-0","author":"C Xiao","year":"2021","unstructured":"Xiao, C., Yang, C., & Li, M. (2021). Efficient alternating least squares algorithms for low multilinear rank approximation of tensors. Journal of Scientific Computing. https:\/\/doi.org\/10.1007\/s10915-021-01493-0","journal-title":"Journal of Scientific Computing"},{"key":"6614_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-021-04147-4","author":"Z Zhang","year":"2021","unstructured":"Zhang, Z., Ling, C., He, H., & Qi, L. (2021). A tensor train approach for internet traffic data completion. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-021-04147-4","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06614-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06614-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06614-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T17:09:28Z","timestamp":1750093768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06614-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,11]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["6614"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06614-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,11]]},"assertion":[{"value":"28 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2025","order":3,"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 they have no financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}