{"id":"https://openalex.org/W2055751480","doi":"https://doi.org/10.1142/s0219649205001249","title":"An Efficient Approach for Candidate Set Generation","display_name":"An Efficient Approach for Candidate Set Generation","publication_year":2005,"publication_date":"2005-11-18","ids":{"openalex":"https://openalex.org/W2055751480","doi":"https://doi.org/10.1142/s0219649205001249","mag":"2055751480"},"language":"en","primary_location":{"id":"doi:10.1142/s0219649205001249","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219649205001249","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 &amp; 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/A5013572921","display_name":"Nawar Malhis","orcid":"https://orcid.org/0000-0002-1317-833X"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nawar Malhis","raw_affiliation_strings":["Department of Computer Science, Kent State University, Kent, OH 44240, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent State University, Kent, OH 44240, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045127707","display_name":"Arden Ruttan","orcid":"https://orcid.org/0000-0002-3422-3902"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arden Ruttan","raw_affiliation_strings":["Department of Computer Science, Kent State University, Kent, OH 44240, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent State University, Kent, OH 44240, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079246454","display_name":"Hazem H. Refai","orcid":"https://orcid.org/0000-0001-9137-9594"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]},{"id":"https://openalex.org/I87208437","display_name":"University of Tulsa","ror":"https://ror.org/04wn28048","country_code":"US","type":"education","lineage":["https://openalex.org/I87208437"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hazem H. Refai","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Oklahoma, Tulsa, OK 74135, USA","Department of Electrical and Computer Engineering, University of Oklahoma, Tulsa, OK, 74135, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Oklahoma, Tulsa, OK 74135, USA","institution_ids":["https://openalex.org/I87208437","https://openalex.org/I8692664"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Oklahoma, Tulsa, OK, 74135, USA","institution_ids":["https://openalex.org/I87208437","https://openalex.org/I8692664"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013572921"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":null,"apc_paid":null,"fwci":0.8482,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.85176813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"04","issue":"04","first_page":"287","last_page":"291"},"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.9997000098228455,"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.9997000098228455,"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.9850999712944031,"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.9373000264167786,"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/apriori-algorithm","display_name":"Apriori algorithm","score":0.8319965600967407},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7459324598312378},{"id":"https://openalex.org/keywords/association-rule-learning","display_name":"Association rule learning","score":0.73386549949646},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6881807446479797},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6598922610282898},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.593736469745636},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5394964218139648},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4482715427875519},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.44261956214904785},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4408329129219055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15075421333312988}],"concepts":[{"id":"https://openalex.org/C81440476","wikidata":"https://www.wikidata.org/wiki/Q513511","display_name":"Apriori algorithm","level":3,"score":0.8319965600967407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7459324598312378},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.73386549949646},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6881807446479797},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6598922610282898},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.593736469745636},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5394964218139648},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4482715427875519},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.44261956214904785},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4408329129219055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15075421333312988},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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":3,"locations":[{"id":"doi:10.1142/s0219649205001249","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219649205001249","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 &amp; Knowledge Management","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:jikmxx:v:04:y:2005:i:04:n:s0219649205001249","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0219649205001249","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"},{"id":"pmh:oai:RePEc:wsi:jikmxx:v:04:y:2005:i:04:p:287-291","is_oa":false,"landing_page_url":"http://www.worldscinet.com/cgi-bin/details.cgi?type=html&amp;id=pii:S0219649205001249","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":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W208128215","https://openalex.org/W2032226242","https://openalex.org/W2115482638","https://openalex.org/W2156026066"],"related_works":["https://openalex.org/W2390051172","https://openalex.org/W2367209111","https://openalex.org/W2351000793","https://openalex.org/W2366790077","https://openalex.org/W2348276166","https://openalex.org/W3034345083","https://openalex.org/W2607264580","https://openalex.org/W1483188779","https://openalex.org/W2383378197","https://openalex.org/W2388198922"],"abstract_inverted_index":{"When":[0],"Apriori":[1,63,90,94],"was":[2,30],"first":[3],"introduced":[4],"as":[5,89],"an":[6],"algorithm":[7],"for":[8,133,139],"discovering":[9],"association":[10,68,81],"rules":[11,69,82],"in":[12,33,37,99],"a":[13,31,54,72,115,134],"database":[14],"of":[15,21,26,53,80,84,137],"market":[16,106],"basket":[17,107],"data,":[18],"the":[19,23,27,51,77,86,93,110,123,131,140],"problem":[20,113],"generating":[22,85],"candidate":[24,55,73,87,111,141],"set":[25,29,88],"large":[28],"bottleneck":[32,116],"Apriori's":[34],"performance,":[35],"both":[36],"space":[38,127],"and":[39,109,126],"computational":[40],"requirements.":[41],"At":[42],"first,":[43],"many":[44,100],"unsuccessful":[45],"attempts":[46],"were":[47,64],"made":[48],"to":[49],"improve":[50],"generation":[52,112],"set.":[56,74,142],"Later,":[57],"other":[58,103],"algorithms":[59],"that":[60,66],"out":[61],"performed":[62],"developed":[65],"generate":[67],"without":[70],"using":[71],"They":[75],"used":[76,98],"counting":[78,105],"property":[79],"instead":[83],"does.":[91],"However,":[92],"concept":[95],"has":[96],"been":[97],"different":[101],"areas":[102],"than":[104],"items,":[108],"remains":[114],"issue.":[117],"The":[118],"approach":[119],"described":[120],"here":[121],"improves":[122],"overall":[124],"time":[125],"requirements":[128],"by":[129],"eliminating":[130],"need":[132],"hash":[135],"table/tree":[136],"formation":[138]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
