{"id":"https://openalex.org/W2996416234","doi":"https://doi.org/10.1109/snpd.2019.8935787","title":"A Technique for Estimating Updated Frequent Itemsets in ESC-Growth Algorithm","display_name":"A Technique for Estimating Updated Frequent Itemsets in ESC-Growth Algorithm","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2996416234","doi":"https://doi.org/10.1109/snpd.2019.8935787","mag":"2996416234"},"language":"en","primary_location":{"id":"doi:10.1109/snpd.2019.8935787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/snpd.2019.8935787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 20th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","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/A5059466448","display_name":"Worapoj Kreesuradej","orcid":"https://orcid.org/0000-0002-6275-1921"},"institutions":[{"id":"https://openalex.org/I91538806","display_name":"King Mongkut's Institute of Technology Ladkrabang","ror":"https://ror.org/055mf0v62","country_code":"TH","type":"education","lineage":["https://openalex.org/I91538806"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Worapoj Kreesuradej","raw_affiliation_strings":["Faculty of Information Techonology, King Mongkut\u2019s Institute of Technology Ladkrabang, Bangkok, Thailand","Faculty of Information Techonology, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Techonology, King Mongkut\u2019s Institute of Technology Ladkrabang, Bangkok, Thailand","institution_ids":["https://openalex.org/I91538806"]},{"raw_affiliation_string":"Faculty of Information Techonology, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand","institution_ids":["https://openalex.org/I91538806"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060223310","display_name":"Wannasiri Thurachon","orcid":"https://orcid.org/0000-0002-7729-0283"},"institutions":[{"id":"https://openalex.org/I91538806","display_name":"King Mongkut's Institute of Technology Ladkrabang","ror":"https://ror.org/055mf0v62","country_code":"TH","type":"education","lineage":["https://openalex.org/I91538806"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Wannasiri Thurachon","raw_affiliation_strings":["Faculty of Information Techonology, King Mongkut\u2019s Institute of Technology Ladkrabang, Bangkok, Thailand","Faculty of Information Techonology, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Techonology, King Mongkut\u2019s Institute of Technology Ladkrabang, Bangkok, Thailand","institution_ids":["https://openalex.org/I91538806"]},{"raw_affiliation_string":"Faculty of Information Techonology, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand","institution_ids":["https://openalex.org/I91538806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059466448"],"corresponding_institution_ids":["https://openalex.org/I91538806"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.25075467,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2019","issue":null,"first_page":"01","last_page":"06"},"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.9998999834060669,"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.9998999834060669,"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.9908000230789185,"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.947700023651123,"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/tree-traversal","display_name":"Tree traversal","score":0.8057267069816589},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7179754972457886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6938892006874084},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6424670815467834},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5598912239074707},{"id":"https://openalex.org/keywords/association-rule-learning","display_name":"Association rule learning","score":0.5239196419715881},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4719628095626831},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.46461594104766846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2416553795337677},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.16869771480560303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06387114524841309}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8057267069816589},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7179754972457886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6938892006874084},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6424670815467834},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5598912239074707},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.5239196419715881},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4719628095626831},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.46461594104766846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2416553795337677},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.16869771480560303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06387114524841309},{"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.1109/snpd.2019.8935787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/snpd.2019.8935787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 20th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","raw_type":"proceedings-article"},{"id":"mag:3137693087","is_oa":false,"landing_page_url":"https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002218872912644","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W186603837","https://openalex.org/W1484413656","https://openalex.org/W1578774594","https://openalex.org/W2064853889","https://openalex.org/W2114624736","https://openalex.org/W2128817530","https://openalex.org/W2160311168","https://openalex.org/W2164866344","https://openalex.org/W2166559705","https://openalex.org/W2484110264","https://openalex.org/W2971924962","https://openalex.org/W4252403066","https://openalex.org/W6628750762"],"related_works":["https://openalex.org/W2136735429","https://openalex.org/W170547082","https://openalex.org/W2587876411","https://openalex.org/W4229950834","https://openalex.org/W3107197685","https://openalex.org/W2908418870","https://openalex.org/W48124421","https://openalex.org/W272774291","https://openalex.org/W2604902477","https://openalex.org/W3202117991"],"abstract_inverted_index":{"In":[0],"discovering":[1,121],"association":[2],"rules":[3],"from":[4],"a":[5,49,58,89,115],"dynamic":[6],"database,":[7],"iteration":[8,71],"through":[9],"the":[10,62,66,69,75,85,101,108,129,150,170],"frequent":[11,39,76,98,123],"itemsets":[12,40,67,77,99,124],"requires":[13],"significant":[14],"resources":[15,52,132],"and":[16,25,31,53,92,118,133,140,147,167,177],"computational":[17,54,134],"time":[18,139,172],"for":[19,60,65,68,143],"construction":[20],"of":[21,27,51,72,74,131,169],"sub-trees,":[22],"sub-tree":[23,91,117,141],"traversal":[24],"generation":[26],"conditional":[28],"pattern":[29],"bases,":[30],"it":[32],"is":[33],"quite":[34],"possible":[35],"that":[36,126],"no":[37,97],"updated":[38,102],"may":[41],"have":[42,104],"been":[43,105],"found":[44,106,155],"at":[45,157],"all,":[46],"resulting":[47],"in":[48,100,107,125],"waste":[50,130],"time.":[55,135],"We":[56,136],"describe":[57],"technique":[59,83],"estimating":[61],"support":[63,160],"count":[64],"next":[70,93,109],"discovery":[73,94],"by":[78,174],"our":[79],"ESC-Growth":[80,111,162],"Algorithm.":[81],"This":[82],"reduces":[84],"need":[86],"to":[87],"construct":[88,114],"new":[90,116,122],"step.":[95],"If":[96],"database":[103],"iteration,":[110,127],"will":[112,119],"not":[113],"stop":[120],"reducing":[128],"measured":[137],"execution":[138,171],"counts":[142],"FP-Growth,":[144,175],"FUFP-tree,":[145],"FPISC-Growth":[146],"ESCGrowth":[148],"on":[149],"same":[151],"synthetic":[152],"dataset;":[153],"we":[154],"that,":[156],"5%":[158],"minimum":[159],"threshold,":[161],"used":[163],"only":[164],"40.3,":[165],"96.5,":[166],"99.6%":[168],"required":[173],"FUFPtree":[176],"FPISC-Growth,":[178],"respectively.":[179]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}