{"id":"https://openalex.org/W1483147298","doi":"https://doi.org/10.1109/icde.2015.7113357","title":"Towards a parameter-free and parallel itemset mining algorithm in linearithmic time","display_name":"Towards a parameter-free and parallel itemset mining algorithm in linearithmic time","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1483147298","doi":"https://doi.org/10.1109/icde.2015.7113357","mag":"1483147298"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2015.7113357","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2015.7113357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 31st International Conference on Data Engineering","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/A5068014041","display_name":"Gregory Buehrer","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Gregory Buehrer","raw_affiliation_strings":["Microsoft","Microsoft , USA "],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft , USA ","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073181393","display_name":"Roberto L. de Oliveira","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134014","display_name":"Hospital das Cl\u00ednicas da Universidade Federal de Minas Gerais","ror":"https://ror.org/035rpst33","country_code":"BR","type":"healthcare","lineage":["https://openalex.org/I4210134014"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Roberto L. de Oliveira","raw_affiliation_strings":["UFMG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UFMG, Brazil","institution_ids":["https://openalex.org/I4210134014"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050281959","display_name":"David Fuhry","orcid":"https://orcid.org/0000-0002-9573-1169"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Fuhry","raw_affiliation_strings":["The Ohio State University","The Ohio State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100755351","display_name":"Srinivasan Parthasarathy","orcid":"https://orcid.org/0000-0002-6062-6449"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivasan Parthasarathy","raw_affiliation_strings":["The Ohio State University","The Ohio State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0632,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.9381266,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"7","issue":null,"first_page":"1071","last_page":"1082"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9900000095367432,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9897000193595886,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7914867997169495},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7363495230674744},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6117346882820129},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.538422703742981},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44495314359664917},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4364500939846039},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4323519468307495},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3596336245536804},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1259148120880127},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.08209356665611267}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7914867997169495},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7363495230674744},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6117346882820129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.538422703742981},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44495314359664917},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4364500939846039},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4323519468307495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3596336245536804},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1259148120880127},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08209356665611267},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.2015.7113357","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2015.7113357","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 31st International Conference on Data Engineering","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":62,"referenced_works":["https://openalex.org/W139562302","https://openalex.org/W1483679765","https://openalex.org/W1501399373","https://openalex.org/W1537336823","https://openalex.org/W1561092886","https://openalex.org/W1881219236","https://openalex.org/W1972221303","https://openalex.org/W1978583881","https://openalex.org/W1990071908","https://openalex.org/W1994704968","https://openalex.org/W1994727615","https://openalex.org/W2000273502","https://openalex.org/W2019827052","https://openalex.org/W2026413985","https://openalex.org/W2030766291","https://openalex.org/W2061433096","https://openalex.org/W2064853889","https://openalex.org/W2065179797","https://openalex.org/W2069980026","https://openalex.org/W2070378998","https://openalex.org/W2074465184","https://openalex.org/W2081193615","https://openalex.org/W2086325844","https://openalex.org/W2099019567","https://openalex.org/W2105956439","https://openalex.org/W2108560469","https://openalex.org/W2110893883","https://openalex.org/W2115364986","https://openalex.org/W2116029313","https://openalex.org/W2122303450","https://openalex.org/W2124066753","https://openalex.org/W2132069633","https://openalex.org/W2132991500","https://openalex.org/W2133034393","https://openalex.org/W2138732923","https://openalex.org/W2143182259","https://openalex.org/W2144600411","https://openalex.org/W2146043654","https://openalex.org/W2148043549","https://openalex.org/W2150718242","https://openalex.org/W2151979140","https://openalex.org/W2154642793","https://openalex.org/W2158454296","https://openalex.org/W2166559705","https://openalex.org/W2170726034","https://openalex.org/W2171612826","https://openalex.org/W2404544143","https://openalex.org/W2497849059","https://openalex.org/W2964070196","https://openalex.org/W2998574808","https://openalex.org/W3000055361","https://openalex.org/W4206760206","https://openalex.org/W4231101924","https://openalex.org/W4243764894","https://openalex.org/W4252115301","https://openalex.org/W4252403066","https://openalex.org/W6628973722","https://openalex.org/W6666595643","https://openalex.org/W6680661964","https://openalex.org/W6681416973","https://openalex.org/W6682837551","https://openalex.org/W6685146747"],"related_works":["https://openalex.org/W2389214306","https://openalex.org/W2373300491","https://openalex.org/W4235240664","https://openalex.org/W2965083567","https://openalex.org/W2378744544","https://openalex.org/W2594301978","https://openalex.org/W1838576100","https://openalex.org/W2095886385","https://openalex.org/W2295196644","https://openalex.org/W1598028160"],"abstract_inverted_index":{"Extracting":[0],"interesting":[1],"patterns":[2,200],"from":[3],"large":[4,66,180],"data":[5,17,67,163,181,191],"stores":[6],"efficiently":[7],"is":[8,79,153,172],"a":[9,27,36,85,89,94,103,129,169,188,215],"challenging":[10],"problem":[11,78],"in":[12,51,57,74,204],"many":[13,47],"domains.":[14],"In":[15],"the":[16,52,58,77,115,122,125,143,154,162,196],"mining":[18,134],"literature,":[19,53],"pattern":[20,49],"frequency":[21],"has":[22,32],"often":[23],"been":[24,33],"touted":[25],"as":[26,35,70,132],"proxy":[28],"for":[29],"interestingness":[30],"and":[31,176,193],"leveraged":[34],"pruning":[37],"criteria":[38],"to":[39,82,97,128,149,160,174,178,227],"realize":[40,214],"scalable":[41],"solutions.":[42],"However,":[43],"while":[44],"there":[45],"exist":[46],"frequent":[48],"algorithms":[50,135],"all":[54],"scale":[55],"exponentially":[56],"worst":[59],"case,":[60],"restricting":[61],"their":[62],"utility":[63,186,203],"on":[64,156,187],"very":[65,80,179],"sets.":[68,182],"Furthermore,":[69],"we":[71,101,137,213],"theoretically":[72],"argue":[73],"this":[75,98,150],"article,":[76],"hard":[81],"approximate":[83],"within":[84],"reasonable":[86],"factor,":[87],"with":[88,114],"polynomial":[90],"time":[91,207],"algorithm.":[92],"As":[93],"counter":[95],"point":[96],"theoretical":[99],"result,":[100],"present":[102],"practical":[104],"algorithm":[105,197],"called":[106],"Localized":[107],"Approximate":[108],"Miner":[109],"(LAM)":[110],"that":[111,195,221],"scales":[112,177],"linearithmically":[113],"input":[116],"data.":[117],"Instead":[118],"of":[119,124,142,168,190,201,219],"fully":[120],"exploring":[121],"top":[123],"search":[126],"lattice":[127],"user-defined":[130],"point,":[131],"traditional":[133],"do,":[136],"instead":[138],"explore":[139],"different":[140],"parts":[141],"complete":[144],"lattice,":[145],"efficiently.":[146],"The":[147],"key":[148],"efficient":[151],"exploration":[152],"reliance":[155],"min-wise":[157],"independent":[158],"permutations":[159],"collect":[161],"into":[164],"highly":[165],"similar":[166],"subsets":[167],"partition.":[170],"It":[171],"straightforward":[173],"implement":[175],"We":[183],"illustrate":[184],"its":[185],"range":[189],"sets,":[192],"demonstrate":[194],"finds":[198],"more":[199],"higher":[202],"much":[205],"less":[206],"than":[208],"several":[209],"state-of-the-art":[210],"algorithms.":[211],"Moreover,":[212],"natural":[216],"multi-level":[217],"parallelization":[218],"LAM":[220],"further":[222],"reduces":[223],"runtimes":[224],"by":[225],"up":[226],"193-fold":[228],"when":[229],"leveraging":[230],"256":[231],"CMP":[232],"cores":[233],"spanning":[234],"32":[235],"machines.":[236]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}