{"id":"https://openalex.org/W4391124516","doi":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","title":"Enhancing N-List Structure and Performance for Efficient Large Dataset Analysis","display_name":"Enhancing N-List Structure and Performance for Efficient Large Dataset Analysis","publication_year":2024,"publication_date":"2024-01-22","ids":{"openalex":"https://openalex.org/W4391124516","doi":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003"},"language":"en","primary_location":{"id":"doi:10.47760/ijcsmc.2024.v13i01.003","doi":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","is_oa":true,"landing_page_url":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","pdf_url":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","source":{"id":"https://openalex.org/S4210226879","display_name":"International Journal of Computer Science and Mobile Computing","issn_l":"2320-088X","issn":["2320-088X"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Science and Mobile Computing","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033044281","display_name":"Arkan A. Ghaib","orcid":"https://orcid.org/0009-0001-3355-0880","observed_orcids":["https://orcid.org/0009-0001-3355-0880"]},"institutions":[{"id":"https://openalex.org/I4210145266","display_name":"Southern Technical University","ror":"https://ror.org/03sax3264","country_code":"IQ","type":"education","lineage":["https://openalex.org/I4210145266"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Arkan A. Ghaib","raw_affiliation_strings":["Department of Information Technologies, Management Technical College, Southern Technical University, Basrah, Iraq"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technologies, Management Technical College, Southern Technical University, Basrah, Iraq","institution_ids":["https://openalex.org/I4210145266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113053838","display_name":"Abdullah A. Nahi","orcid":"https://orcid.org/0000-0002-1090-0374","observed_orcids":["https://orcid.org/0000-0002-1090-0374"]},"institutions":[{"id":"https://openalex.org/I4210145266","display_name":"Southern Technical University","ror":"https://ror.org/03sax3264","country_code":"IQ","type":"education","lineage":["https://openalex.org/I4210145266"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Abdullah A. Nahi","raw_affiliation_strings":["Department of Information Technologies, Management Technical College, Southern Technical University, Basrah, Iraq"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technologies, Management Technical College, Southern Technical University, Basrah, Iraq","institution_ids":["https://openalex.org/I4210145266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210145266"],"apc_list":null,"apc_paid":null,"fwci":0.2539,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54411125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"13","issue":"1","first_page":"49","last_page":"58"},"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.9984999895095825,"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.9984999895095825,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.0003000000142492354,"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/T11269","display_name":"Algorithms and Data Compression","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/frequent-itemset-mining","display_name":"frequent itemset mining","score":0.984000027179718},{"id":"https://openalex.org/keywords/memory-usage","display_name":"memory usage","score":0.49300000071525574}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7359731197357178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7112438678741455},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5447699427604675},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5254786610603333},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5144789218902588},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4545643925666809},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41891464591026306},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.41656509041786194},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3989448547363281},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3223057985305786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16549944877624512},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.47760/ijcsmc.2024.v13i01.003","doi":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","is_oa":true,"landing_page_url":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","pdf_url":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","source":{"id":"https://openalex.org/S4210226879","display_name":"International Journal of Computer Science and Mobile Computing","issn_l":"2320-088X","issn":["2320-088X"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Science and Mobile Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.47760/ijcsmc.2024.v13i01.003","doi":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","is_oa":true,"landing_page_url":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","pdf_url":"https://doi.org/10.47760/ijcsmc.2024.v13i01.003","source":{"id":"https://openalex.org/S4210226879","display_name":"International Journal of Computer Science and Mobile Computing","issn_l":"2320-088X","issn":["2320-088X"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Science and Mobile Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4391124516.pdf","grobid_xml":"https://content.openalex.org/works/W4391124516.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1971823372","https://openalex.org/W1977055639","https://openalex.org/W2008145533","https://openalex.org/W2034589438","https://openalex.org/W2075130437","https://openalex.org/W2125231721","https://openalex.org/W2256820277","https://openalex.org/W2384824705","https://openalex.org/W2481060438","https://openalex.org/W2608590294","https://openalex.org/W2766773197","https://openalex.org/W3037667894","https://openalex.org/W4236460122","https://openalex.org/W4252403066","https://openalex.org/W4320067704","https://openalex.org/W4390551655"],"related_works":["https://openalex.org/W2256820277","https://openalex.org/W1977055639","https://openalex.org/W2125231721","https://openalex.org/W7084136946","https://openalex.org/W2597085133","https://openalex.org/W2071666497","https://openalex.org/W2608590294","https://openalex.org/W4405387175","https://openalex.org/W2107019070","https://openalex.org/W1990389531"],"abstract_inverted_index":{"One":[0],"of":[1,34],"the":[2,32,38,78,83,120,146],"main":[3],"challenges":[4],"in":[5,25],"data-intensive":[6],"sectors":[7],"like":[8],"scientific":[9],"research,":[10],"data":[11,23],"mining,":[12],"and":[13,62,105,138,141],"machine":[14],"learning":[15],"is":[16,37,53,118],"efficiently":[17],"analyzing":[18],"enormous":[19],"datasets.":[20,111,125],"A":[21],"popular":[22],"structure":[24],"similarity":[26],"search":[27,72,79],"algorithms":[28],"to":[29,96],"speed":[30],"up":[31],"retrieval":[33],"closest":[35],"neighbors":[36],"N-List.":[39],"In":[40],"this":[41],"paper,":[42],"a":[43],"high-performance":[44],"method":[45],"for":[46],"mining":[47],"frequent":[48],"item":[49,57,66],"sets":[50,58,67],"called":[51],"EN-list":[52,117,127],"presented.":[54],"It":[55],"represents":[56],"using":[59,69],"an":[60,70],"N-list":[61],"finds":[63],"frequently":[64],"recurring":[65],"directly":[68],"aset-enumeration":[71],"tree.":[73],"Specifically,":[74],"it":[75],"drastically":[76],"reduces":[77],"field":[80],"by":[81],"applying":[82],"powerful":[84],"pruning":[85],"approach":[86,122],"known":[87],"as":[88],"Children-Parent":[89],"Equivalency":[90],"pruning.":[91],"We":[92],"conducted":[93],"extensive":[94],"experiments":[95],"compare":[97],"En-list":[98],"against":[99],"three":[100],"state-of-the-art":[101],"algorithms:":[102],"Fin,":[103],"PrePost,":[104],"DiffNodesets":[106,137],"on":[107],"four":[108],"distinct":[109],"real":[110],"The":[112],"experimental":[113],"results":[114],"show":[115],"that":[116],"always":[119],"fastest":[121],"across":[123],"all":[124],"Furthermore,":[126],"shows":[128],"good":[129],"memory":[130,135],"consumption":[131],"performance,":[132],"requiring":[133],"less":[134],"than":[136,145],"PrePost":[139],"methods":[140],"just":[142],"slightly":[143],"more":[144],"Fin":[147],"approach.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2024-01-23T00:00:00"}