{"id":"https://openalex.org/W4409149185","doi":"https://doi.org/10.1145/3690624.3709303","title":"Partial Pre-Post Code Tree: A Memory-Efficient Tree Structure for Conjunctive Rule Mining","display_name":"Partial Pre-Post Code Tree: A Memory-Efficient Tree Structure for Conjunctive Rule Mining","publication_year":2025,"publication_date":"2025-04-04","ids":{"openalex":"https://openalex.org/W4409149185","doi":"https://doi.org/10.1145/3690624.3709303"},"language":"en","primary_location":{"id":"doi:10.1145/3690624.3709303","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3690624.3709303","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3690624.3709303","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088807468","display_name":"Van Quoc Phuong Huynh","orcid":"https://orcid.org/0000-0002-7972-206X"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Van Quoc Phuong Huynh","raw_affiliation_strings":["Johannes Kepler University Linz, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014597115","display_name":"Florian Beck","orcid":"https://orcid.org/0000-0003-3183-2953"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Florian Beck","raw_affiliation_strings":["Johannes Kepler University Linz, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020009031","display_name":"Johannes F\u00fcrnkranz","orcid":"https://orcid.org/0000-0002-1207-0159"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Johannes F\u00fcrnkranz","raw_affiliation_strings":["Johannes Kepler University Linz, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088807468"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07987756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"565","last_page":"576"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6981911659240723},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47706639766693115},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.46226465702056885},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3664402961730957},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.23212888836860657},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21564322710037231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17399168014526367},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.05484774708747864}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6981911659240723},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47706639766693115},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.46226465702056885},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3664402961730957},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.23212888836860657},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21564322710037231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17399168014526367},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.05484774708747864}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3690624.3709303","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3690624.3709303","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3690624.3709303","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3690624.3709303","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W27502476","https://openalex.org/W841472321","https://openalex.org/W1977055639","https://openalex.org/W2001350744","https://openalex.org/W2026297770","https://openalex.org/W2066531776","https://openalex.org/W2080632942","https://openalex.org/W2096461567","https://openalex.org/W2097994458","https://openalex.org/W2099404336","https://openalex.org/W2115482638","https://openalex.org/W2132513611","https://openalex.org/W2256820277","https://openalex.org/W2612118251","https://openalex.org/W2970842959","https://openalex.org/W2979517978","https://openalex.org/W4317798210","https://openalex.org/W4324116382"],"related_works":["https://openalex.org/W2071459461","https://openalex.org/W2093885745","https://openalex.org/W2351266481","https://openalex.org/W2132547887","https://openalex.org/W2516987005","https://openalex.org/W2907786475","https://openalex.org/W2963447120","https://openalex.org/W4289082820","https://openalex.org/W2092152400","https://openalex.org/W2963196945"],"abstract_inverted_index":{"State-of-the-art":[0],"rule":[1,49],"mining":[2,50],"algorithms":[3,117],"rely":[4],"on":[5,82],"summarizing":[6],"the":[7,23,41,83,105,120,135,146,152,168,178],"training":[8],"set":[9],"into":[10,62,94],"efficient":[11,45,66],"data":[12],"structures":[13,161],"which":[14,39,79],"allow":[15],"to":[16,103,118],"quickly":[17],"answer":[18],"arbitrary":[19],"conjunctive":[20],"queries":[21],"about":[22],"data.":[24],"The":[25],"key":[26],"limitation":[27],"of":[28,43,99,108,142],"such":[29,162],"techniques":[30],"is":[31,140],"their":[32],"memory":[33,106,121,136,147],"consumption.":[34],"Pre-post":[35],"code":[36,76],"trees":[37,77,87],"(PPC-trees)":[38],"are":[40,52,80,88,155],"basis":[42],"several":[44],"association":[46],"and":[47,59,91,113,151],"classification":[48],"algorithms,":[51],"only":[53],"constructed":[54],"as":[55,163],"an":[56],"intermediate":[57],"representation":[58],"subsequently":[60],"converted":[61,93],"a":[63,109],"much":[64],"more":[65,157],"N-lists":[67,154],"structure.":[68,180],"In":[69],"this":[70],"paper,":[71],"we":[72],"introduce":[73],"partial":[74,86],"pre-post":[75],"(P3C-trees),":[78],"based":[81],"idea":[84],"that":[85,134],"iteratively":[89],"constructed,":[90],"immediately":[92],"N-lists.":[95],"This":[96],"tight":[97],"integration":[98],"these":[100,116],"phases":[101],"allows":[102],"avoid":[104],"bottleneck":[107],"full":[110],"PPC-tree":[111],"construction,":[112],"thus":[114],"enables":[115],"tackle":[119],"scalability":[122],"problem":[123],"posed":[124],"by":[125,138,149],"large-scale":[126],"datasets.":[127],"Our":[128],"experiments":[129],"with":[130,177],"big":[131],"datasets":[132],"confirm":[133],"used":[137],"P3C-tree":[139,179],"orders":[141],"magnitude":[143],"smaller":[144],"than":[145,159],"consumed":[148],"PPC-tree,":[150],"generated":[153],"also":[156,172],"effective":[158],"alternative":[160],"Tidset":[164],"or":[165],"Diffset.":[166],"Moreover,":[167],"N-list":[169],"construction":[170],"can":[171],"be":[173],"considerably":[174],"sped":[175],"up":[176]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}