{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T20:51:58Z","timestamp":1769633518361,"version":"3.49.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,7,22]],"date-time":"2015-07-22T00:00:00Z","timestamp":1437523200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2015,7,27]]},"abstract":"<jats:p>\n            How can we efficiently decompose a tensor into sparse factors, when the data do not fit in memory? Tensor decompositions have gained a steadily increasing popularity in data-mining applications; however, the current state-of-art decomposition algorithms operate on main memory and do not scale to truly large datasets. In this work, we propose P\n            <jats:sc>ar<\/jats:sc>\n            C\n            <jats:sc>ube<\/jats:sc>\n            , a new and highly parallelizable method for speeding up tensor decompositions that is well suited to produce sparse approximations. Experiments with even moderately large data indicate over 90% sparser outputs and 14 times faster execution, with approximation error close to the current state of the art irrespective of computation and memory requirements. We provide theoretical guarantees for the algorithm\u2019s correctness and we experimentally validate our claims through extensive experiments, including four different real world datasets (E\n            <jats:sc>nron<\/jats:sc>\n            , L\n            <jats:sc>bnl<\/jats:sc>\n            , F\n            <jats:sc>acebook<\/jats:sc>\n            and N\n            <jats:sc>ell<\/jats:sc>\n            ), demonstrating its effectiveness for data-mining practitioners. In particular, we are the first to analyze the very large N\n            <jats:sc>ell<\/jats:sc>\n            dataset using a sparse tensor decomposition, demonstrating that P\n            <jats:sc>ar<\/jats:sc>\n            C\n            <jats:sc>ube<\/jats:sc>\n            enables us to handle effectively and efficiently very large datasets. Finally, we make our highly scalable parallel implementation publicly available, enabling reproducibility of our work.\n          <\/jats:p>","DOI":"10.1145\/2729980","type":"journal-article","created":{"date-parts":[[2015,7,22]],"date-time":"2015-07-22T18:49:50Z","timestamp":1437590990000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["P\n            <scp>ar<\/scp>\n            C\n            <scp>ube<\/scp>"],"prefix":"10.1145","volume":"10","author":[{"given":"Evangelos E.","family":"Papalexakis","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas D.","family":"Sidiropoulos","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,7,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm210"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(00)00071-X"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"B. W. Bader M. W. Berry and M. Browne. 2008. Discussion tracking in enron email using PARAFAC. Survey of Text Mining II 147--163.  B. W. Bader M. W. Berry and M. Browne. 2008. Discussion tracking in enron email using PARAFAC. Survey of Text Mining II 147--163.","DOI":"10.1007\/978-1-84800-046-9_8"},{"key":"e_1_2_1_4_1","volume-title":"Sandia National Laboratories TR SAND2006-2161","author":"Bader B. W.","unstructured":"B. W. Bader , R. A. Harshman , and T. G. Kolda . 2006. Temporal analysis of social networks using three-way DEDICOM . Sandia National Laboratories TR SAND2006-2161 . B. W. Bader, R. A. Harshman, and T. G. Kolda. 2006. Temporal analysis of social networks using three-way DEDICOM. Sandia National Laboratories TR SAND2006-2161."},{"key":"e_1_2_1_5_1","volume-title":"Albuquerque, NM, USA: Sandia National Laboratories.","author":"Bader B. W.","year":"2007","unstructured":"B. W. Bader and T. G. Kolda . 2007 a. Matlab tensor toolbox version 2.2. Albuquerque, NM, USA: Sandia National Laboratories. B. W. Bader and T. G. Kolda. 2007a. Matlab tensor toolbox version 2.2. Albuquerque, NM, USA: Sandia National Laboratories."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/060676489"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.13"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(97)00032-4"},{"key":"e_1_2_1_9_1","volume-title":"Int. Workshop Independent Component and Blind Signal Separation Anal","author":"Bro R.","unstructured":"R. Bro , N. D. Sidiropoulos , and G. B. Giannakis . 1999. A fast least squares algorithm for separating trilinear mixtures . In Int. Workshop Independent Component and Blind Signal Separation Anal . Aussois, France, 11--15. R. Bro, N. D. Sidiropoulos, and G. B. Giannakis. 1999. A fast least squares algorithm for separating trilinear mixtures. In Int. Workshop Independent Component and Blind Signal Separation Anal. Aussois, France, 11--15."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281211"},{"key":"e_1_2_1_11_1","unstructured":"William W. Cohen. ENRON E-mail dataset. http:\/\/www.cs.cmu.edu\/&sim;enron\/. Last accessed: 27\/6\/2015.  William W. Cohen. ENRON E-mail dataset. http:\/\/www.cs.cmu.edu\/&sim;enron\/. Last accessed: 27\/6\/2015."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6853551"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442702"},{"key":"e_1_2_1_14_1","first-page":"84","article-title":"Foundations of the PARAFAC procedure: Models and conditions for an \u201cexplanatory\u201d multimodal factor analysis","volume":"16","author":"Harshman R. A.","year":"1970","unstructured":"R. A. Harshman . 1970 . Foundations of the PARAFAC procedure: Models and conditions for an \u201cexplanatory\u201d multimodal factor analysis . UCLA Working Papers in Phonetics 16 , 84 . R. A. Harshman. 1970. Foundations of the PARAFAC procedure: Models and conditions for an \u201cexplanatory\u201d multimodal factor analysis. UCLA Working Papers in Phonetics 16, 84.","journal-title":"UCLA Working Papers in Phonetics"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.06.030"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339583"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063827"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396809"},{"key":"e_1_2_1_19_1","volume-title":"Workshop on Link Analysis, Counterterrorism and Security","volume":"7","author":"Kolda T. G.","unstructured":"T. G. Kolda and B. W. Bader . 2006. The TOPHITS model for higher-order web link analysis . In Workshop on Link Analysis, Counterterrorism and Security , Vol. 7 . Minneapolis, MN, USA, 26--29. T. G. Kolda and B. W. Bader. 2006. The TOPHITS model for higher-order web link analysis. In Workshop on Link Analysis, Counterterrorism and Security, Vol. 7. Minneapolis, MN, USA, 26--29."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.89"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Y. Li and A. Ngom. 2011. Classification of clinical gene-sample-time microarray expression data via tensor decomposition methods. In Computational Intelligence Methods for Bioinformatics and Biostatistics. Springer 275--286.   Y. Li and A. Ngom. 2011. Classification of clinical gene-sample-time microarray expression data via tensor decomposition methods. In Computational Intelligence Methods for Bioinformatics and Biostatistics. Springer 275--286.","DOI":"10.1007\/978-3-642-21946-7_22"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150440"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.80"},{"key":"e_1_2_1_26_1","unstructured":"Tom Mitchell. Read the Web. http:\/\/rtw.ml.cmu.edu\/rtw\/people. Last accessed: 9\/9\/2014.  Tom Mitchell. Read the Web. http:\/\/rtw.ml.cmu.edu\/rtw\/people. Last accessed: 9\/9\/2014."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016885"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement. USENIX Association","author":"Pang R.","unstructured":"R. Pang , M. Allman , M. Bennett , J. Lee , V. Paxson , and B. Tierney . 2005. A first look at modern enterprise traffic . In Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement. USENIX Association , Philadelphia, PA, USA, 2--2. R. Pang, M. Allman, M. Bennett, J. Lee, V. Paxson, and B. Tierney. 2005. A first look at modern enterprise traffic. In Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement. USENIX Association, Philadelphia, PA, USA, 2--2."},{"key":"e_1_2_1_29_1","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, Prague, Czech Republic","author":"Papalexakis E. E.","unstructured":"E. E. Papalexakis and N. D. Sidiropoulos . 2011. Co-clustering as multilinear decomposition with sparse latent factors . In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, Prague, Czech Republic , 2064--2067. E. E. Papalexakis and N. D. Sidiropoulos. 2011. Co-clustering as multilinear decomposition with sparse latent factors. In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, Prague, Czech Republic, 2064--2067."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_39"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 2014 SIAM International Conference on Data Mining. SIAM","author":"Papalexakis E. E.","unstructured":"E. E. Papalexakis , T. M. Mitchell , N. D. Sidiropoulos , C. Faloutsos , P. P. Talukdar , and B. Murphy . 2014. Turbo-SMT: Accelerating coupled sparse Matrix-Tensor factorizations by 200x . In Proceedings of the 2014 SIAM International Conference on Data Mining. SIAM , Philadelphia, PA, USA. E. E. Papalexakis, T. M. Mitchell, N. D. Sidiropoulos, C. Faloutsos, P. P. Talukdar, and B. Murphy. 2014. Turbo-SMT: Accelerating coupled sparse Matrix-Tensor factorizations by 200x. In Proceedings of the 2014 SIAM International Conference on Data Mining. SIAM, Philadelphia, PA, USA."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2225052"},{"key":"e_1_2_1_33_1","volume-title":"3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). IEEE, Aruba, Dutch Antilles, 316--319","author":"Phan A. H.","unstructured":"A. H. Phan and A. Cichocki . 2009. Block decomposition for very large-scale nonnegative tensor factorization . In 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). IEEE, Aruba, Dutch Antilles, 316--319 . A. H. Phan and A. Cichocki. 2009. Block decomposition for very large-scale nonnegative tensor factorization. In 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). IEEE, Aruba, Dutch Antilles, 316--319."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/78.824675"},{"key":"e_1_2_1_35_1","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","author":"Sidiropoulos N. D.","unstructured":"N. D. Sidiropoulos , E. E. Papalexakis , and C. Faloutsos . 2014a. A parallel algorithm for big tensor decomposition using randomly compressed cubes (PARACOMP) . In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . Florence, Italy. N. D. Sidiropoulos, E. E. Papalexakis, and C. Faloutsos. 2014a. A parallel algorithm for big tensor decomposition using randomly compressed cubes (PARACOMP). In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). Florence, Italy."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329196"},{"key":"e_1_2_1_37_1","volume-title":"Multivis: Content-based social network exploration through multi-way visual analysis. In Proc. SDM","author":"Sun J.","year":"2009","unstructured":"J. Sun , S. Papadimitriou , C. Y. Lin , N. Cao , S. Liu , and W. Qian . 2009 . Multivis: Content-based social network exploration through multi-way visual analysis. In Proc. SDM , Vol. 9 . Reno, NV , USA , 1063--1074. J. Sun, S. Papadimitriou, C. Y. Lin, N. Cao, S. Liu, and W. Qian. 2009. Multivis: Content-based social network exploration through multi-way visual analysis. In Proc. SDM, Vol. 9. Reno, NV, USA, 1063--1074."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060803"},{"key":"e_1_2_1_40_1","volume-title":"Mach: Fast randomized tensor decompositions. Arxiv preprint arXiv:0909.4969.","author":"Tsourakakis C. E.","year":"2009","unstructured":"C. E. Tsourakakis . 2009 . Mach: Fast randomized tensor decompositions. Arxiv preprint arXiv:0909.4969. C. E. Tsourakakis. 2009. Mach: Fast randomized tensor decompositions. Arxiv preprint arXiv:0909.4969."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/645315.649173"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01973-9_45"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2729980","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2729980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:00Z","timestamp":1750227120000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2729980"}},"subtitle":["Sparse Parallelizable CANDECOMP-PARAFAC Tensor Decomposition"],"short-title":[],"issued":{"date-parts":[[2015,7,22]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7,27]]}},"alternative-id":["10.1145\/2729980"],"URL":"https:\/\/doi.org\/10.1145\/2729980","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,22]]},"assertion":[{"value":"2015-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-07-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}