{"id":"https://openalex.org/W3169937661","doi":"https://doi.org/10.1186/s40537-021-00473-3","title":"A scalable association rule learning heuristic for large datasets","display_name":"A scalable association rule learning heuristic for large datasets","publication_year":2021,"publication_date":"2021-06-09","ids":{"openalex":"https://openalex.org/W3169937661","doi":"https://doi.org/10.1186/s40537-021-00473-3","mag":"3169937661"},"language":"en","primary_location":{"id":"doi:10.1186/s40537-021-00473-3","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s40537-021-00473-3","pdf_url":"https://journalofbigdata.springeropen.com/track/pdf/10.1186/s40537-021-00473-3","source":{"id":"https://openalex.org/S2737955091","display_name":"Journal Of Big Data","issn_l":"2196-1115","issn":["2196-1115"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Big Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://journalofbigdata.springeropen.com/track/pdf/10.1186/s40537-021-00473-3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048458635","display_name":"Haosong Li","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haosong Li","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Irvine, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076927567","display_name":"Phillip C.\u2010Y. Sheu","orcid":"https://orcid.org/0000-0003-2036-850X"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Phillip C.-Y. Sheu","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Irvine, USA"],"raw_orcid":"https://orcid.org/0000-0003-2036-850X","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076927567"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":{"value":1990,"currency":"USD","value_usd":1990},"apc_paid":{"value":1990,"currency":"USD","value_usd":1990},"fwci":6.4979,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.965553,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"8","issue":"1","first_page":null,"last_page":null},"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.9976999759674072,"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.9976999759674072,"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/T11652","display_name":"Imbalanced Data Classification Techniques","score":0.9538000226020813,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.909600019454956,"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/computer-science","display_name":"Computer science","score":0.8714593648910522},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.8235124349594116},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7812380790710449},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7400881052017212},{"id":"https://openalex.org/keywords/association-rule-learning","display_name":"Association rule learning","score":0.6732258796691895},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5271784067153931},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.523855447769165},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5074760317802429},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47318506240844727},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.45986151695251465},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4026600122451782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2909204959869385},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1431545913219452}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8714593648910522},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8235124349594116},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7812380790710449},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7400881052017212},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.6732258796691895},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5271784067153931},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.523855447769165},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5074760317802429},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47318506240844727},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.45986151695251465},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4026600122451782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2909204959869385},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1431545913219452},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1186/s40537-021-00473-3","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s40537-021-00473-3","pdf_url":"https://journalofbigdata.springeropen.com/track/pdf/10.1186/s40537-021-00473-3","source":{"id":"https://openalex.org/S2737955091","display_name":"Journal Of Big Data","issn_l":"2196-1115","issn":["2196-1115"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Big Data","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:395141f816424953b1f91a80d6a7c99f","is_oa":true,"landing_page_url":"https://doaj.org/article/395141f816424953b1f91a80d6a7c99f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Big Data, Vol 8, Iss 1, Pp 1-32 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1186/s40537-021-00473-3","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s40537-021-00473-3","pdf_url":"https://journalofbigdata.springeropen.com/track/pdf/10.1186/s40537-021-00473-3","source":{"id":"https://openalex.org/S2737955091","display_name":"Journal Of Big Data","issn_l":"2196-1115","issn":["2196-1115"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Big Data","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3169937661.pdf","grobid_xml":"https://content.openalex.org/works/W3169937661.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W574900904","https://openalex.org/W1484413656","https://openalex.org/W1605711022","https://openalex.org/W1910515323","https://openalex.org/W1992540139","https://openalex.org/W1999993900","https://openalex.org/W2004951603","https://openalex.org/W2030243011","https://openalex.org/W2030969394","https://openalex.org/W2032226242","https://openalex.org/W2034589438","https://openalex.org/W2064853889","https://openalex.org/W2070232376","https://openalex.org/W2099404336","https://openalex.org/W2107005225","https://openalex.org/W2122950928","https://openalex.org/W2127120461","https://openalex.org/W2130822890","https://openalex.org/W2139655910","https://openalex.org/W2140838268","https://openalex.org/W2161455936","https://openalex.org/W2166559705","https://openalex.org/W2205596196","https://openalex.org/W2474038722","https://openalex.org/W2507635762","https://openalex.org/W2540572269","https://openalex.org/W2765102830","https://openalex.org/W2790689470","https://openalex.org/W2963038743","https://openalex.org/W2998574808","https://openalex.org/W4239339490","https://openalex.org/W4247210760","https://openalex.org/W4248966671","https://openalex.org/W4388333893"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2908130256","https://openalex.org/W2528452804","https://openalex.org/W961142965","https://openalex.org/W18819324"],"abstract_inverted_index":{"Abstract":[0],"Many":[1],"algorithms":[2,16],"have":[3],"proposed":[4,90],"to":[5,47,71,78],"solve":[6],"the":[7,19,34,39,65,79,89],"association":[8],"rule":[9],"learning":[10],"problem.":[11],"However,":[12],"most":[13],"of":[14,21,25],"these":[15],"suffer":[17],"from":[18,85],"problem":[20],"scalability":[22],"either":[23],"because":[24],"tremendous":[26],"time":[27,66],"complexity":[28,67],"or":[29],"memory":[30,69],"usage,":[31],"especially":[32],"when":[33],"dataset":[35],"is":[36,45,83],"large":[37],"and":[38,68],"minimum":[40],"support":[41],"(":[42],"minsup":[43],")":[44],"set":[46],"a":[48,54],"lower":[49],"number.":[50],"This":[51],"paper":[52],"introduces":[53],"heuristic":[55,91],"approach":[56,92],"based":[57],"on":[58],"divide-and-conquer":[59],"which":[60],"may":[61],"exponentially":[62],"reduce":[63],"both":[64],"usage":[70],"obtain":[72],"approximate":[73],"results":[74],"that":[75,88],"are":[76],"close":[77],"accurate":[80],"results.":[81],"It":[82],"shown":[84],"comparative":[86],"experiments":[87],"can":[93],"achieve":[94],"significant":[95],"speedup":[96],"over":[97],"existing":[98],"algorithms.":[99]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}