{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T08:21:04Z","timestamp":1771230064544,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T00:00:00Z","timestamp":1623628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T00:00:00Z","timestamp":1623628800000},"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":["11771113"],"award-info":[{"award-number":["11771113"]}],"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":["11971138"],"award-info":[{"award-number":["11971138"]}],"id":[{"id":"10.13039\/501100001809","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":[[2024,8]]},"DOI":"10.1007\/s10479-021-04147-4","type":"journal-article","created":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T13:02:36Z","timestamp":1623675756000},"page":"1461-1479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A tensor train approach for internet traffic data completion"],"prefix":"10.1007","volume":"339","author":[{"given":"Zhiyuan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Chen","family":"Ling","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7672-4943","authenticated-orcid":false,"given":"Hongjin","family":"He","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1112-5250","authenticated-orcid":false,"given":"Liqun","family":"Qi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,14]]},"reference":[{"issue":"1","key":"4147_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.chemolab.2010.08.004","volume":"106","author":"E Acar","year":"2011","unstructured":"Acar, E., Dunlavy, D., Kolda, T., & Morup, M. (2011). Scalable tensor factorizations for incomplete data. Chemometrics and Intelligent Laboratory Systems, 106(1), 41\u201356.","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"key":"4147_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C. C. (2016). Model-based collaborative filtering. In: Recommender systems, pp. 71\u2013138. Springer.","DOI":"10.1007\/978-3-319-29659-3_3"},{"key":"4147_CR3","unstructured":"Bader, B. W., Kolda, T. G., et\u00a0al. (2015). MATLAB Tensor Toolbox Version 2.6. Available online. http:\/\/www.sandia.gov\/~tgkolda\/TensorToolbox\/"},{"issue":"5","key":"4147_CR4","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua, J. A., Phien, H., Tuan, H. D., & Do, M. N. (2017). Efficient tensor completion for color image and video recovery: Low-rank tensor train. IEEE Transactions on Image Processing, 26(5), 2466\u20132479.","journal-title":"IEEE Transactions on Image Processing"},{"key":"4147_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., & Teboulle, M. (2014). Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Mathematical Programming, 146, 459\u2013494.","journal-title":"Mathematical Programming"},{"key":"4147_CR6","volume-title":"Wide Area Network Design: Concepts and Tools for Optimization","author":"R Cahn","year":"1998","unstructured":"Cahn, R. (1998). Wide Area Network Design: Concepts and Tools for Optimization. San Francisco: Morgan Kaufmann Publishers."},{"issue":"6","key":"4147_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717\u2013772.","journal-title":"Foundations of Computational Mathematics"},{"issue":"3","key":"4147_CR8","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 Eckart-Young decomposition. Psychometrika, 35(3), 283\u2013319.","journal-title":"Psychometrika"},{"key":"4147_CR9","doi-asserted-by":"publisher","first-page":"102673","DOI":"10.1016\/j.trc.2020.102673","volume":"117","author":"X Chen","year":"2020","unstructured":"Chen, X., Yang, J., & Sun, L. (2020). A nonconvex low-rank tensor completion model for spatio-temporal traffic data imputation. Transportation Research Part C Emerging Technologies, 117, 102673.","journal-title":"Transportation Research Part C Emerging Technologies"},{"key":"4147_CR10","doi-asserted-by":"crossref","unstructured":"Chen, Y. C., Qiu, L., Zhang, Y., Xue, G., & Hu, Z. (2014) Robust network compressive sensing. In: Proceedings of the 20th Annual International Conference on Mobile Computing and Networking, pp. 545\u2013556.","DOI":"10.1145\/2639108.2639129"},{"key":"4147_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.laa.2015.04.015","volume":"481","author":"C Da Silva","year":"2015","unstructured":"Da Silva, C., & Herrmann, F. (2015). Optimization on the hierarchical Tucker manifold applications to tensor completion. Linear Algebra and Its Applications, 481, 131\u2013173.","journal-title":"Linear Algebra and Its Applications"},{"issue":"4","key":"4147_CR12","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., Moor, B. D., & Vandewalle, J. (2000). A multilinear singular value decomposition. SIAM Journal on Matrix Analysis and Applications, 21(4), 1253\u20131278.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"4147_CR13","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/06066518X","volume":"30","author":"V De Silva","year":"2008","unstructured":"De Silva, V., & Lim, L. H. (2008). Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM Journal on Matrix Analysis and Applications, 30, 1084\u20131127.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"4147_CR14","unstructured":"Du, R., Chen, C., Yang, B., & Guan, X. (2013) VANET based traffic estimation: A matrix completion approach. In: Proceedings of IEEE GLOBECOM, pp. 30\u201335."},{"key":"4147_CR15","doi-asserted-by":"crossref","unstructured":"Dunlavy, D. M., Kolda, T. G., & Acar, E. (2010) Poblano v1.0: A matlab toolbox for gradient-based optimization. Sandia National Laboratories, Technical Report SAND2010-1422.","DOI":"10.2172\/989350"},{"key":"4147_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., & Young, G. (1936). The approximation of one matrix by another of lower rank. Psychometrika, 1, 211\u2013218.","journal-title":"Psychometrika"},{"key":"4147_CR17","doi-asserted-by":"crossref","unstructured":"G\u00fcrsun, G., & Crovella, M. (2012) On traffic matrix completion in the internet. In: Proceedings of the 2012 Internet Measurement Conference, pp. 399\u2013412.","DOI":"10.1145\/2398776.2398818"},{"key":"4147_CR18","unstructured":"Harshman, R. (1970). Foundations of the PARAFAC procedure: Models and methods for an \u201cexplanatory\u201d multi-mode factor analysis. UCLA Working Papers in Phonetics 16, pp. 1\u201384."},{"issue":"45","key":"4147_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2512329","volume":"60","author":"C Hillar","year":"2013","unstructured":"Hillar, C., & Lim, L. H. (2013). Most tensor problems are NP-hard. Journal of the ACM, 60(45), 1\u201339.","journal-title":"Journal of the ACM"},{"key":"4147_CR20","unstructured":"Jain, P., Meka, R., & Dhillon, I.S. (2010). Guaranteed rank minimization via singular value projection. In: Advances in Neural Information Processing Systems, pp. 937\u2013945."},{"issue":"5","key":"4147_CR21","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1109\/LSP.2017.2685518","volume":"24","author":"X Jiang","year":"2017","unstructured":"Jiang, X., Zhong, Z., Liu, X., & So, H. C. (2017). Robust matrix completion via alternating projection. IEEE Signal Processing Letters, 24(5), 579\u2013583.","journal-title":"IEEE Signal Processing Letters"},{"key":"4147_CR22","doi-asserted-by":"publisher","first-page":"6918","DOI":"10.1109\/TIP.2020.2995061","volume":"29","author":"C Ko","year":"2020","unstructured":"Ko, C., Batselier, K., Daniel, L., Yu, W., & Wong, N. (2020). Fast and accurate tensor completion with total variation regularized tensor trains. IEEE Transactions on Image Processing, 29, 6918\u20136931.","journal-title":"IEEE Transactions on Image Processing"},{"key":"4147_CR23","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, 455\u2013500.","journal-title":"SIAM Review"},{"key":"4147_CR24","doi-asserted-by":"crossref","unstructured":"Lakhina, A., Crovella, M., & Diot, C. (2004). Diagnosing network-wide traffic anomalies. In: Proceedings of ACM SIGCOMM, pp. 219\u2013230.","DOI":"10.1145\/1030194.1015492"},{"key":"4147_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/1012888.1005697","volume":"32","author":"A Lakhina","year":"2004","unstructured":"Lakhina, A., Papagiannaki, K., Crovella, M., Diot, C., Kolaczyk, E., & Taft, N. (2004). Structural analysis of network traffic flows. ACM SIGMETRICS Performance Evaluation Review, 32, 61\u201372.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"issue":"2","key":"4147_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.4208\/jcm.1809-m2018-0106","volume":"38","author":"J Li","year":"2020","unstructured":"Li, J., Cai, J. F., & Zhao, H. (2020). Robust inexact alternating optimization for matrix completion with outliers. Journal of Computational Mathematics, 38(2), 337\u2013354.","journal-title":"Journal of Computational Mathematics"},{"issue":"3","key":"4147_CR27","doi-asserted-by":"publisher","first-page":"A1641","DOI":"10.1137\/120871328","volume":"35","author":"X Liu","year":"2013","unstructured":"Liu, X., Wen, Z., & Zhang, Y. (2013). Limited memory block Krylov subspace optimization for computing dominant singular value decompositions. SIAM Journal on Scientific Computing, 35(3), A1641\u2013A1668.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"4147_CR28","unstructured":"Majumdar, A. (2020). Matrix completion via thresholding. https:\/\/ww2.mathworks.cn\/matlabcentral\/fileexchange\/26395-matrix-completion-via-thresholding"},{"key":"4147_CR29","doi-asserted-by":"crossref","unstructured":"Mardani, M., & Giannakis, G. (2013). Robust network traffic estimation via sparsity and low rank. In: Proceedings of IEEE ICASSP, pp. 4529\u20134533.","DOI":"10.1109\/ICASSP.2013.6638517"},{"issue":"5","key":"4147_CR30","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"I Oseledets","year":"2011","unstructured":"Oseledets, I. (2011). Tensor-train decomposition. SIAM Journal on Scientific Computing, 33(5), 2295\u20132317.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"4147_CR31","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.laa.2009.07.024","volume":"432","author":"I Oseledets","year":"2010","unstructured":"Oseledets, I., & Tyrtyshnikov, E. (2010). TT-cross approximation for multidimensional arrays. Linear Algebra and Its Applications, 432(1), 70\u201388.","journal-title":"Linear Algebra and Its Applications"},{"key":"4147_CR32","unstructured":"Pan, C., Ling, C., He, H., Qi, L., & Xu, Y. (2020). Low-rank and sparse enhanced Tucker decomposition for tensor completion. ArXiv:2010.00359v1"},{"key":"4147_CR33","doi-asserted-by":"crossref","unstructured":"Ringberg, H., Soule, A., Rexford, J., & Diot, C. (2007) Sensitivity of PCA for traffic anomaly detection. In: Proceedings of ACM SIGMETRICS, pp. 109\u2013120. San Diego, CA.","DOI":"10.1145\/1269899.1254895"},{"key":"4147_CR34","doi-asserted-by":"crossref","unstructured":"Roughan, M., Thorup, M., & Zhang, Y. (2003). Traffic engineering with estimated traffic matrices. In: Proceedings of ACM IMC, pp. 248\u2013258.","DOI":"10.1145\/948205.948237"},{"issue":"3","key":"4147_CR35","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TNET.2011.2169424","volume":"20","author":"M Roughan","year":"2012","unstructured":"Roughan, M., Zhang, Y., Willinger, W., & Qiu, L. (2012). Spatio-temporal compressive sensing and internet traffic matrices (extended version). IEEE\/ACM Transactions on Networking, 20(3), 662\u2013676.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"4147_CR36","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.ins.2019.01.031","volume":"482","author":"K Shang","year":"2019","unstructured":"Shang, K., Li, Y. F., & Huang, Z. H. (2019). Iterative p-shrinkage thresholding algorithm for low Tucker rank tensor recovery. Information Sciences, 482, 374\u2013391.","journal-title":"Information Sciences"},{"issue":"3","key":"4147_CR37","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L. R. (1966). Some mathematical notes on three-mode factor analysis. Psychometrika, 31(3), 279\u2013311.","journal-title":"Psychometrika"},{"key":"4147_CR38","unstructured":"Tune, P., & Roughan, M. (2015) Internet traffic matrices: A primer. In: H.\u00a0haddadi, O.\u00a0Bonaventure (eds.) Recent Advances in Networking, pp. 1\u201356."},{"issue":"4","key":"4147_CR39","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1109\/TITS.2018.2854968","volume":"20","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Zhang, Y., Piao, X., Liu, H., & Zhang, K. (2018). Traffic data reconstruction via adaptive spatial-temporal correlations. IEEE Transactions on Intelligent Transportation Systems, 20(4), 1531\u20131543.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"3","key":"4147_CR40","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1137\/15M1050525","volume":"37","author":"K Wei","year":"2016","unstructured":"Wei, K., Cai, J. F., Chan, T. F., & Leung, S. (2016). Guarantees of riemannian optimization for low rank matrix recovery. SIAM Journal of Matrix Analysis and Application, 37(3), 1198\u20131222.","journal-title":"SIAM Journal of Matrix Analysis and Application"},{"issue":"3","key":"4147_CR41","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1109\/TNET.2018.2819504","volume":"26","author":"K Xie","year":"2018","unstructured":"Xie, K., Peng, C., Wang, X., Xie, G., Wen, J., Cao, J., et al. (2018). Accurate recovery of internet traffic data under variable rate measurements. IEEE\/ACM Transactions on Networking, 26(3), 1137\u20131150.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"4147_CR42","doi-asserted-by":"crossref","unstructured":"Xie, K., Wang, L., Wang, X., Xie, G., Wen, J., & Zhang, G. (2016). Accurate recovery of internet traffic data: A tensor completion approach. In: IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, pp. 1\u20139.","DOI":"10.1109\/INFOCOM.2016.7524463"},{"issue":"6","key":"4147_CR43","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1109\/TNET.2019.2940147","volume":"27","author":"K Xie","year":"2019","unstructured":"Xie, K., Wang, X., Wang, X., Chen, Y., Xie, G., Ouyang, Y., et al. (2019). Accurate recovery of missing network measurement data with localized tensor completion. IEEE\/ACM Transactions on Networking, 27(6), 2222\u20132235.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"4147_CR44","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.neucom.2020.12.123","volume":"434","author":"X Yu","year":"2021","unstructured":"Yu, X., Luo, Z., Qi, L., & Xu, Y. (2021). Slrta: A sparse and low-rank tensor-based approach to internet traffic anomaly detection. Neurocomputing, 434, 295\u2013314.","journal-title":"Neurocomputing"},{"key":"4147_CR45","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, 1031\u20131068.","journal-title":"Foundations of Computational Mathematics"},{"key":"4147_CR46","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/1140103.1140294","volume":"34","author":"Q Zhao","year":"2006","unstructured":"Zhao, Q., Ge, Z., Wang, J., & Xu, J. (2006). Robust taffic matrix estimation with imperfect information: making use of multiple data sources. ACM SIGMETRICS Performance Evaluation Review, 34, 133\u2013144.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"4147_CR47","unstructured":"Zhou, H., Zhang, D., Xie, K., & Chen, Y.: Spatio-temporal tensor completion for imputing missing internet traffic data. In: 2015 IEEE 34th International Performance Computing and Communications Conference (IPCCC), pp. 1\u20137."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04147-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04147-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04147-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T12:11:53Z","timestamp":1723551113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04147-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,14]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["4147"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04147-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,14]]},"assertion":[{"value":"1 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}