{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T03:32:45Z","timestamp":1777865565969,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031976285","type":"print"},{"value":"9783031976292","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97629-2_18","type":"book-chapter","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T06:30:31Z","timestamp":1751610631000},"page":"249-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["cuTeBool: Fast and\u00a0Scalable Boolean Matrix Factorization on\u00a0GPUs Using Tensor Cores"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0683-8803","authenticated-orcid":false,"given":"Andrea","family":"Beyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9379-7129","authenticated-orcid":false,"given":"Valentin","family":"Henkys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2726-1908","authenticated-orcid":false,"given":"Robin","family":"Kobus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0136-2540","authenticated-orcid":false,"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2597-8331","authenticated-orcid":false,"given":"Bertil","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,5]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.dam.2017.12.044","volume":"249","author":"R Belohlavek","year":"2018","unstructured":"Belohlavek, R., Trnecka, M.: A new algorithm for Boolean matrix factorization which admits overcovering. Discret. Appl. Math. 249, 36\u201352 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.12.044","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R Belohlavek","year":"2010","unstructured":"Belohlavek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. JCCS 76(1), 3\u201320 (2010). https:\/\/doi.org\/10.1016\/j.jcss.2009.05.002","journal-title":"JCCS"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Harper, F.M., Konstan, J.A.: The movielens datasets: history and context. ACM TiiS 5(4) (2015). https:\/\/doi.org\/10.1145\/2827872","DOI":"10.1145\/2827872"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1007\/S10618-017-0508-Z","volume":"31","author":"S Hess","year":"2017","unstructured":"Hess, S., Morik, K., Piatkowski, N.: The PRIMPING routine - tiling through proximal alternating linearized minimization. Data Min. Knowl. Discov. 31(4), 1090\u20131131 (2017). https:\/\/doi.org\/10.1007\/S10618-017-0508-Z","journal-title":"Data Min. Knowl. Discov."},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Kobus, R., Lamoth, A., Muller, A., Hundt, C., Kramer, S., Schmidt, B.: cuBool: bit-parallel Boolean matrix factorization on CUDA-enabled accelerators. In: ICPADS 2018, pp. 465\u2013472 (2018). https:\/\/doi.org\/10.1109\/PADSW.2018.8644574","DOI":"10.1109\/PADSW.2018.8644574"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-030-21462-3_14","volume-title":"Formal Concept Analysis","author":"P Kraj\u010da","year":"2019","unstructured":"Kraj\u010da, P., Trnecka, M.: Parallelization of the GreConD algorithm for\u00a0Boolean matrix factorization. In: Cristea, D., Le Ber, F., Sertkaya, B. (eds.) ICFCA 2019. LNCS (LNAI), vol. 11511, pp. 208\u2013222. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21462-3_14"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Lucchese, C., Orlando, S., Perego, R.: Mining top-k patterns from binary datasets in presence of noise, pp. 165\u2013176 (2010). https:\/\/doi.org\/10.1137\/1.9781611972801.15","DOI":"10.1137\/1.9781611972801.15"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Miettinen, P.: Dynamic Boolean matrix factorizations. In: ICDM 2012, pp. 519\u2013528 (2012). https:\/\/doi.org\/10.1109\/ICDM.2012.118","DOI":"10.1109\/ICDM.2012.118"},{"issue":"10","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. IEEE Trans. Knowl. Data Eng. 20(10), 1348\u20131362 (2008). https:\/\/doi.org\/10.1109\/TKDE.2008.53","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Miettinen, P., Vreeken, J.: MDL4BMF: minimum description length for Boolean matrix factorization. ACM Trans. Knowl. Discov. Data 8(4) (2014). https:\/\/doi.org\/10.1145\/2601437","DOI":"10.1145\/2601437"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Mitchell, T.: Twenty newsgroups. UCI Machine Learning Repository (1999). https:\/\/doi.org\/10.24432\/C5C323","DOI":"10.24432\/C5C323"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0025-5564(78)90088-3","volume":"40","author":"DS Nau","year":"1978","unstructured":"Nau, D.S., Markowsky, G., Woodbury, M.A., Bernard Amos, D.: A mathematical analysis of human leukocyte antigen serology. Math. Biosci. 40(3), 243\u2013270 (1978). https:\/\/doi.org\/10.1016\/0025-5564(78)90088-3","journal-title":"Math. Biosci."},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Ni, J., Li, J., McAuley, J.: Justifying recommendations using distantly-labeled reviews and fine-grained aspects. In: 2019 EMNLP-IJCNLP, pp. 188\u2013197. ACL, Hong Kong (2019). https:\/\/doi.org\/10.18653\/v1\/D19-1018","DOI":"10.18653\/v1\/D19-1018"},{"key":"18_CR14","unstructured":"NVIDIA Corporation: CUDA C++ Toolkit Documentation. https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html#wmma. Accessed 18 Oct 2024"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jpdc.2018.09.014","volume":"123","author":"J Outrata","year":"2019","unstructured":"Outrata, J., Trnecka, M.: Parallel exploration of partial solutions in Boolean matrix factorization. J. Parallel Distrib. Comput. 123, 180\u2013191 (2019). https:\/\/doi.org\/10.1016\/j.jpdc.2018.09.014","journal-title":"J. Parallel Distrib. Comput."},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: WSDM 2017, pp. 601\u2013610. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3018661.3018731","DOI":"10.1145\/3018661.3018731"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"108895","DOI":"10.1016\/j.knosys.2022.108895","volume":"249","author":"M Trnecka","year":"2022","unstructured":"Trnecka, M., Vyjidacek, R.: Revisiting the GreCon algorithm for Boolean matrix factorization. Knowl.-Based Syst. 249, 108895 (2022). https:\/\/doi.org\/10.1016\/j.knosys.2022.108895","journal-title":"Knowl.-Based Syst."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken, J., Leeuwen, M., Siebes, A.: KRIMP: mining itemsets that compress. Data Min. Knowl. Discov. 23, 169\u2013214 (2011). https:\/\/doi.org\/10.1007\/s10618-010-0202-x","journal-title":"Data Min. Knowl. Discov."},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Wan, C., Chang, W., Zhao, T., Li, M., Cao, S., Zhang, C.: Fast and efficient Boolean matrix factorization by geometric segmentation. In: Proceedings of the AAAI Conference on AI, vol. 34, no. 04, pp. 6086\u20136093 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i04.6072","DOI":"10.1609\/aaai.v34i04.6072"},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Wan, M., McAuley, J.: Item recommendation on monotonic behavior chains. In: RecSys 2018, pp. 86\u201394. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3240323.3240369","DOI":"10.1145\/3240323.3240369"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97629-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T06:53:10Z","timestamp":1777531990000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97629-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031976285","9783031976292"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97629-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}