{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:48:35Z","timestamp":1755794915056,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"FWF","award":["10.55776\/COE12"],"award-info":[{"award-number":["10.55776\/COE12"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709303","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:42:22Z","timestamp":1743792142000},"page":"565-576","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Partial Pre-Post Code Tree: A Memory-Efficient Tree Structure for Conjunctive Rule Mining"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7972-206X","authenticated-orcid":false,"given":"Van Quoc Phuong","family":"Huynh","sequence":"first","affiliation":[{"name":"Johannes Kepler University Linz, Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3183-2953","authenticated-orcid":false,"given":"Florian","family":"Beck","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1207-0159","authenticated-orcid":false,"given":"Johannes","family":"F\u00fcrnkranz","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Linz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets. In International Joint Conference on Rules and Reasoning. Springer, 95--109","author":"Beck Florian","year":"2023","unstructured":"Florian Beck, Johannes F\u00fcrnkranz, and Van Quoc Phuong Huynh. 2023. Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets. In International Joint Conference on Rules and Reasoning. Springer, 95--109."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.01.010"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.03.004"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-012-4638-z"},{"key":"e_1_3_2_2_5_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.35"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2945573"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_2_9_1","volume-title":"Incremental Update of Locally Optimal Classification Rules. In International Conference on Discovery Science. Springer, 104--113","author":"Phuong Huynh Van Quoc","year":"2022","unstructured":"Van Quoc Phuong Huynh, Florian Beck, and Johannes F\u00fcrnkranz. 2022. Incremental Update of Locally Optimal Classification Rules. In International Conference on Discovery Science. Springer, 104--113."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-022-06290-w"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112874"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.04.048"},{"key":"e_1_3_2_2_13_1","volume-title":"Proc. 1st International Joint Conference on Pattern Recognition. 3--17","author":"Michalski Ryszard S.","year":"1973","unstructured":"Ryszard S. Michalski. 1973. AQVAL\/1 -- Computer Implementation of a Variable-valued Logic System VL1 and Examples of its Application to Pattern Recognition. In Proc. 1st International Joint Conference on Pattern Recognition. 3--17."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(83)90016-4"},{"key":"e_1_3_2_2_15_1","volume-title":"Proc. IEEE International Conference on Data Mining. IEEE, 441--448","author":"Pei Jian","year":"2001","unstructured":"Jian Pei, Jiawei Han, Hongjun Lu, Shojiro Nishio, Shiwei Tang, and Dongqing Yang. 2001. H-mine: Hyper-structure mining of frequent patterns in large databases. In Proc. IEEE International Conference on Data Mining. IEEE, 441--448."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3256126"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISWC.2012.13"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951420"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the 14th Australasian Database Conference","volume":"17","author":"Sucahyo Yudho Giri","year":"2003","unstructured":"Yudho Giri Sucahyo and Raj P Gopalan. 2003. CT-ITL: Efficient frequent item set mining using a compressed prefix tree with pattern growth. In Proceedings of the 14th Australasian Database Conference, Vol. 17. 95--104."},{"key":"e_1_3_2_2_20_1","volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI),, R. Bayardo, B. Goethals, and M. J. Zaki (Eds.). 212--223","author":"Sucahyo Yudho Giri","year":"2004","unstructured":"Yudho Giri Sucahyo and Raj P Gopalan. 2004. CT-PRO: A bottom-up non recursive frequent itemset mining algorithm using compressed FP-Tree data structure. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI),, R. Bayardo, B. Goethals, and M. J. Zaki (Eds.). 212--223."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-010-0121-8"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956788"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Toronto ON Canada","acronym":"KDD '25"},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:36:10Z","timestamp":1755358570000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":23,"alternative-id":["10.1145\/3690624.3709303","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709303","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}