{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:08:38Z","timestamp":1760710118183,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T00:00:00Z","timestamp":1580083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T00:00:00Z","timestamp":1580083200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2016R1E1A1A01942642"],"award-info":[{"award-number":["2016R1E1A1A01942642"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2019M3D7A1094364"],"award-info":[{"award-number":["2019M3D7A1094364"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10115-019-01435-1","type":"journal-article","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T13:02:23Z","timestamp":1580130143000},"page":"2765-2794","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast and memory-efficient algorithms for high-order Tucker decomposition"],"prefix":"10.1007","volume":"62","author":[{"given":"Jiyuan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jinoh","family":"Oh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Evangelos E.","family":"Papalexakis","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7510-0255","authenticated-orcid":false,"given":"Hwanjo","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,27]]},"reference":[{"key":"1435_CR1","doi-asserted-by":"crossref","unstructured":"Acar E, \u00c7amtepe SA, Krishnamoorthy MS, Yener B (2005) Modeling and multiway analysis of chatroom tensors. In: ISI","DOI":"10.1007\/11427995_21"},{"issue":"1","key":"1435_CR2","first-page":"143","volume":"3","author":"LA Adamic","year":"2002","unstructured":"Adamic LA, Huberman BA (2002) Zipf\u2019s law and the Internet. Glottometrics 3(1):143\u2013150","journal-title":"Glottometrics"},{"key":"1435_CR3","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: SODA"},{"key":"1435_CR4","doi-asserted-by":"crossref","unstructured":"Austin W, Ballard G, Kolda TG (2016) Parallel tensor compression for large-scale scientific data. In: IPDPS","DOI":"10.1109\/IPDPS.2016.67"},{"key":"1435_CR5","unstructured":"Bader BW, Kolda TG. Matlab tensor toolbox version 2.6. http:\/\/www.sandia.gov\/~tgkolda\/TensorToolbox\/"},{"key":"1435_CR6","doi-asserted-by":"crossref","unstructured":"Baskaran M, Meister B, Vasilache N, Lethin R (2012) Efficient and scalable computations with sparse tensors. In: HPEC","DOI":"10.1109\/HPEC.2012.6408676"},{"issue":"1","key":"1435_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1177\/109434209200600103","volume":"6","author":"MW Berry","year":"1992","unstructured":"Berry MW (1992) Large-scale sparse singular value computations. Int J Supercomput Appl 6(1):13\u201349","journal-title":"Int J Supercomput Appl"},{"key":"1435_CR8","doi-asserted-by":"crossref","unstructured":"Beutel A, Kumar A, Papalexakis EE, Talukdar PP, Faloutsos C, Xing EP (2014) Flexifact: scalable flexible factorization of coupled tensors on hadoop. In: SDM","DOI":"10.1137\/1.9781611973440.13"},{"key":"1435_CR9","doi-asserted-by":"crossref","unstructured":"Cai Y, Zhang M, Luo D, Ding C, Chakravarthy S (2011) Low-order tensor decompositions for social tagging recommendation. In: WSDM","DOI":"10.1145\/1935826.1935920"},{"key":"1435_CR10","doi-asserted-by":"crossref","unstructured":"Chi Y, Tseng BL, Tatemura J (2006) Eigen-trend: trend analysis in the blogosphere based on singular value decompositions. In: CIKM","DOI":"10.1145\/1183614.1183628"},{"key":"1435_CR11","unstructured":"Choi D, Jang JG, Kang U (2017) Fast, accurate, and scalable method for sparse coupled matrix-tensor factorization. arXiv preprint arXiv:1708.08640"},{"key":"1435_CR12","unstructured":"Choi JH, Vishwanathan S (2014) Dfacto: distributed factorization of tensors. In: NIPS"},{"issue":"4","key":"1435_CR13","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset A, Shalizi CR, Newman ME (2009) Power-law distributions in empirical data. SIAM Rev 51(4):661\u2013703","journal-title":"SIAM Rev"},{"issue":"7","key":"1435_CR14","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1109\/LSP.2014.2374838","volume":"22","author":"JE Cohen","year":"2015","unstructured":"Cohen JE, Farias RC, Comon P (2015) Fast decomposition of large nonnegative tensors. IEEE Signal Process Lett 22(7):862\u2013866","journal-title":"IEEE Signal Process Lett"},{"key":"1435_CR15","doi-asserted-by":"crossref","unstructured":"Chakaravarthy V-T, Choi J-W, Joseph D-J, Murali P, Pandian S-S, Sabharwal Y, Sreedhar D (2018) On optimizing distributed tucker decomposition for sparse tensors. IEEE Signal Process Mag","DOI":"10.1145\/3205289.3205315"},{"key":"1435_CR16","doi-asserted-by":"crossref","unstructured":"de Almeida AL, Kibangou AY (2013) Distributed computation of tensor decompositions in collaborative networks. In: CAMSAP, pp 232\u2013235","DOI":"10.1109\/CAMSAP.2013.6714050"},{"key":"1435_CR17","doi-asserted-by":"crossref","unstructured":"de\u00a0Almeida AL, Kibangou AY (2014) Distributed large-scale tensor decomposition. In: ICASSP","DOI":"10.1109\/ICASSP.2014.6853551"},{"issue":"4","key":"1435_CR18","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 (2000) On the best rank-1 and rank-(R1, R2,., Rn) approximation of higher-order tensors. SIAM J Matrix Anal Appl 21(4):1324\u20131342","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"4","key":"1435_CR19","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 J Matrix Anal Appl 21(4):1253\u20131278","journal-title":"SIAM J Matrix Anal Appl"},{"key":"1435_CR20","doi-asserted-by":"crossref","unstructured":"Franz T, Schultz A, Sizov S, Staab S (2009) Triplerank: ranking semantic web data by tensor decomposition. In: ISWC","DOI":"10.1007\/978-3-642-04930-9_14"},{"key":"1435_CR21","doi-asserted-by":"crossref","unstructured":"Jeon B, Jeon I, Sael L, Kang U (2016) Scout: Scalable coupled matrix-tensor factorization\u2014algorithm and discoveries. In: ICDE","DOI":"10.1109\/ICDE.2016.7498292"},{"key":"1435_CR22","doi-asserted-by":"crossref","unstructured":"Jeon I, Papalexakis EE, Kang U, Faloutsos C (2015) Haten2: billion-scale tensor decompositions. In: ICDE","DOI":"10.1109\/ICDE.2015.7113355"},{"key":"1435_CR23","doi-asserted-by":"crossref","unstructured":"Kang U, Papalexakis E, Harpale A, Faloutsos C (2012) Gigatensor: scaling tensor analysis up by 100 times-algorithms and discoveries.e In: KDD","DOI":"10.1145\/2339530.2339583"},{"key":"1435_CR24","doi-asserted-by":"crossref","unstructured":"Kaya O, U\u00e7ar B (2015) Scalable sparse tensor decompositions in distributed memory systems. In: SC","DOI":"10.1145\/2807591.2807624"},{"key":"1435_CR25","doi-asserted-by":"crossref","unstructured":"Kaya O, U\u00e7ar B (2016) High performance parallel algorithms for the tucker decomposition of sparse tensors. In: ICCP","DOI":"10.1109\/ICPP.2016.19"},{"issue":"3","key":"1435_CR26","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500","journal-title":"SIAM Rev"},{"key":"1435_CR27","doi-asserted-by":"crossref","unstructured":"Kolda TG, Sun J (2008) Scalable tensor decompositions for multi-aspect data mining. In: ICDM","DOI":"10.1109\/ICDM.2008.89"},{"key":"1435_CR28","unstructured":"Kolda TG, Bader BW, Kenny JP (2005) Higher-order web link analysis using multilinear algebra. In: ICDM"},{"key":"1435_CR29","doi-asserted-by":"crossref","unstructured":"Lamba H, Nagarajan V, Shin K, Shajarisales N (2016) Incorporating side information in tensor completion. In: WWW companion","DOI":"10.1145\/2872518.2889371"},{"key":"1435_CR30","doi-asserted-by":"crossref","unstructured":"Lehoucq RB, Sorensen DC, Yang C (1998) ARPACK users\u2019 guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods, vol 6. Siam","DOI":"10.1137\/1.9780898719628"},{"key":"1435_CR31","doi-asserted-by":"crossref","unstructured":"Li J, Choi J, Perros I, Sun J, Vuduc R (2017) Model-driven sparse CP decomposition for higher-order tensors. In: IPDPS","DOI":"10.1109\/IPDPS.2017.80"},{"key":"1435_CR32","doi-asserted-by":"crossref","unstructured":"Li J, Sun J, Vuduc R (2018) HiCOO: hierarchical storage of sparse tensors. In: SC","DOI":"10.1109\/SC.2018.00022"},{"key":"1435_CR33","doi-asserted-by":"crossref","unstructured":"Maruhashi K, Guo F, Faloutsos C (2011) Multiaspectforensics: pattern mining on large-scale heterogeneous networks with tensor analysis. In: ASONAM","DOI":"10.1109\/ASONAM.2011.80"},{"key":"1435_CR34","doi-asserted-by":"crossref","unstructured":"Moghaddam S, Jamali M, Ester M (2012) ETF: extended tensor factorization model for personalizing prediction of review helpfulness. In: WSDM","DOI":"10.1145\/2124295.2124316"},{"key":"1435_CR35","doi-asserted-by":"crossref","unstructured":"Oh J, Shin K, Papalexakis EE, Faloutsos C, Yu H (2017) S-hot: scalable high-order tucker decomposition In: WSDM","DOI":"10.1145\/3018661.3018721"},{"key":"1435_CR36","doi-asserted-by":"crossref","unstructured":"Oh S, Park N, Sael L, Kang U (2018) Scalable tucker factorization for sparse tensors\u2014algorithms and discoveries. In: ICDE, pp 1120\u20131131","DOI":"10.1109\/ICDE.2018.00104"},{"key":"1435_CR37","doi-asserted-by":"crossref","unstructured":"Oh S, Park N, Sael L, Kang U (2019) High-performance tucker factorization on heterogeneous platforms. IEEE Trans Parallel Distrib Syst","DOI":"10.1109\/TPDS.2019.2908639"},{"issue":"1","key":"1435_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2729980","volume":"10","author":"EE Papalexakis","year":"2015","unstructured":"Papalexakis EE, Faloutsos C, Sidiropoulos ND (2015) Parcube: sparse parallelizable candecomp-parafac tensor decomposition. TKDD 10(1):3","journal-title":"TKDD"},{"issue":"2","key":"1435_CR39","first-page":"16","volume":"8","author":"EE Papalexakis","year":"2016","unstructured":"Papalexakis EE, Faloutsos C, Sidiropoulos ND (2016) Tensors for data mining and data fusion: models, applications, and scalable algorithms. TIST 8(2):16","journal-title":"TIST"},{"key":"1435_CR40","doi-asserted-by":"crossref","unstructured":"Perros I, Chen R, Vuduc R, Sun J (2015) Sparse hierarchical tucker factorization and its application to healthcare. In: ICDM","DOI":"10.1109\/ICDM.2015.29"},{"issue":"1","key":"1435_CR41","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1111322.1111330","volume":"36","author":"R Pang","year":"2014","unstructured":"Pang R, Allman M, Paxson V, Lee J (2014) The devil and packet trace anonymization. ACM SIGCOMM Comput Commun Rev 36(1):29\u201338","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"1435_CR42","doi-asserted-by":"crossref","unstructured":"Powers DM (1998) Applications and explanations of Zipf\u2019s law. In: NeMLaP\/CoNLL","DOI":"10.3115\/1603899.1603924"},{"key":"1435_CR43","unstructured":"Rendle S, Schmidt-Thieme L (210) Pairwise interaction tensor factorization for personalized tag recommendation. In: WSDM"},{"key":"1435_CR44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical methods for large eigenvalue problems","author":"Y Saad","year":"2011","unstructured":"Saad Y (2011) Numerical methods for large eigenvalue problems. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"2","key":"1435_CR45","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.bdr.2015.01.004","volume":"2","author":"L Sael","year":"2015","unstructured":"Sael L, Jeon I, Kang U (2015) Scalable tensor mining. Big Data Res 2(2):82\u201386","journal-title":"Big Data Res"},{"key":"1435_CR46","doi-asserted-by":"crossref","unstructured":"Smith S, Karypis G (2015) Tensor-matrix products with a compressed sparse tensor. In: IA3","DOI":"10.1145\/2833179.2833183"},{"key":"1435_CR47","doi-asserted-by":"crossref","unstructured":"Smith S, Karypis G (2017) Accelerating the tucker decomposition with compressed sparse tensors. In: Euro-Par","DOI":"10.1007\/978-3-319-64203-1_47"},{"key":"1435_CR48","unstructured":"Smith S, Choi JW, Li J, Vuduc R, Park J, Liu X, Karypis G. FROSTT: the formidable repository of open sparse tensors and tools. http:\/\/frostt.io\/"},{"issue":"3","key":"1435_CR49","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/3154414","volume":"12","author":"K Shin","year":"2018","unstructured":"Shin K, Hooi B, Faloutsos C (2018) Fast, accurate, and flexible algorithms for dense subtensor mining. TKDD 12(3):28:1\u201328:30","journal-title":"TKDD"},{"key":"1435_CR50","doi-asserted-by":"crossref","unstructured":"Shin K, Hooi B, Kim J, Faloutsos C (2017) DenseAlert: incremental dense-subtensor detection in tensor streams. In: KDD","DOI":"10.1145\/3097983.3098087"},{"issue":"1","key":"1435_CR51","first-page":"100","volume":"29","author":"K Shin","year":"2017","unstructured":"Shin K, Lee S, Kang U (2017) Fully scalable methods for distributed tensor factorization. TKDE 29(1):100\u2013113","journal-title":"TKDE"},{"issue":"11","key":"1435_CR52","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/LSP.2012.2210872","volume":"19","author":"ND Sidiropoulos","year":"2012","unstructured":"Sidiropoulos ND, Kyrillidis A (2012) Multi-way compressed sensing for sparse low-rank tensors. IEEE Signal Process Lett 19(11):757\u2013760","journal-title":"IEEE Signal Process Lett"},{"key":"1435_CR53","doi-asserted-by":"crossref","unstructured":"Sinha A, Shen Z, Song Y, Ma H, Eide D, Hsu B-JP, Wang K (2015) An overview of microsoft academic service (MAS) and applications. In: WWW companion","DOI":"10.1145\/2740908.2742839"},{"key":"1435_CR54","doi-asserted-by":"crossref","unstructured":"Sun J, Tao D, Faloutsos C (2006) Beyond streams and graphs: dynamic tensor analysis. In: KDD","DOI":"10.1145\/1150402.1150445"},{"key":"1435_CR55","doi-asserted-by":"crossref","unstructured":"Sun J-T, Zeng H-J, Liu H, Lu Y, Chen Z (2005) Cubesvd: a novel approach to personalized web search. In: WWW","DOI":"10.1145\/1060745.1060803"},{"key":"1435_CR56","unstructured":"Shetty J, Adibi J. The Enron email dataset database schema and brief statistical report. Information sciences institute technical report. University of Southern California"},{"key":"1435_CR57","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE (2010) Mach: fast randomized tensor decompositions. In: SDM, SIAM","DOI":"10.1137\/1.9781611972801.60"},{"issue":"3","key":"1435_CR58","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker LR (1966) Some mathematical notes on three-mode factor analysis. Psychometrika 31(3):279\u2013311","journal-title":"Psychometrika"},{"issue":"2","key":"1435_CR59","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 (2012) A new truncation strategy for the higher-order singular value decomposition. SIAM J Sci Comput 34(2):A1027\u2013A1052","journal-title":"SIAM J Sci Comput"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01435-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-019-01435-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01435-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,26]],"date-time":"2021-01-26T00:25:11Z","timestamp":1611620711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-019-01435-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,27]]},"references-count":59,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["1435"],"URL":"https:\/\/doi.org\/10.1007\/s10115-019-01435-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2020,1,27]]},"assertion":[{"value":"2 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}