{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:27:44Z","timestamp":1775021264599,"version":"3.50.1"},"reference-count":36,"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":[{"DOI":"10.13039\/501100004692","name":"Industrial University of Ho Chi Minh City","doi-asserted-by":"publisher","award":["20\/1.6CNTT01"],"award-info":[{"award-number":["20\/1.6CNTT01"]}],"id":[{"id":"10.13039\/501100004692","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.3004528","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T20:57:57Z","timestamp":1593032277000},"page":"118156-118163","source":"Crossref","is-referenced-by-count":18,"title":["An Efficient Method for Mining Top-<i>K<\/i> Closed Sequential Patterns"],"prefix":"10.1109","volume":"8","author":[{"given":"Thi-Thiet","family":"Pham","sequence":"first","affiliation":[]},{"given":"Tung","family":"Do","sequence":"additional","affiliation":[]},{"given":"Anh","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9246-4587","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7305-6492","authenticated-orcid":false,"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.04.049"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01622-1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1161-6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007652502315"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.15"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3314107"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.05.008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347167"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2010.5581020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.06.009"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2739749"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112993"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.01.034"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0078-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0630-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACT.2009.125"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105076"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014140"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775109"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30353-1_6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0175-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25856-5_14"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.03.050"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-53914-5_10"},{"key":"ref2","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc Int Conf Large Databases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105241"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1032-6"},{"key":"ref22","first-page":"1148","article-title":"ETARM: An efficient top-k association rule mining algorithm","volume":"248","author":"nguyen","year":"2018","journal-title":"Appl Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-1123-9"},{"key":"ref24","first-page":"1","article-title":"CLOSET: An efficient algorithm for mining frequent closed itemsets","author":"pei","year":"2001","journal-title":"Proc of the DMKD Workshop"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","article-title":"Mining sequential patterns by pattern-growth: The PrefixSpan approach","volume":"16","author":"pei","year":"2004","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref26","first-page":"106","article-title":"Applying the attributed prefix tree for mining closed sequential patterns","volume":"54","author":"pham","year":"2016","journal-title":"J Sci Technol"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1504\/IJIIDS.2013.056314"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09123855.pdf?arnumber=9123855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:08:38Z","timestamp":1641949718000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9123855\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3004528","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}