{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:54:34Z","timestamp":1760709274962,"version":"3.40.5"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Foundation for Science and Technology Development of Ton Duc Thang University (FOSTECT), website: http:\/\/fostect.tdt.edu.vn","award":["FOSTECT.2015.BR.01"],"award-info":[{"award-number":["FOSTECT.2015.BR.01"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2676803","type":"journal-article","created":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T03:54:19Z","timestamp":1489463659000},"page":"3111-3120","source":"Crossref","is-referenced-by-count":22,"title":["Efficient Algorithms for Mining Erasable Closed Patterns From Product Datasets"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-1138","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"first","affiliation":[]},{"given":"Tuong","family":"Le","sequence":"additional","affiliation":[]},{"given":"Giang","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956788"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.09.040"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.02.003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-014-0252-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.12.012"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2012.02.002"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.165"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0492-y"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.10.049"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0530-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2013.09.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1137"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.04.048"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2013.388"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.3233\/IFS-141398","article-title":"Mining weighted erasable patterns by using underestimated constraint-based pruning technique","volume":"28","author":"lee","year":"2014","journal-title":"J Intell Fuzzy Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.12.001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.023"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2008.03.011"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.143"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0379-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3223-4"},{"key":"ref6","first-page":"67","article-title":"Mining erasable itemsets","volume":"9","author":"deng","year":"2009","journal-title":"Proc ICMLC"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0443-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0748-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/int.21580"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.07.045"},{"key":"ref1","first-page":"487","article-title":"Fast algorithms for mining association rules","volume":"94","author":"agrawal","year":"1994","journal-title":"Proc VLDB"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05476-6_8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15702-3_36"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0644-8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0614-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.002"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0506-9"},{"key":"ref25","first-page":"398","article-title":"Discovering frequent closed itemsets for association rules","volume":"99","author":"pasquier","year":"1999","journal-title":"Proc ICDT"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/07876747.pdf?arnumber=7876747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:59:22Z","timestamp":1633921162000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7876747\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2676803","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2017]]}}}