{"id":"https://openalex.org/W1966758833","doi":"https://doi.org/10.1142/s0219649204000912","title":"A Scalable Vertical Model for Mining Association Rules","display_name":"A Scalable Vertical Model for Mining Association Rules","publication_year":2004,"publication_date":"2004-11-30","ids":{"openalex":"https://openalex.org/W1966758833","doi":"https://doi.org/10.1142/s0219649204000912","mag":"1966758833"},"language":"en","primary_location":{"id":"doi:10.1142/s0219649204000912","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219649204000912","pdf_url":null,"source":{"id":"https://openalex.org/S30163770","display_name":"Journal of Information & Knowledge Management","issn_l":"0219-6492","issn":["0219-6492","1793-6926"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information & Knowledge Management","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/A5088087251","display_name":"Imad Rahal","orcid":"https://orcid.org/0009-0004-3231-0115"},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Imad Rahal","raw_affiliation_strings":["Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA","Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA","institution_ids":["https://openalex.org/I57328836"]},{"raw_affiliation_string":"Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA","institution_ids":["https://openalex.org/I57328836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110274828","display_name":"Dongmei Ren","orcid":null},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dongmei Ren","raw_affiliation_strings":["Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA","Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA","institution_ids":["https://openalex.org/I57328836"]},{"raw_affiliation_string":"Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA","institution_ids":["https://openalex.org/I57328836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007656388","display_name":"William Perrizo","orcid":null},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William Perrizo","raw_affiliation_strings":["Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA","Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA","institution_ids":["https://openalex.org/I57328836"]},{"raw_affiliation_string":"Department of Computer Science and Operations Research, North Dakota State University, Fargo, North Dakota, USA","institution_ids":["https://openalex.org/I57328836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088087251"],"corresponding_institution_ids":["https://openalex.org/I57328836"],"apc_list":null,"apc_paid":null,"fwci":3.9454,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.93722824,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"03","issue":"04","first_page":"317","last_page":"329"},"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.9994999766349792,"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.9994999766349792,"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.9606999754905701,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/association-rule-learning","display_name":"Association rule learning","score":0.839377760887146},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7627874612808228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7615985870361328},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.7522038817405701},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7108694314956665},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6061173677444458},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5410633683204651},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48737722635269165},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4714157283306122},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.41279736161231995},{"id":"https://openalex.org/keywords/big-data","display_name":"Big data","score":0.4101073741912842},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.16369569301605225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14092472195625305}],"concepts":[{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.839377760887146},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7627874612808228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7615985870361328},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.7522038817405701},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7108694314956665},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6061173677444458},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5410633683204651},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48737722635269165},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4714157283306122},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41279736161231995},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.4101073741912842},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.16369569301605225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14092472195625305},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0219649204000912","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219649204000912","pdf_url":null,"source":{"id":"https://openalex.org/S30163770","display_name":"Journal of Information & Knowledge Management","issn_l":"0219-6492","issn":["0219-6492","1793-6926"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information & Knowledge Management","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:jikmxx:v:03:y:2004:i:04:n:s0219649204000912","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0219649204000912","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W203981526","https://openalex.org/W1483679765","https://openalex.org/W1484413656","https://openalex.org/W1542978828","https://openalex.org/W1593058185","https://openalex.org/W1602406308","https://openalex.org/W1996249351","https://openalex.org/W2001628108","https://openalex.org/W2021284998","https://openalex.org/W2053727994","https://openalex.org/W2061681234","https://openalex.org/W2064853889","https://openalex.org/W2138745909","https://openalex.org/W2140481308","https://openalex.org/W2142517503","https://openalex.org/W2155512447","https://openalex.org/W2157979971","https://openalex.org/W2166559705","https://openalex.org/W2970576388","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W4300125793","https://openalex.org/W2578985712","https://openalex.org/W2406961474","https://openalex.org/W2143566611","https://openalex.org/W2013740965","https://openalex.org/W588267724","https://openalex.org/W4297743441","https://openalex.org/W2782899930","https://openalex.org/W931334744"],"abstract_inverted_index":{"Association":[0],"rule":[1],"mining":[2,29,56,134],"(ARM)":[3],"is":[4,138],"the":[5,61,65,95,141,183],"data-mining":[6],"process":[7],"for":[8,130,144,159,170],"finding":[9],"all":[10,30,57,82],"association":[11],"rules":[12,45],"in":[13,49,182],"datasets":[14,111,114,175],"matching":[15],"user-defined":[16],"measures":[17],"of":[18,71,83,91,97,102,120],"interest":[19],"such":[20],"as":[21],"support":[22,72],"and":[23,133,146,154],"confidence.":[24],"Usually,":[25],"ARM":[26,98],"proceeds":[27],"by":[28,63],"frequent":[31,58,80,135],"itemsets":[32,59,136],"\u2014":[33,42],"a":[34,50,116,127],"step":[35],"known":[36],"to":[37,178],"be":[38,79],"very":[39,109,117],"computationally":[40],"intensive":[41],"from":[43],"which":[44,73],"are":[46,86],"then":[47],"derived":[48],"straight":[51],"forward":[52],"manner.":[53],"In":[54,122],"general,":[55],"prunes":[60],"space":[62],"using":[64],"downward":[66],"closure":[67],"(or":[68],"anti-monotonicity)":[69],"property":[70],"states":[74],"that":[75,137],"no":[76],"itemset":[77,161],"can":[78],"unless":[81],"its":[84],"subsets":[85],"frequent.":[87],"A":[88],"large":[89,110,118,174],"number":[90,119],"papers":[92],"have":[93,104],"addressed":[94],"problem":[96],"but":[99],"not":[100],"many":[101],"them":[103],"focused":[105],"on":[106,140,155],"scalability":[107],"over":[108,150,173],"(i.e.":[112],"when":[113,176],"contain":[115],"transactions).":[121],"this":[123],"paper,":[124],"we":[125],"propose":[126],"new":[128],"model":[129],"representing":[131],"data":[132,153],"based":[139],"P-tree":[142],"technology":[143],"compression":[145],"faster":[147],"logical":[148],"operations":[149],"vertically":[151],"structured":[152],"set":[156],"enumeration":[157],"trees":[158],"fast":[160],"enumeration.":[162],"Experimental":[163],"results":[164],"presented":[165],"hereinafter":[166],"show":[167],"big":[168],"improvements":[169],"our":[171],"approach":[172],"compared":[177],"other":[179],"contemporary":[180],"approaches":[181],"literature.":[184]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}