{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:19:21Z","timestamp":1768979961436,"version":"3.49.0"},"reference-count":35,"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":"Western Norway University of Applied Sciences"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2976662","type":"journal-article","created":{"date-parts":[[2020,2,27]],"date-time":"2020-02-27T22:16:57Z","timestamp":1582841817000},"page":"40714-40722","source":"Crossref","is-referenced-by-count":32,"title":["Efficient Chain Structure for High-Utility Sequential Pattern Mining"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"first","affiliation":[]},{"given":"Yuanfa","family":"Li","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0135-7450","authenticated-orcid":false,"given":"Youcef","family":"Djenouri","sequence":"additional","affiliation":[]},{"given":"Ji","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.148"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"ref31","first-page":"482","article-title":"A foundational approach to mining itemset utilities from databases","author":"yao","year":"2013","journal-title":"Proc SIAM Int Conf Data Mining"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.10.027"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0986-0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2007.72"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2014.891839"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_79"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.12.082"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/iFuzzy.2013.6825476"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.02.022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2510012"},{"key":"ref28","first-page":"1597","article-title":"A novel approach to extract high utility itemsets from distributed databases","volume":"31","author":"vo","year":"2013","journal-title":"Inform Comput"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4218\/etrij.10.1510.0066"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2458860"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SNPD.2010.21"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0914-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2420557"},{"key":"ref8","article-title":"Fast utility mining on complex sequences","author":"gan","year":"2019","journal-title":"arXiv 1904 12248"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.10.033"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347167"},{"key":"ref1","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2106-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.5121\/ijcses.2011.2408"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63579-8_17"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20149-3_18"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014140"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835839"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09016187.pdf?arnumber=9016187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:54Z","timestamp":1639770714000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9016187\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2976662","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}