{"id":"https://openalex.org/W2169474320","doi":"https://doi.org/10.1109/ideas.2003.1214917","title":"Incremental mining of frequent patterns without candidate generation or support constraint","display_name":"Incremental mining of frequent patterns without candidate generation or support constraint","publication_year":2003,"publication_date":"2003-10-31","ids":{"openalex":"https://openalex.org/W2169474320","doi":"https://doi.org/10.1109/ideas.2003.1214917","mag":"2169474320"},"language":"en","primary_location":{"id":"doi:10.1109/ideas.2003.1214917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2003.1214917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seventh International Database Engineering and Applications Symposium, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043625671","display_name":"Wendy Cheung","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"W. Cheung","raw_affiliation_strings":["University of Alberta, Edmonton, Canada"],"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053745515","display_name":"Osmar R. Za\u0131\u0308ane","orcid":"https://orcid.org/0000-0002-0060-5988"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"O.R. Zaiane","raw_affiliation_strings":["University of Alberta, Edmonton, Canada"],"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043625671"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":25.2935,"has_fulltext":false,"cited_by_count":216,"citation_normalized_percentile":{"value":0.99367616,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":1.0,"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":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9908999800682068,"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.9871000051498413,"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.7957507967948914},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6335636973381042},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6226260662078857},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.574999213218689},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.42818599939346313},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2223285734653473},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2133246660232544},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10196414589881897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0810052752494812}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7957507967948914},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6335636973381042},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6226260662078857},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.574999213218689},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.42818599939346313},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2223285734653473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2133246660232544},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10196414589881897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0810052752494812},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ideas.2003.1214917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2003.1214917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seventh International Database Engineering and Applications Symposium, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W110175884","https://openalex.org/W1482810056","https://openalex.org/W1483679765","https://openalex.org/W1484413656","https://openalex.org/W1498871448","https://openalex.org/W1523293200","https://openalex.org/W1537336823","https://openalex.org/W1597161471","https://openalex.org/W1598051036","https://openalex.org/W1844682850","https://openalex.org/W1928996079","https://openalex.org/W1990800901","https://openalex.org/W2032226242","https://openalex.org/W2037965136","https://openalex.org/W2064853889","https://openalex.org/W2081980673","https://openalex.org/W2101491687","https://openalex.org/W2117423052","https://openalex.org/W2171612826","https://openalex.org/W2210278139","https://openalex.org/W2997709717","https://openalex.org/W4252403066","https://openalex.org/W6604443778","https://openalex.org/W6628750762","https://openalex.org/W6628905587","https://openalex.org/W6628973722","https://openalex.org/W6629658345","https://openalex.org/W6635733350","https://openalex.org/W6638864570","https://openalex.org/W6677701653","https://openalex.org/W7000244207"],"related_works":["https://openalex.org/W2093885745","https://openalex.org/W2351266481","https://openalex.org/W2132547887","https://openalex.org/W2071459461","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":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,55],"novel":[6],"data":[7],"structure":[8],"called":[9],"CATS":[10,12],"Tree.":[11],"Tree":[13],"extends":[14],"the":[15,46,50,59],"idea":[16],"of":[17,30,68],"FPTree":[18],"to":[19],"improve":[20],"storage":[21],"compression":[22],"and":[23],"allow":[24,52],"frequent":[25,38],"pattern":[26,39],"mining":[27,40,53],"without":[28,44],"generation":[29],"candidate":[31],"item":[32],"sets.":[33],"The":[34],"proposed":[35],"algorithms":[36,51],"enable":[37],"with":[41,54],"different":[42],"supports":[43],"rebuilding":[45],"tree":[47],"structure.":[48],"Furthermore,":[49],"single":[56],"pass":[57],"over":[58],"database":[60],"as":[61,63],"well":[62],"efficient":[64],"insertion":[65],"or":[66],"deletion":[67],"transactions":[69],"at":[70],"any":[71],"time.":[72]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":19}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}