{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:43:44Z","timestamp":1778273024088,"version":"3.51.4"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Science and Technology Development Program of Central Guide to Local Government of China","award":["2019ZYYD043"],"award-info":[{"award-number":["2019ZYYD043"]}]},{"name":"International Science and Technology Cooperation Program of Hubei Province","award":["2019AHB059"],"award-info":[{"award-number":["2019AHB059"]}]},{"name":"Key Agricultural Programs of Science and Technology and Innovation of Xiangyang"},{"DOI":"10.13039\/501100014901","name":"Talent Introduction Project of Hubei University of Arts and Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100014901","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3029302","type":"journal-article","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T19:33:44Z","timestamp":1602099224000},"page":"183722-183735","source":"Crossref","is-referenced-by-count":16,"title":["Efficient Mining of Frequent Itemsets Using Only One Dynamic Prefix Tree"],"prefix":"10.1109","volume":"8","author":[{"given":"Jun-Feng","family":"Qu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Hang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongbo","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiong","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","first-page":"1","article-title":"LCM: An efficient algorithm for enumerating frequent closed item sets","volume":"90","author":"uno","year":"2003","journal-title":"Proc Workshop Frequent Item Set Mining Implementations"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICEBE.2006.50"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000041128.59011.53"},{"key":"ref31","first-page":"1","article-title":"AFOPT: An efficient implementation of pattern growth approach","author":"liu","year":"2003","journal-title":"Proc of ICDM Workshop"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.166"},{"key":"ref37","year":"2020","journal-title":"Frequent itemset mining implementations repository"},{"key":"ref36","year":"2020","journal-title":"Bart Goethals&#x2019;s Web Pages"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-007-0099-2"},{"key":"ref34","article-title":"COFI-tree mining: A new approach to pattern growth with reduced candidacy generation","author":"el-hajj","year":"2003","journal-title":"Proc of ICDM Workshop"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2888627"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2997409"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3012817"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2974104"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2929082"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-013-0937-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD.2010.15"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2184751.2184842"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.09.013"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2846646"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41920-6_30"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.008"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2017.7510460"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1207"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2412037"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1329"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911831"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.020"},{"key":"ref9","first-page":"487","article-title":"Fast algorithm for mining association rules in large databases","author":"aggrawal","year":"1994","journal-title":"Proc VLDB"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2751081"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3233\/ICA-170555"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.04.037"},{"key":"ref24","first-page":"283","article-title":"New algorithms for fast discovery of association rules","author":"zaki","year":"1997","journal-title":"Proc KDD"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1693"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1602-113"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09216179.pdf?arnumber=9216179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:26Z","timestamp":1639770986000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9216179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3029302","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}