{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:15:35Z","timestamp":1773436535191,"version":"3.50.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100012046","name":"Vietnam National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["02\/2019\/TN"],"award-info":[{"award-number":["02\/2019\/TN"]}],"id":[{"id":"10.13039\/100012046","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3131577","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T18:36:50Z","timestamp":1638297410000},"page":"161305-161317","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Methods for Clickstream Pattern Mining on Incremental Databases"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9246-4587","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, HUTECH University, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huy-Cuong","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, HUTECH University, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1882-6877","authenticated-orcid":false,"given":"Bao","family":"Huynh","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, HUTECH University, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0909-4974","authenticated-orcid":false,"given":"Tuong","family":"Le","sequence":"additional","affiliation":[{"name":"Informetrics Research Group, Ton Duc Thang University, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2096-4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-150759"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.06.009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-016-0859-y"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3314107"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3004528"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1504\/IJWGS.2020.109474"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1504\/IJWGS.2020.109475"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0566-1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.08.070"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-1123-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1161-6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.05.021"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.10.265"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3334480.3382971"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.77"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775109"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"SPADE: An efficient algorithm for mining frequent sequences","volume":"42","author":"zaki","year":"2001","journal-title":"Mach Learn"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06608-0_4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.05.008"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1032-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0884-x"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.03.030"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.12.008"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014114"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00715-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-020-07876-0"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-018-0759-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2598797"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99368-3_45"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.01.034"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112993"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/01969722.2020.1871225"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014140"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347167"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.7717\/peerj.5183"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICEDSS.2018.8544326"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"5337","DOI":"10.1093\/bioinformatics\/btaa1053","article-title":"Data-driven noise modeling of digital DNA melting analysis enables prediction of sequence discriminating power","volume":"36","author":"langouche","year":"2020","journal-title":"Bioinformatics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.05.031"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-020-03129-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.12.005"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.04.027"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-020-00839-2"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01743-y"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113087"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3430767"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2982415"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1181"},{"key":"ref41","first-page":"609","article-title":"Improving efficiency of incremental mining by trie structure and pre-large itemsets","volume":"33","author":"le","year":"2015","journal-title":"Inform Comput"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.04.001"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.11.002"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09628108.pdf?arnumber=9628108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T19:54:56Z","timestamp":1773431696000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9628108\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3131577","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}