{"id":"https://openalex.org/W2159293599","doi":"https://doi.org/10.1109/tkde.2005.30","title":"Mining closed and maximal frequent subtrees from databases of labeled rooted trees","display_name":"Mining closed and maximal frequent subtrees from databases of labeled rooted trees","publication_year":2005,"publication_date":"2005-01-12","ids":{"openalex":"https://openalex.org/W2159293599","doi":"https://doi.org/10.1109/tkde.2005.30","mag":"2159293599"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2005.30","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2005.30","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-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/A5075969864","display_name":"Y\u00fcn Chi","orcid":"https://orcid.org/0000-0002-8441-3974"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yun Chi","raw_affiliation_strings":["Department of Computer Science, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013754313","display_name":"Yi Xia","orcid":"https://orcid.org/0000-0002-2485-4188"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi Xia","raw_affiliation_strings":["Department of Computer Science, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109444205","display_name":"Yirong Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yirong Yang","raw_affiliation_strings":["Department of Computer Science, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113699788","display_name":"Richard R. Muntz","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R.R. Muntz","raw_affiliation_strings":["Department of Computer Science, University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":29.6803,"has_fulltext":false,"cited_by_count":130,"citation_normalized_percentile":{"value":0.99501391,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"17","issue":"2","first_page":"190","last_page":"202"},"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.9998000264167786,"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.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9901000261306763,"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/enumeration","display_name":"Enumeration","score":0.7864769697189331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7123738527297974},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6251626014709473},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.6009958982467651},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5326119661331177},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.43112266063690186},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4311205744743347},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4217557907104492},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3574613034725189},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3373793959617615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30367958545684814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.289301335811615},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.28057730197906494},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16246384382247925},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13798752427101135}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7864769697189331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7123738527297974},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6251626014709473},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.6009958982467651},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5326119661331177},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.43112266063690186},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4311205744743347},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4217557907104492},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3574613034725189},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3373793959617615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30367958545684814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.289301335811615},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28057730197906494},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16246384382247925},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13798752427101135}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tkde.2005.30","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2005.30","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.138.3872","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.3872","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pages.cpsc.ucalgary.ca/~alhajj/771/more-paper/mine-closed-maximal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.189","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://cs.ucla.edu/tech-report/2004-reports/040020.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.6441","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.6441","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucla.edu/~ychi/./publication/cmtree.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.9112","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.9112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nec-labs.com/~ychi/./publication/cmtree_tkde05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1521063","https://openalex.org/W56896489","https://openalex.org/W1514542003","https://openalex.org/W1520566981","https://openalex.org/W1535208542","https://openalex.org/W1536540269","https://openalex.org/W1581082785","https://openalex.org/W1585646276","https://openalex.org/W1602595918","https://openalex.org/W1641039719","https://openalex.org/W1641749581","https://openalex.org/W1655990431","https://openalex.org/W1882453461","https://openalex.org/W1997276658","https://openalex.org/W2009758120","https://openalex.org/W2011039300","https://openalex.org/W2030766291","https://openalex.org/W2041140023","https://openalex.org/W2047715328","https://openalex.org/W2050137450","https://openalex.org/W2064853889","https://openalex.org/W2070046067","https://openalex.org/W2078069942","https://openalex.org/W2099733342","https://openalex.org/W2100588761","https://openalex.org/W2108150886","https://openalex.org/W2118349699","https://openalex.org/W2122303450","https://openalex.org/W2125221018","https://openalex.org/W2136593687","https://openalex.org/W2138223311","https://openalex.org/W2138745909","https://openalex.org/W2140158493","https://openalex.org/W2144903778","https://openalex.org/W2147924997","https://openalex.org/W2153184876","https://openalex.org/W2156026066","https://openalex.org/W2170089709","https://openalex.org/W2170726034","https://openalex.org/W4231101924","https://openalex.org/W4236918833","https://openalex.org/W4246657383","https://openalex.org/W4252403066","https://openalex.org/W4285719527","https://openalex.org/W6602327473","https://openalex.org/W6675049423"],"related_works":["https://openalex.org/W2782899930","https://openalex.org/W931334744","https://openalex.org/W2227684440","https://openalex.org/W2156833871","https://openalex.org/W2174962524","https://openalex.org/W1521720839","https://openalex.org/W2092152400","https://openalex.org/W2160311168","https://openalex.org/W2083751087","https://openalex.org/W2150988524"],"abstract_inverted_index":{"Tree":[0],"structures":[1],"are":[2,119,141],"used":[3,142],"extensively":[4],"in":[5,23,80,190],"domains":[6],"such":[7],"as":[8,156,158],"computational":[9],"biology,":[10],"pattern":[11],"recognition,":[12],"XML":[13],"databases,":[14],"computer":[15],"networks,":[16],"and":[17,76,102,174,195,200],"so":[18,149],"on.":[19],"One":[20],"important":[21],"problem":[22],"mining":[24,55],"databases":[25],"of":[26,35,41,50,83,125,147,164],"trees":[27,90],"is":[28,154,187],"to":[29,121,133,143],"find":[30],"frequently":[31],"occurring":[32],"subtrees.":[33,116,138,203],"Because":[34],"the":[36,39,48,88,123,126,145,162,192],"combinatorial":[37],"explosion,":[38],"number":[40],"frequent":[42,51,57,78,104,115,137,202],"subtrees":[43,52,58,79,105],"usually":[44],"grows":[45],"exponentially":[46],"with":[47],"size":[49],"and,":[53],"therefore,":[54],"all":[56,114,198],"becomes":[59],"infeasible":[60],"for":[61],"large":[62],"tree":[63,110,128],"sizes.":[64],"We":[65,160],"present":[66],"CMTreeMiner,":[67],"a":[68,81],"computationally":[69],"efficient":[70,189],"algorithm":[71,98,166,186],"that":[72,111,129,150,184],"discovers":[73,197],"only":[74],"closed":[75,101,134,199],"maximal":[77,103,136,201],"database":[82],"labeled":[84],"rooted":[85,89],"trees,":[86],"where":[87],"can":[91],"be":[92],"either":[93],"ordered":[94],"or":[95,135],"unordered.":[96],"The":[97,180],"mines":[99],"both":[100,171],"by":[106],"traversing":[107],"an":[108],"enumeration":[109,127],"systematically":[112],"enumerates":[113],"Several":[117],"techniques":[118,140],"proposed":[120],"prune":[122],"branches":[124],"do":[130],"not":[131],"correspond":[132],"Heuristic":[139],"arrange":[144],"order":[146],"computation":[148,153],"relatively":[151],"expensive":[152],"avoided":[155],"much":[157],"possible.":[159],"study":[161],"performance":[163],"our":[165,185],"through":[167],"extensive":[168],"experiments,":[169],"using":[170],"synthetic":[172],"data":[173,175],"sets":[176],"from":[177],"real":[178],"applications.":[179],"experimental":[181],"results":[182],"show":[183],"very":[188],"reducing":[191],"search":[193],"space":[194],"quickly":[196]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":10}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}