{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T18:46:14Z","timestamp":1791485174405,"version":"4.3.4"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["102.05-2017.300"],"award-info":[{"award-number":["102.05-2017.300"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,2,1]]},"DOI":"10.1109\/tkde.2018.2833478","type":"journal-article","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T22:36:22Z","timestamp":1525732582000},"page":"301-314","source":"Crossref","is-referenced-by-count":69,"title":["Efficient Vertical Mining of High Average-Utility Itemsets Based on Novel Upper-Bounds"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6843-1750","authenticated-orcid":false,"given":"Tin","family":"Truong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4065-8566","authenticated-orcid":false,"given":"Hai","family":"Duong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"ref11","article-title":"Minging high utility itemsets","author":"chan","year":"0","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2009.5346333"},{"key":"ref13","first-page":"131","article-title":"Efficiently mining high average utility itemsets with a tree structure","author":"lin","year":"2010","journal-title":"Proc Int Conf Intell Eng Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.01.006"},{"key":"ref15","first-page":"33","article-title":"A new method for mining high average utility itemsets","author":"lu","year":"2014","journal-title":"Proc 13th IFIP TC8 Intern Conf Comput Info Syst Indus Management"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1142\/S0219622012500307"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2016.04.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2717438"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-0896-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2013.192"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"3477","DOI":"10.1016\/j.ins.2007.03.018","article-title":"Efficient mining of weighted interesting patterns with a strong weight and\/or support afinity","volume":"177","author":"yun","year":"2007","journal-title":"Int J Inf Sci"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1089827.1089839"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IDEAS.1998.694360"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0492-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.76"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.51"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.10.027"},{"key":"ref22","first-page":"3389","article-title":"SPMF: a Java Open-Source Pattern Mining Library","volume":"15","author":"fournier-viger","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956788"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8606809\/08355591.pdf?arnumber=8355591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T09:33:52Z","timestamp":1751621632000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8355591\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,1]]},"references-count":22,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2833478","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,1]]}}}