{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T03:00:41Z","timestamp":1773111641859,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T00:00:00Z","timestamp":1530748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771099"],"award-info":[{"award-number":["11771099"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10444-018-9622-8","type":"journal-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T12:00:11Z","timestamp":1530792011000},"page":"395-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":97,"title":["Randomized algorithms for the approximations of Tucker and the tensor train decompositions"],"prefix":"10.1007","volume":"45","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":[]}],"member":"297","published-online":{"date-parts":[[2018,7,5]]},"reference":[{"key":"9622_CR1","unstructured":"Bader, B.W., Kolda, T.G., et al.: Matlab tensor toolbox version 3.0-dev. Available online. \n                    https:\/\/www.tensortoolbox.org\n                    \n                   (2017)"},{"key":"9622_CR2","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.laa.2011.08.010","volume":"438","author":"J Ballani","year":"2013","unstructured":"Ballani, J., Grasedyck, L., Kluge, M.: Black box approximation of tensors in Hierarchical Tucker format. Linear Algebra Appl. 438, 639\u2013657 (2013)","journal-title":"Linear Algebra Appl."},{"key":"9622_CR3","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1137\/040604959","volume":"26","author":"G Beylkin","year":"2005","unstructured":"Beylkin, G., Mohlenkamp, M.J.: Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26, 2133\u20132159 (2005)","journal-title":"SIAM J. Sci. Comput."},{"key":"9622_CR4","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.laa.2010.03.020","volume":"433","author":"CF Caiafa","year":"2010","unstructured":"Caiafa, C.F., Cichocki, A.: Generalizing the column-row matrix decomposition to multi-way arrays. Linear Algebra Appl. 433, 557\u2013573 (2010)","journal-title":"Linear Algebra Appl."},{"key":"9622_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0024-3795(87)90103-0","volume":"88\/89","author":"TF Chan","year":"1987","unstructured":"Chan, T.F.: Rank revealing Q\n                           R factorizations. Linear Algebra Appl. 88\/89, 67\u201382 (1987)","journal-title":"Linear Algebra Appl."},{"key":"9622_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.neucom.2017.04.058","volume":"267","author":"M Che","year":"2017","unstructured":"Che, M., Cichocki, A., Wei, Y.: Neural networks for computing best rank-one approximations of tensors and its applications. Neurocomputing 267, 124\u2013133 (2017)","journal-title":"Neurocomputing"},{"key":"9622_CR7","unstructured":"Cichocki, A.: Tensor networks for big data analytics and large-scale optimization problems, arXiv:\n                    1407.3124\n                    \n                   (2014)"},{"key":"9622_CR8","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":"9622_CR9","first-page":"1","volume-title":"Tensor decompositions: state of the art and applications, in Mathematics in signal processing, V (Coventry, 2000), vol. 71 of Inst. Math. Appl. Conf. Ser. New Ser.","author":"P Comon","year":"2002","unstructured":"Comon, P.: Tensor decompositions: state of the art and applications, in Mathematics in signal processing, V (Coventry, 2000), vol. 71 of Inst. Math. Appl. Conf. Ser. New Ser., pp. 1\u201324. Oxford University Press, Oxford (2002)"},{"key":"9622_CR10","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":"9622_CR11","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L.: On the best rank-1 and rank-(r\n                           1,r\n                           2,? ,r\n                           n) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl. 21, 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9622_CR12","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1016\/j.cpc.2013.12.017","volume":"185","author":"S Dolgov","year":"2014","unstructured":"Dolgov, S., Khoromskij, B.N., Oseledets, I.V., Savostyanov, D.V.: Computation of extreme eigenvalues in higher dimensions using block tensor train format. Comput. Phys. Commun. 185, 1207\u20131216 (2014)","journal-title":"Comput. Phys. Commun."},{"key":"9622_CR13","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":"9622_CR14","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-Grassmann method for computing the best multilinear rank-(r\n                           1,r\n                           2,r\n                           3) approximation of a tensor. SIAM J. Matrix Anal. Appl. 31, 248\u2013271 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9622_CR15","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1080\/10556780801996244","volume":"23","author":"MP Friedlander","year":"2008","unstructured":"Friedlander, M.P., Hatz, K.: Computing non-negative tensor factorizations. Optim. Methods Softw. 23, 631\u2013647 (2008)","journal-title":"Optim. Methods Softw."},{"key":"9622_CR16","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th adn. Johns Hopkins University Press, Baltimore (2013)"},{"key":"9622_CR17","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":"9622_CR18","doi-asserted-by":"crossref","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E.: The maximal-volume concept in approximation by low-rank matrices, Structured Matrices in Mathematics Computer Science and Engineering I, pp. 47\u201351 (2001)","DOI":"10.1090\/conm\/280\/4620"},{"key":"9622_CR19","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, 2029\u20132054 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9622_CR20","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":"9622_CR21","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, 706\u2013722 (2009)","journal-title":"J. Fourier Anal. Appl."},{"key":"9622_CR22","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":"9622_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s11075-007-9136-9","volume":"46","author":"PC Hansen","year":"2007","unstructured":"Hansen, P.C.: Regularization Tools version 4.0 for Matlab 7.3. Numer. Algorithms 46, 189\u2013194 (2007)","journal-title":"Numer. Algorithms"},{"key":"9622_CR24","doi-asserted-by":"publisher","first-page":"A683","DOI":"10.1137\/100818893","volume":"34","author":"S Holtz","year":"2012","unstructured":"Holtz, S., Rohwedder, T., Schneider, R.: The alternating linear scheme for tensor optimization in the tensor train format. SIAM J. Sci. Comput. 34, A683\u2013A713 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"9622_CR25","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s00211-011-0419-7","volume":"120","author":"S Holtz","year":"2012","unstructured":"Holtz, S.: On manifolds of tensors of fixed TT-rank. Numer. Math. 120, 701\u2013731 (2012)","journal-title":"Numer. Math."},{"key":"9622_CR26","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":"9622_CR27","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":"9622_CR28","doi-asserted-by":"publisher","first-page":"A2346","DOI":"10.1137\/130949919","volume":"36","author":"D Kressner","year":"2014","unstructured":"Kressner, D., Steinlechner, M., Uschmajew, A.: Low-rank tensor methods with subspace correction for symmetric eigenvalue problems. SIAM J. Sci. Comput. 36, A2346\u2013A2368 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"9622_CR29","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/140983410","volume":"36","author":"N Lee","year":"2015","unstructured":"Lee, N., Cichocki, A.: Estimating a few extreme singular values and vectors for large-scale matrices in tensor train format. SIAM J. Matrix Anal. Appl. 36, 994\u20131014 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9622_CR30","unstructured":"Lim, L.: Singular values and eigenvalues of tensors: a variational approach. In: IEEE CAMSAP 2005: First International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, pp. 129\u2013132 (2005)"},{"key":"9622_CR31","unstructured":"Liu, S., Trenkler, O.: Hadamard, Khatri-rao, Kronecker and other matrix products, 4 pp. 160\u2013177 (2008)"},{"key":"9622_CR32","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1137\/060665336","volume":"30","author":"MW Mahoney","year":"2008","unstructured":"Mahoney, M.W., Maggioni, M., Drineas, P.: Tensor-CUR decompositions for tensor-based data. SIAM J. Matrix Anal. Appl. 30, 957\u2013987 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9622_CR33","unstructured":"Navasca, C., De Lathauwer, L.: Low multilinear rank tensor approximation via semidefinite programming. In: IEEE 17th European Signal Processing Conference, pp. 520\u2013524 (2009)"},{"key":"9622_CR34","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1093\/imaiai\/iav004","volume":"4","author":"NH Nguyen","year":"2015","unstructured":"Nguyen, N.H., Drineas, P., Tran, T.D.: Tensor sparsification via a bound on the spectral norm of random tensors. Inf. Inference 4, 195\u2013229 (2015)","journal-title":"Inf. Inference"},{"key":"9622_CR35","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/130935112","volume":"35","author":"J Nie","year":"2014","unstructured":"Nie, J., Wang, L.: Semidefinite relaxations for best rank-1 tensor approximations. SIAM J. Matrix Anal. Appl. 35, 1155\u20131179 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9622_CR36","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.: TT-cross approximation for multidimensional arrays. Linear Algebra Appl. 432, 70\u201388 (2010)","journal-title":"Linear Algebra Appl."},{"key":"9622_CR37","unstructured":"Oseledets, I.V.: TT-toolbox version 2.2: Fast multidimensional array operations in MATLAB. Available online. \n                    http:\/\/github.com\/oseledets\/TT-Toolbox\n                    \n                   (2009\u20132013)"},{"key":"9622_CR38","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, 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"9622_CR39","doi-asserted-by":"publisher","first-page":"A2718","DOI":"10.1137\/110833142","volume":"34","author":"IV Oseledets","year":"2012","unstructured":"Oseledets, I.V., Dolgov, S.V.: Solution of linear systems and matrix inversion in the TT-format. SIAM J. Sci. Comput. 34, A2718\u2013A2739 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"9622_CR40","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":"9622_CR41","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1002\/nla.682","volume":"17","author":"IV Oseledets","year":"2010","unstructured":"Oseledets, I.V.: Cross approximation in tensor electron density computations. Numer. Linear Algebra Appl. 17, 935\u2013952 (2010)","journal-title":"Numer. Linear Algebra Appl."},{"key":"9622_CR42","doi-asserted-by":"publisher","first-page":"3744","DOI":"10.1137\/090748330","volume":"31","author":"IV Oseledets","year":"2009","unstructured":"Oseledets, I.V., Tyrtyshnikov, E.E.: Breaking the curse of dimensionality, or how to use SVD in many dimensions. SIAM J. Sci. Comput. 31, 3744\u20133759 (2009)","journal-title":"SIAM J. Sci. Comput."},{"key":"9622_CR43","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":"9622_CR44","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1137\/15M1048628","volume":"37","author":"AK Saibaba","year":"2016","unstructured":"Saibaba, A.K.: HOID: higher order interpolatory decomposition for tensors based on Tucker representation. SIAM J. Matrix Anal. Appl. 37, 1223\u20131249 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9622_CR45","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1016\/j.laa.2011.12.007","volume":"438","author":"B Savas","year":"2013","unstructured":"Savas, B., Eld\u00e9n, L.: Krylov-type methods for tensor computations I. Linear Algebra Appl. 438, 891\u2013918 (2013)","journal-title":"Linear Algebra Appl."},{"key":"9622_CR46","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":"9622_CR47","doi-asserted-by":"publisher","unstructured":"Savostyanov, D., Oseledets, I.: Fast adaptive interpolation of multi-dimensional arrays in tensor train format, in the 2011 International Workshop on Multidimensional (nD) Systems, 2011, pp. 1\u20138. \n                    https:\/\/doi.org\/10.1109\/nDS.2011.6076873","DOI":"10.1109\/nDS.2011.6076873"},{"key":"9622_CR48","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.laa.2014.06.006","volume":"458","author":"DV Savostyanov","year":"2014","unstructured":"Savostyanov, D.V.: Quasioptimality of maximum-volume cross interpolation of tensors. Linear Algebra Appl. 458, 217\u2013244 (2014)","journal-title":"Linear Algebra Appl."},{"key":"9622_CR49","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":"9622_CR50","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":"9622_CR51","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices, in Compressed Sensing: Theory and Practice. In: Eldar, Y. C., Kutyniok, G. (eds.) , pp. 210\u2013268. Cambridge University Press, Cambridge (2012)","DOI":"10.1017\/CBO9780511794308.006"},{"key":"9622_CR52","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/MSP.2014.2329429","volume":"31","author":"N Vervliet","year":"2014","unstructured":"Vervliet, N., Debals, O., Sorber, L., De Lathauwer, L.: Breaking the curse of dimensionality using decompositions of incomplete tensors: tensor-based scientific computing in big data analysis. IEEE Signal Process. Mag. 31, 71\u201379 (2014)","journal-title":"IEEE Signal Process. Mag."},{"key":"9622_CR53","unstructured":"Vervliet, N., Debals, O., Sorber, L., Van Barel, M., De Lathauwer, L.: Tensorlab 3.0. Available online. \n                    http:\/\/tensorlab.net\n                    \n                   (2016)"},{"key":"9622_CR54","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.neucom.2015.08.122","volume":"198","author":"Y Zhang","year":"2016","unstructured":"Zhang, Y., Zhou, G., Zhao, Q., Cichocki, A., Wang, X.: Fast nonnegative tensor factorization based on accelerated proximal gradient and low-rank approximation. Neurocomputing 198, 148\u2013154 (2016)","journal-title":"Neurocomputing"},{"key":"9622_CR55","doi-asserted-by":"publisher","first-page":"2928","DOI":"10.1109\/TSP.2012.2190410","volume":"60","author":"G Zhou","year":"2012","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Fast nonnegative matrix\/tensor factorization based on low-rank approximation. IEEE Trans. Signal Process. 60, 2928\u20132940 (2012)","journal-title":"IEEE Trans. Signal Process."},{"key":"9622_CR56","unstructured":"Zhou, G.: Decomposition of big tensors with low multilinear rank, arXiv:\n                    1412.1885v1\n                    \n                   (2014)"},{"key":"9622_CR57","doi-asserted-by":"publisher","first-page":"4990","DOI":"10.1109\/TIP.2015.2478396","volume":"24","author":"G Zhou","year":"2015","unstructured":"Zhou, G., Cichocki, A., Zhao, Q., Xie, S.: Efficient nonnegative tucker decompositions: algorithms and uniqueness. IEEE Trans. Image Process. 24, 4990\u20135003 (2015)","journal-title":"IEEE Trans. Image Process."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-018-9622-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-018-9622-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-018-9622-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T08:46:29Z","timestamp":1568969189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-018-9622-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,5]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["9622"],"URL":"https:\/\/doi.org\/10.1007\/s10444-018-9622-8","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,5]]},"assertion":[{"value":"8 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}