{"id":"https://openalex.org/W2165758082","doi":"https://doi.org/10.1109/icdm.2002.1183996","title":"From path tree to frequent patterns: a framework for mining frequent patterns","display_name":"From path tree to frequent patterns: a framework for mining frequent patterns","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2165758082","doi":"https://doi.org/10.1109/icdm.2002.1183996","mag":"2165758082"},"language":"en","primary_location":{"id":"doi:10.1109/icdm.2002.1183996","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2002.1183996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2002 IEEE International Conference on Data Mining, 2002. 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/A5100294847","display_name":"Yabo Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Yabo Xu","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075642293","display_name":"Jeffrey Xu Yu","orcid":"https://orcid.org/0000-0002-9738-827X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"J.X. Yu","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081085461","display_name":"Guimei Liu","orcid":"https://orcid.org/0000-0001-8992-6771"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Guimei Liu","raw_affiliation_strings":["Hong Kong University of Science and Technology, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Hong Kong, China","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103551313","display_name":"Hongjun L\u00fc","orcid":null},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Hongjun Lu","raw_affiliation_strings":["Hong Kong University of Science and Technology, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Hong Kong, China","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100294847"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":8.0047,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.97143625,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"61","issue":null,"first_page":"514","last_page":"521"},"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.9997000098228455,"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.9997000098228455,"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.9962999820709229,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9789000153541565,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.8939690589904785},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.8162339329719543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7567998170852661},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.710395872592926},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5812747478485107},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5802642107009888},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.5695872902870178},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5237274765968323},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.43720439076423645},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.43337929248809814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3996322453022003},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.39558422565460205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34335052967071533},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34334754943847656},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.19278693199157715},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17870059609413147},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08581212162971497},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07484796643257141}],"concepts":[{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.8939690589904785},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.8162339329719543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7567998170852661},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.710395872592926},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5812747478485107},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5802642107009888},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.5695872902870178},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5237274765968323},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.43720439076423645},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.43337929248809814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3996322453022003},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.39558422565460205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34335052967071533},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34334754943847656},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.19278693199157715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17870059609413147},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08581212162971497},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07484796643257141},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icdm.2002.1183996","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2002.1183996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2002 IEEE International Conference on Data Mining, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.111.9378","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.9378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sfu.ca/~yxu/personal/papers/ICDM02Xu.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1482810056","https://openalex.org/W1484413656","https://openalex.org/W1498871448","https://openalex.org/W1984606279","https://openalex.org/W1996249351","https://openalex.org/W2032226242","https://openalex.org/W2059837064","https://openalex.org/W2064853889","https://openalex.org/W2069356553","https://openalex.org/W2099404336","https://openalex.org/W2108560469","https://openalex.org/W2141115288","https://openalex.org/W4249787843","https://openalex.org/W4252403066","https://openalex.org/W6628750762","https://openalex.org/W6629658345","https://openalex.org/W6667852938"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W4244673516","https://openalex.org/W2061004850","https://openalex.org/W2370594968","https://openalex.org/W1988981363","https://openalex.org/W2501849745","https://openalex.org/W3109340025","https://openalex.org/W2142350709","https://openalex.org/W2036980550","https://openalex.org/W2165758082"],"abstract_inverted_index":{"We":[0,105],"propose":[1],"a":[2,18,26,31,69,94],"framework":[3,16],"for":[4],"mining":[5],"frequent":[6,72],"patterns":[7],"from":[8],"large":[9],"transactional":[10],"databases.":[11],"The":[12,35,55,84],"core":[13],"of":[14,100],"the":[15,65,101,111,127],"is":[17,39,51,59,78,122],"coded":[19],"prefix-path":[20,28,33,37,57,67,86,96,115],"tree":[21,29,38,58,87,97,116],"with":[22,98],"two":[23],"representations,":[24],"namely,":[25],"memory-based":[27,56,66,85],"and":[30,50,61],"disk-based":[32,36,95,114],"tree.":[34],"simple":[40,60],"in":[41,47,53],"its":[42],"data":[43],"structure":[44],"yet":[45],"rich":[46],"information":[48],"contained,":[49],"small":[52],"size.":[54],"compact.":[62],"Based":[63],"on":[64,91],"tree,":[68],"new":[70,102],"depth-first":[71],"pattern":[73],"discovery":[74],"algorithm,":[75],"called":[76],"PP-Mine,":[77],"proposed":[79],"that":[80],"outperforms":[81],"FP-growth":[82],"significantly.":[83],"can":[88],"be":[89],"stored":[90],"disk":[92],"using":[93],"assistance":[99],"coding":[103],"scheme.":[104],"present":[106],"loading":[107,128],"algorithms":[108],"to":[109,123],"load":[110],"minimal":[112],"required":[113],"into":[117,126],"main":[118],"memory.":[119],"Our":[120],"technique":[121],"push":[124],"constraints":[125],"process,":[129],"which":[130],"has":[131],"not":[132],"been":[133],"well":[134],"studied":[135],"yet.":[136]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}