{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:13:52Z","timestamp":1772784832277,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T00:00:00Z","timestamp":1552867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00778-019-00538-z","type":"journal-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T10:03:06Z","timestamp":1552903386000},"page":"549-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Fast and scalable method for distributed Boolean tensor factorization"],"prefix":"10.1007","volume":"28","author":[{"given":"Namyong","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sejoon","family":"Oh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,18]]},"reference":[{"issue":"3","key":"538_CR1","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(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"538_CR2","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, D., Miettinen, P.: Walk \u2019n\u2019 merge: a scalable algorithm for Boolean tensor factorization. In: ICDM, pp. 1037\u20131042 (2013)","DOI":"10.1109\/ICDM.2013.141"},{"key":"538_CR3","doi-asserted-by":"crossref","unstructured":"Miettinen, P.: Boolean tensor factorizations. In: ICDM (2011)","DOI":"10.1109\/ICDM.2011.28"},{"key":"538_CR4","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, D., Miettinen, P.: Discovering facts with Boolean tensor tucker decomposition. In: CIKM, pp. 1569\u20131572 (2013)","DOI":"10.1145\/2505515.2507846"},{"issue":"5","key":"538_CR5","first-page":"1343","volume":"29","author":"S Metzler","year":"2015","unstructured":"Metzler, S., Miettinen, P.: Clustering Boolean tensors. DMKD 29(5), 1343\u20131373 (2015)","journal-title":"DMKD"},{"issue":"2","key":"538_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s11083-012-9254-4","volume":"30","author":"R Belohl\u00e1vek","year":"2013","unstructured":"Belohl\u00e1vek, R., Glodeanu, C.V., Vychodil, V.: Optimal factorization of three-way binary data using triadic concepts. Order 30(2), 437\u2013454 (2013)","journal-title":"Order"},{"issue":"1","key":"538_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02294316","volume":"64","author":"I Leenen","year":"1999","unstructured":"Leenen, I., Van Mechelen, I., De Boeck, P., Rosenberg, S.: INDCLAS: a three-way hierarchical classes model. Psychometrika 64(1), 9\u201324 (1999)","journal-title":"Psychometrika"},{"key":"538_CR8","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauly, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: NSDI, pp. 15\u201328 (2012)"},{"key":"538_CR9","doi-asserted-by":"crossref","unstructured":"Park, N., Oh, S., Kang, U.: Fast and scalable distributed Boolean tensor factorization. In: ICDE, pp. 1071\u20131082 (2017)","DOI":"10.1109\/ICDE.2017.152"},{"issue":"1","key":"538_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.: Closed patterns meet n-ary relations. TKDD 3(1), 3 (2009)","journal-title":"TKDD"},{"key":"538_CR11","unstructured":"Ji, L., Tan, K., Tung, A.K.H.: Mining frequent closed cubes in 3D datasets. In: VLDB, pp. 811\u2013822 (2006)"},{"key":"538_CR12","doi-asserted-by":"crossref","unstructured":"Kang, U., Papalexakis, E.E., Harpale, A., Faloutsos, C.: Gigatensor: scaling tensor analysis up by 100 times\u2014algorithms and discoveries. In: KDD, pp. 316\u2013324 (2012)","DOI":"10.1145\/2339530.2339583"},{"key":"538_CR13","doi-asserted-by":"crossref","unstructured":"Jeon, B., Jeon, I., Sael, L., Kang, U.: Scout: scalable coupled matrix-tensor factorization\u2014algorithm and discoveries. In: ICDE, pp. 811\u2013822 (2016)","DOI":"10.1109\/ICDE.2016.7498292"},{"issue":"4","key":"538_CR14","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00778-016-0427-4","volume":"25","author":"I Jeon","year":"2016","unstructured":"Jeon, I., Papalexakis, E.E., Faloutsos, C., Sael, L., Kang, U.: Mining billion-scale tensors: algorithms and discoveries. VLDB J. 25(4), 519\u2013544 (2016)","journal-title":"VLDB J."},{"issue":"2","key":"538_CR15","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.: Scalable tensor mining. Big Data Res. 2(2), 82\u201386 (2015). (visions on Big Data)","journal-title":"Big Data Res."},{"key":"538_CR16","doi-asserted-by":"crossref","unstructured":"Park, N., Jeon, B., Lee, J., Kang, U.: Bigtensor: mining billion-scale tensor made easy. In: CIKM, pp. 2457\u20132460 (2016)","DOI":"10.1145\/2983323.2983332"},{"key":"538_CR17","doi-asserted-by":"crossref","unstructured":"Beutel, A., Talukdar, P.P., Kumar, A., Faloutsos, C., Papalexakis, E.E., Xing, E.P.: Flexifact: scalable flexible factorization of coupled tensors on hadoop. In: SDM, pp. 109\u2013117 (2014)","DOI":"10.1137\/1.9781611973440.13"},{"key":"538_CR18","doi-asserted-by":"crossref","unstructured":"Papalexakis, E.E., Faloutsos, C., Sidiropoulos, N.D.: Parcube: sparse parallelizable tensor decompositions. In: ECML PKDD, pp. 521\u2013536 (2012)","DOI":"10.1007\/978-3-642-33460-3_39"},{"key":"538_CR19","doi-asserted-by":"crossref","unstructured":"Li, J., Choi, J., Perros, I., Sun, J., Vuduc, R.: Model-driven sparse CP decomposition for higher-order tensors. In: IPDPS (2017)","DOI":"10.1109\/IPDPS.2017.80"},{"key":"538_CR20","doi-asserted-by":"crossref","unstructured":"Smith, S., Park, J., Karypis, G.: An exploration of optimization algorithms for high performance tensor completion. In: SC (2016)","DOI":"10.1109\/SC.2016.30"},{"key":"538_CR21","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.parco.2015.10.002","volume":"57","author":"L Karlsson","year":"2016","unstructured":"Karlsson, L., Kressner, D., Uschmajew, A.: Parallel algorithms for tensor completion in the CP format. Parallel Comput. 57, 222\u2013234 (2016)","journal-title":"Parallel Comput."},{"issue":"1","key":"538_CR22","first-page":"100","volume":"29","author":"K Shin","year":"2017","unstructured":"Shin, K., Sael, L., Kang, U.: Fully scalable methods for distributed tensor factorization. TKDE 29(1), 100\u2013113 (2017)","journal-title":"TKDE"},{"issue":"4","key":"538_CR23","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"LD Lathauwer","year":"2000","unstructured":"Lathauwer, L.D., Moor, B.D., Vandewalle, J.: On the best rank-1 and rank-(\n                    \n                      \n                    \n                    $$R_{1},R_{2},\\ldots, R_{N}$$\n                    \n                      \n                        \n                          \n                            R\n                            1\n                          \n                          ,\n                          \n                            R\n                            2\n                          \n                          ,\n                          \u2026\n                          ,\n                          \n                            R\n                            N\n                          \n                        \n                      \n                    \n                  ) approximation of higher-order tensors. SIMAX 21(4), 1324\u20131342 (2000)","journal-title":"SIMAX"},{"key":"538_CR24","doi-asserted-by":"crossref","unstructured":"Kolda, T.G., Sun, J.: Scalable tensor decompositions for multi-aspect data mining. In: ICDM, pp. 363\u2013372 (2008)","DOI":"10.1109\/ICDM.2008.89"},{"key":"538_CR25","doi-asserted-by":"crossref","unstructured":"Oh, J., Shin, K., Papalexakis, E.E., Faloutsos, C., Yu, H.: S-hot: scalable high-order tucker decomposition. In: WSDM (2017)","DOI":"10.1145\/3018661.3018721"},{"key":"538_CR26","doi-asserted-by":"crossref","unstructured":"Smith, S., Karypis, G.: Accelerating the tucker decomposition with compressed sparse tensors. In: Europar (2017)","DOI":"10.1007\/978-3-319-64203-1_47"},{"key":"538_CR27","doi-asserted-by":"crossref","unstructured":"Kaya, O., U\u00e7ar, B.: High performance parallel algorithms for the tucker decomposition of sparse tensors. In: ICPP (2016)","DOI":"10.1109\/ICPP.2016.19"},{"key":"538_CR28","doi-asserted-by":"crossref","unstructured":"Oh, S., Park, N., Sael, L., Kang, U.: Scalable tucker factorization for sparse tensors\u2014algorithms and discoveries. In: ICDE (2018)","DOI":"10.1109\/ICDE.2018.00104"},{"key":"538_CR29","unstructured":"Chakaravarthy, V.T., Choi, J.W., Joseph, D.J., Liu, X., Murali, P., Sabharwal, Y., Sreedhar, D.: On optimizing distributed tucker decomposition for dense tensors (2017). CoRR \n                    arXiv:1707.05594"},{"key":"538_CR30","unstructured":"Choi, J.H., Vishwanathan, S.: Dfacto: distributed factorization of tensors. In: NIPS (2014)"},{"key":"538_CR31","doi-asserted-by":"crossref","unstructured":"Kaya, O., U\u00e7ar, B.: Scalable sparse tensor decompositions in distributed memory systems. In: SC, pp. 1\u201311 (2015)","DOI":"10.1145\/2807591.2807624"},{"key":"538_CR32","doi-asserted-by":"crossref","unstructured":"Austin, W., Ballard, G., Kolda, T.G.: Parallel tensor compression for large-scale scientific data. In: IPDPS (2016)","DOI":"10.1109\/IPDPS.2016.67"},{"key":"538_CR33","doi-asserted-by":"crossref","unstructured":"Smith, S., Karypis, G.: A medium-grained algorithm for distributed sparse tensor factorization. In: IPDPS (2016)","DOI":"10.1109\/IPDPS.2016.113"},{"key":"538_CR34","doi-asserted-by":"publisher","first-page":"2814","DOI":"10.1109\/TPDS.2018.2841843","volume":"29","author":"S Acer","year":"2018","unstructured":"Acer, S., Torun, T., Aykanat, C.: Improving medium-grain partitioning for scalable sparse tensor decomposition. IEEE Trans. Parallel Distrib. Syst. 29, 2814\u20132825 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"538_CR35","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: OSDI, pp. 137\u2013150 (2004)"},{"key":"538_CR36","unstructured":"Apache hadoop. \n                    http:\/\/hadoop.apache.org\/"},{"key":"538_CR37","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: PEGASUS: a peta-scale graph mining system. In: ICDM, pp. 229\u2013238 (2009)"},{"key":"538_CR38","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Park, N., Myaeng, S.-H., Kang, U.: Partition aware connected component computation in distributed systems. In: ICDM (2016)","DOI":"10.1109\/ICDM.2016.0053"},{"key":"538_CR39","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Myaeng, S.-H., Kang, U.: Pte: enumerating trillion triangles on distributed systems. In: KDD, pp. 1115\u20131124 (2016)","DOI":"10.1145\/2939672.2939757"},{"key":"538_CR40","unstructured":"Kang, U., Tong, H., Sun, J., Lin, C., Faloutsos, C.: GBASE: a scalable and general graph management system. In: KDD"},{"key":"538_CR41","doi-asserted-by":"crossref","unstructured":"Kalavri, V., Vlassov, V.: Mapreduce: limitations, optimizations and open issues. In: TrustCom, pp. 1031\u20131038 (2013)","DOI":"10.1109\/TrustCom.2013.126"},{"key":"538_CR42","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. In: HotCloud (2010)"},{"key":"538_CR43","doi-asserted-by":"crossref","unstructured":"Lulli, A., Ricci, L., Carlini, E., Dazzi, P., Lucchese, C.: Cracker: crumbling large graphs into connected components. In: ISCC, pp. 574\u2013581 (2015)","DOI":"10.1109\/ISCC.2015.7405576"},{"issue":"18","key":"538_CR44","doi-asserted-by":"publisher","first-page":"2652","DOI":"10.1093\/bioinformatics\/btu343","volume":"30","author":"MS Wiewi\u00f3rka","year":"2014","unstructured":"Wiewi\u00f3rka, M.S., Messina, A., Pacholewska, A., Maffioletti, S., Gawrysiak, P., Okoniewski, M.J.: Sparkseq: fast, scalable and cloud-ready tool for the interactive genomic data analysis with nucleotide precision. Bioinformatics 30(18), 2652\u20132653 (2014)","journal-title":"Bioinformatics"},{"key":"538_CR45","doi-asserted-by":"crossref","unstructured":"Gu, R., Tang, Y., Wang, Z., Wang, S., Yin, X., Yuan, C., Huang, Y.: Efficient large scale distributed matrix computation with spark. In: IEEE BigData, pp. 2327\u20132336 (2015)","DOI":"10.1109\/BigData.2015.7364023"},{"key":"538_CR46","unstructured":"Zadeh, R.B., Meng, X., Ulanov, A., Yavuz, B., Pu, L., Venkataraman, S., Sparks, E.R., Staple, A., Zaharia, M.: Matrix computations and optimization in apache spark. In: KDD, pp. 31\u201338 (2016)"},{"key":"538_CR47","unstructured":"Kim, H., Park, J., Jang, J., Yoon, S.: Deepspark: spark-based deep learning supporting asynchronous updates and caffe compatibility (2016). CoRR \n                    arXiv:1602.08191"},{"issue":"10","key":"538_CR48","first-page":"1348","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. TKDE 20(10), 1348\u20131362 (2008)","journal-title":"The discrete basis problem. TKDE"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00538-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00538-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00538-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T00:19:57Z","timestamp":1584404397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00538-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,18]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["538"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00538-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,18]]},"assertion":[{"value":"7 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}