{"id":"https://openalex.org/W2619891821","doi":"https://doi.org/10.1145/3079079.3079084","title":"Frequent subtree mining on the automata processor","display_name":"Frequent subtree mining on the automata processor","publication_year":2017,"publication_date":"2017-05-31","ids":{"openalex":"https://openalex.org/W2619891821","doi":"https://doi.org/10.1145/3079079.3079084","mag":"2619891821"},"language":"en","primary_location":{"id":"doi:10.1145/3079079.3079084","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3079079.3079084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Supercomputing","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/A5014717235","display_name":"Elaheh Sadredini","orcid":"https://orcid.org/0000-0002-5834-4346"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Elaheh Sadredini","raw_affiliation_strings":["University of Virginia"],"affiliations":[{"raw_affiliation_string":"University of Virginia","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020409722","display_name":"Reza Rahimi","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Reza Rahimi","raw_affiliation_strings":["University of Virginia"],"affiliations":[{"raw_affiliation_string":"University of Virginia","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100360109","display_name":"Ke Wang","orcid":"https://orcid.org/0000-0002-1956-5031"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ke Wang","raw_affiliation_strings":["University of Virginia"],"affiliations":[{"raw_affiliation_string":"University of Virginia","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074818897","display_name":"Kevin Skadron","orcid":"https://orcid.org/0000-0002-8091-9302"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin Skadron","raw_affiliation_strings":["University of Virginia"],"affiliations":[{"raw_affiliation_string":"University of Virginia","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5014717235"],"corresponding_institution_ids":["https://openalex.org/I51556381"],"apc_list":null,"apc_paid":null,"fwci":2.9291,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.92463388,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9952999949455261,"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/speedup","display_name":"Speedup","score":0.889916181564331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8506914377212524},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.8100635409355164},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.8085654973983765},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5514959096908569},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5250280499458313},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49173763394355774},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4813311994075775},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4741498827934265},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.337091863155365},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09100893139839172},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08506312966346741}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.889916181564331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8506914377212524},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8100635409355164},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.8085654973983765},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5514959096908569},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5250280499458313},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49173763394355774},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4813311994075775},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4741498827934265},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.337091863155365},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09100893139839172},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08506312966346741},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3079079.3079084","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3079079.3079084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Supercomputing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1521294226","https://openalex.org/W1536540269","https://openalex.org/W1540366223","https://openalex.org/W1743243001","https://openalex.org/W2012537185","https://openalex.org/W2015977145","https://openalex.org/W2030766291","https://openalex.org/W2062949766","https://openalex.org/W2068395804","https://openalex.org/W2099962227","https://openalex.org/W2133378824","https://openalex.org/W2416036494","https://openalex.org/W2478089729","https://openalex.org/W2529090470","https://openalex.org/W2577639611","https://openalex.org/W2584402701"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W3138386522","https://openalex.org/W2499279132","https://openalex.org/W2295196644","https://openalex.org/W4285312748","https://openalex.org/W3203767529","https://openalex.org/W2610542549"],"abstract_inverted_index":{"Frequency":[0],"counting":[1],"of":[2,20,82,94],"complex":[3],"patterns":[4,23],"such":[5],"as":[6,17],"subtrees":[7],"is":[8,27],"more":[9],"challenging":[10,148],"than":[11,30],"for":[12,49,156],"simple":[13],"itemsets":[14],"and":[15,46,61,103,112,121,138],"sequences,":[16],"the":[18,55,73,79,92,161,173],"number":[19],"possible":[21],"candidate":[22],"in":[24,98],"a":[25,44,59,68,95,110,118,127,134,147,153,169],"tree":[26],"much":[28],"higher":[29,36],"one-dimensional":[31],"data":[32],"structures,":[33],"with":[34,108,133,178],"dramatically":[35],"processing":[37],"times.":[38],"In":[39],"this":[40],"paper,":[41],"we":[42,125],"propose":[43,126],"new":[45,60],"scalable":[47,123],"solution":[48],"frequent":[50],"subtree":[51],"mining":[52],"(FTM)":[53],"on":[54,72,100,146,168],"Automata":[56],"Processor":[57],"(AP),":[58],"highly":[62],"parallel":[63],"accelerator":[64],"architecture.":[65],"We":[66,150],"present":[67],"multi-stage":[69],"pruning":[70],"framework":[71],"AP,":[74],"called":[75],"AP-FTM,":[76],"to":[77,88,130,141],"reduce":[78],"search":[80],"space":[81],"FTM":[83],"candidates.":[84],"This":[85],"achieves":[86],"up":[87,140],"353X":[89],"speedup":[90,143],"at":[91],"cost":[93],"small":[96],"reduction":[97],"accuracy,":[99],"four":[101],"real-world":[102],"synthetic":[104,170],"datasets,":[105],"when":[106],"compared":[107],"PatternMatcher,":[109],"practical":[111],"exact":[113],"CPU":[114,135],"solution.":[115],"To":[116],"provide":[117],"fully":[119],"accurate":[120],"still":[122],"solution,":[124],"hybrid":[128],"method":[129],"combine":[131],"AP-FTM":[132],"exact-matching":[136],"approach,":[137],"achieve":[139],"262X":[142],"over":[144],"PatternMatcher":[145],"database.":[149],"also":[151,163],"develop":[152],"GPU":[154],"algorithm":[155],"FTM,":[157],"but":[158],"show":[159,172],"that":[160],"AP":[162,174],"outperforms":[164],"this.":[165],"The":[166],"results":[167],"database":[171],"advantage":[175],"grows":[176],"further":[177],"larger":[179],"datasets.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}