{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T18:32:27Z","timestamp":1766687547485,"version":"3.48.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3521285","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T14:24:31Z","timestamp":1734963871000},"page":"195111-195130","source":"Crossref","is-referenced-by-count":2,"title":["Inverted Index Automata Frequent Itemset Mining for Large Dataset Frequent Itemset Mining"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8762-358X","authenticated-orcid":false,"given":"Xin","family":"Dai","sequence":"first","affiliation":[{"name":"Faculty of Computing, Universiti Teknologi Malaysia (UTM), Johor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8619-4149","authenticated-orcid":false,"given":"Haza","family":"Nuzly Abdull Hamed","sequence":"additional","affiliation":[{"name":"Faculty of Computing, Universiti Teknologi Malaysia (UTM), Johor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1738-4325","authenticated-orcid":false,"given":"Qichen","family":"Su","sequence":"additional","affiliation":[{"name":"Faculty of Computing, Universiti Teknologi Malaysia (UTM), Johor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0448-2497","authenticated-orcid":false,"given":"Xue","family":"Hao","sequence":"additional","affiliation":[{"name":"Faculty of Computing, Universiti Teknologi Malaysia (UTM), Johor, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"volume-title":"Data Mining Concepts and Techniques","year":"2012","author":"Han","key":"ref1"},{"article-title":"Mining frequent patterns based on data characteristics","volume-title":"Proc. Int. Conf. Inf. Knowl. Eng. (IKE)","author":"Vu","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.05.031"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.05.008"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.33261\/jaaru.2021.28.1.008"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2345408"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258524"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-012-0117-z"},{"issue":"6","key":"ref10","first-page":"400","article-title":"Implementation of web usage mining using APRIORI and FP growth algorithms","volume":"1","author":"Kumar","year":"2010","journal-title":"Int. J. Adv. Netw. Appl."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.09.026"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICSESS.2013.6615467"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/app131910577"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/9789812709066_0006"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2005.31"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/aimsec.2011.6010883"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2015906632"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10015-018-0437-y"},{"issue":"4","key":"ref19","first-page":"161","article-title":"Comparative study on Apriori algorithm and FP growth algorithm with pros and cons","volume":"4","author":"Kavitha","year":"2016","journal-title":"Int. J. Comput. Sci. Trends Technol."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-5828-8_51"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0514-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-018-9629-z"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.5120\/15682-4485"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.37391\/ijeer.100333"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2016910462"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2022.0130378"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-37051-0_85"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840750"},{"issue":"7","key":"ref29","first-page":"266","article-title":"Frequent itemset mining algorithm based on adjacency list storage and hash table","volume":"40","author":"Hao","year":"2023","journal-title":"Comput. Appl. Softw."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW63382.2024.00474"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15364-8_30"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.09.012"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3233\/IDT-130169"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.32985\/ijeces.14.9.9"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3128528"},{"issue":"1","key":"ref36","first-page":"6","article-title":"Improving real time search performance using inverted index entries invalidation strategies","volume":"16","author":"R\u00edssola","year":"2016","journal-title":"J. Comput. Sci. Technol."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/MCE.2022.3149210"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28940-3_1"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICFCC.2010.5497725"},{"volume-title":"Automata Theory and Its Applications","year":"2012","author":"Khoussainov","key":"ref40"},{"key":"ref41","article-title":"Finding the minimal DFA of very large finite state automata with an application to token passing networks","author":"Slavici","year":"2011","journal-title":"arXiv:1103.5736"},{"key":"ref42","first-page":"1","article-title":"An overview of micron\u2019s automata processor","volume-title":"Proc. Int. Conf. Hardw.\/Softw. Codesign Syst. Synth.","author":"Wang"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.041"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001494000140"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/568438.568455"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989534"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1541880.1541882"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA53966.2022.00011"},{"issue":"4","key":"ref49","first-page":"1059","article-title":"Research and application of improved Eclat algorithm","volume":"39","author":"Xinyue","year":"2018","journal-title":"Comput. Eng. Des."}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10811914.pdf?arnumber=10811914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T18:27:12Z","timestamp":1766687232000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10811914\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3521285","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}