{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:59:15Z","timestamp":1781765955699,"version":"3.54.5"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3612006","type":"journal-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T17:38:25Z","timestamp":1758303505000},"page":"165222-165246","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms Based on Dynamic Minimum Probabilistic Support and Utility Thresholds for Mining Top-K High-Utility Itemsets From Uncertain Databases"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-6515-3859","authenticated-orcid":false,"given":"Khoi","family":"Nguyen","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7796-4778","authenticated-orcid":false,"given":"Thien","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Natural Language Processing and Knowledge Discovery Laboratory, Faculty of Information Technology, Ton Duc Thang University, Ho Chi Minh City, Vietnam"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/access.2023.3314984"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119156"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01622-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.04.035"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_79"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0703-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.09.007"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2012.59"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.08.028"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-1130-x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339546"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.12.010"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2015.2458860"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.04.016"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.035"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1316-x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.09.051"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.08.028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/compeng50184.2022.9905433"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.12.024"},{"key":"ref24","first-page":"580","article-title":"Fast algorithms for mining association rules","volume-title":"Proc. 20th Int. Conf. Very Large Data Bases (VLDB)","author":"Agrawal"},{"key":"ref25","first-page":"211","article-title":"Finding the N largest itemsets in data mining","volume-title":"Proc. Int. Conf. Data Mining","author":"Shen"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39963-1_7"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71701-0_8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_8"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2011.165"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/wicom.2006.234"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557030"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/wict.2011.6141255"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13657-3_51"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.5539\/cis.v3n2p171"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982399"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2351476.2351500"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/icdm.2002.1183905"},{"key":"ref38","first-page":"275","article-title":"TF2P-growth: An efficient algorithm for mining frequent patterns without any thresholds","volume-title":"Proc. IEEE Int. Conf. Data Mining (ICDM)","author":"Hirate"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2004.44"},{"key":"ref40","first-page":"436","article-title":"ExMiner: An efficient algorithm for mining top-K frequent patterns","volume-title":"Proc. Int. Conf. Advanced Data Mining Appl.","author":"Minh"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/icdmw.2007.84"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.09.087"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.8.6.1417-1426"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29038-1_21"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10160-6_11"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2014.08.113"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22729-0_5"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104477"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0506-9"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-1047-4"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01994-9"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.02.067"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11173640.pdf?arnumber=11173640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T05:29:52Z","timestamp":1759296592000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11173640\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3612006","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}