{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T02:40:58Z","timestamp":1755830458376,"version":"3.44.0"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T00:00:00Z","timestamp":1716940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,5,29]]},"abstract":"<jats:p>Extracting interesting patterns from data is the main objective of Data Mining. In this context, Frequent Itemset Mining has shown its usefulness in providing insights from transactional databases, which, in turn, can be used to gain insights about the structure of Knowledge Graphs. While there have been a lot of advances in the field, due to the NP-hard nature of the problem, the main approaches still struggle when they are faced with large databases with large and sparse vocabularies, such as the ones obtained from graph propositionalizations. There have been efforts to propose parallel algorithms, but, so far, the goal has not been to tackle this source of complexity (i.e., vocabulary size), thus, in this paper, we propose to parallelize frequent itemset mining algorithms by partitioning the database horizontally (i.e., transaction-wise) while not neglecting all the possible vertical information (i.e., item-wise). Instead of relying on pure item co-appearance metrics, we advocate for the adoption of a different approach: modeling databases as documents, where each transaction is a sentence, and each item a word. In this way, we can apply recent language modeling techniques (i.e., word embeddings) to obtain a continuous representation of the database, clusterize it in different partitions, and apply any mining algorithm to them. We show how our proposal leads to informed partitions with a reduced vocabulary size and a reduced entropy (i.e., disorder). This enhances the scalability, allowing us to speed up mining even in very large databases with sparse vocabularies. We have carried out a thorough experimental evaluation over both synthetic and real datasets showing the benefits of our proposal.<\/jats:p>","DOI":"10.1145\/3654987","type":"journal-article","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T09:44:53Z","timestamp":1717062293000},"page":"1-27","source":"Crossref","is-referenced-by-count":0,"title":["Language-Model Based Informed Partition of Databases to Speed Up Pattern Mining"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4239-8785","authenticated-orcid":false,"given":"Carlos","family":"Bobed Lisbona","sequence":"first","affiliation":[{"name":"Aragon Institute of Engineering Research (I3A), University of Zaragoza, Zaragoza, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8531-353X","authenticated-orcid":false,"given":"Jordi","family":"Bernad","sequence":"additional","affiliation":[{"name":"Aragon Institute of Engineering Research (I3A), University of Zaragoza, Zaragoza, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-439X","authenticated-orcid":false,"given":"Pierre","family":"Maillot","sequence":"additional","affiliation":[{"name":"University Cote d'Azur Inria, CNRS, I3S, Nice, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2003.1211462"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584888"},{"key":"e_1_2_1_4_1","volume-title":"A Neural Probabilistic Language Model. J. Mach. Learn. Res. 3 (mar","author":"Bengio Yoshua","year":"2003","unstructured":"Yoshua Bengio, R\u00e9jean Ducharme, Pascal Vincent, and Christian Janvin. 2003. A Neural Probabilistic Language Model. J. Mach. Learn. Res. 3 (mar 2003), 1137--1155."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-021-00749-5"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-200368"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00051"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1074"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033831.2033854"},{"key":"e_1_2_1_10_1","unstructured":"Tom B. Brown Benjamin Mann Nick Ryder Melanie Subbiah Jared Kaplan Prafulla Dhariwal Arvind Neelakantan Pranav Shyam Girish Sastry Amanda Askell Sandhini Agarwal Ariel Herbert-Voss Gretchen Krueger Tom Henighan Rewon Child Aditya Ramesh Daniel M. Ziegler Jeffrey Wu Clemens Winter Christopher Hesse Mark Chen Eric Sigler Mateusz Litwin Scott Gray Benjamin Chess Jack Clark Christopher Berner Sam McCandlish Alec Radford Ilya Sutskever and Dario Amodei. 2020. Language Models are Few-Shot Learners. http:\/\/arxiv.org\/abs\/2005.14165"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190649"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--1--4419-"},{"volume-title":"The LUCS--KDD discretised\/normalised ARM and CARM data library. Department of Computer Science","author":"Coenen F","key":"e_1_2_1_14_1","unstructured":"F Coenen. 2003. The LUCS--KDD discretised\/normalised ARM and CARM data library. Department of Computer Science, The University of Liverpool, UK. https:\/\/cgi.csc.liv.ac.uk\/~frans\/KDD\/Software\/LUCS-KDD-DN\/DataSets\/dataSets.html"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N19--1423"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3836"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.060"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3439771"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3001460.3001507"},{"key":"e_1_2_1_20_1","volume-title":"Studies in Linguistic Analysis","author":"Firth J.","year":"1930","unstructured":"J. Firth. 1957. Studies in Linguistic Analysis. Oxford: Blackwell, Chapter A Synopsis of Linguistic Theory, 1930--1955, 1--32."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467348"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/1403797"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1207"},{"volume-title":"Principles of Data Mining and Knowledge Discovery","author":"Giannotti Fosca","key":"e_1_2_1_24_1","unstructured":"Fosca Giannotti, Cristian Gozzi, and Giuseppe Manco. 2002. Clustering Transactional Data. In Principles of Data Mining and Knowledge Discovery, Tapio Elomaa, Heikki Mannila, and Hannu Toivonen (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 175--187."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098034"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/00437956"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Z. R. Hesabi Z. Tari A. Goscinski A. Fahad I. Khalil and C. Queiroz. 2015. Data Summarization Techniques for Big Data-A Survey. Springer New York New York NY 1109--1152. https:\/\/doi.org\/10.1007\/978--1--4939--2092--1_38","DOI":"10.1007\/978--1--4939--2092--1_38"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447772"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41398-8_20"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-011-0672--7"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--1--4684--2001--2_9"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662-04599--2_11"},{"key":"e_1_2_1_34_1","volume-title":"S\u00f6ren Auer, et al.","author":"Lehmann Jens","year":"2015","unstructured":"Jens Lehmann, Robert Isele, Max Jakob, Anja Jentzsch, Dimitris Kontokostas, Pablo N Mendes, Sebastian Hellmann, Mohamed Morsey, Patrick Van Kleef, S\u00f6ren Auer, et al. 2015. Dbpedia--a large-scale, multilingual knowledge base extracted from wikipedia. Semantic web 6, 2 (2015), 167--195."},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 27th International Conference on Neural Information Processing Systems -","volume":"2","author":"Levy Omer","year":"2014","unstructured":"Omer Levy and Yoav Goldberg. 2014. Neural word embedding as implicit matrix factorization. In Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2 (Montreal, Canada) (NIPS'14). MIT Press, Cambridge, MA, USA, 2177--2185."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3904"},{"key":"e_1_2_1_37_1","unstructured":"Yinhan Liu Myle Ott Naman Goyal Jingfei Du Mandar Joshi Danqi Chen Omer Levy Mike Lewis Luke Zettlemoyer and Veselin Stoyanov. 2019. RoBERTa: A Robustly Optimized BERT Pretraining Approach. http:\/\/arxiv.org\/abs\/1907. 11692"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the fifth Berkeley symposium on mathematical statistics and probability","volume":"1","author":"James","unstructured":"James MacQueen et al. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, Vol. 1. Oakland, CA, USA, 281--297."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3167132.3167342"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.106"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244303322533223"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691742"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101754"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the LREC 2010 Workshop on New Challenges for NLP Frameworks. ELRA, Valletta, Malta, 45--50","author":"Petr Sojka Radim","year":"2010","unstructured":"Radim ?eh??ek and Petr Sojka. 2010. Software Framework for Topic Modelling with Large Corpora. In Proceedings of the LREC 2010 Workshop on New Challenges for NLP Frameworks. ELRA, Valletta, Malta, 45--50. http:\/\/is.muni.cz\/ publication\/884893\/en."},{"volume-title":"Minimum Description Length Principle","author":"Rissanen Jorma","key":"e_1_2_1_46_1","unstructured":"Jorma Rissanen. 2014. Minimum Description Length Principle. In Wiley StatsRef: Statistics Reference Online. John Wiley & Sons, Inc."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-180317"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.21"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0202-x"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/319950.320054"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040--1"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2560176"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775149"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2004.11.008"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2011.61"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654987","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3654987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:39:26Z","timestamp":1755787166000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3654987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,29]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5,29]]}},"alternative-id":["10.1145\/3654987"],"URL":"https:\/\/doi.org\/10.1145\/3654987","relation":{},"ISSN":["2836-6573"],"issn-type":[{"type":"electronic","value":"2836-6573"}],"subject":[],"published":{"date-parts":[[2024,5,29]]}}}