{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T14:02:20Z","timestamp":1785074540534,"version":"3.55.0"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science & Technology Development","doi-asserted-by":"publisher","award":["102.01-2023.12"],"award-info":[{"award-number":["102.01-2023.12"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.knosys.2026.116419","type":"journal-article","created":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T23:29:58Z","timestamp":1780961398000},"page":"116419","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Directly extracting maximal multi-level high-utility patterns"],"prefix":"10.1016","volume":"349","author":[{"given":"Trinh D.D.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3537-4726","authenticated-orcid":false,"given":"N.T","family":"Tung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6440-6462","authenticated-orcid":false,"given":"Loan T.T.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3743-0701","authenticated-orcid":false,"given":"An","family":"Mai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.knosys.2026.116419_bib0001","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","article-title":"Mining association rules between sets of items in large databases","volume":"22","author":"Agrawal","year":"1993","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/j.knosys.2026.116419_bib0002","series-title":"presented at the SIAM International Conference on Data Mining","first-page":"482","article-title":"A foundational approach to mining itemset utilities from databases","author":"Yao","year":"2004"},{"key":"10.1016\/j.knosys.2026.116419_bib0003","series-title":"presented at the 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining","first-page":"689","article-title":"A two-phase algorithm for fast discovery of high utility itemsets","author":"Liu","year":"2005"},{"key":"10.1016\/j.knosys.2026.116419_bib0004","series-title":"presented at the IEEE International Conference on Data Mining, ICDM","first-page":"984","article-title":"Direct discovery of high utility itemsets without candidate generation","author":"Liu","year":"2012"},{"key":"10.1016\/j.knosys.2026.116419_bib0005","series-title":"presented at the ACM International Conference Proceeding Series","first-page":"55","article-title":"Mining high utility itemsets without candidate generation","author":"Liu","year":"2012"},{"issue":"1","key":"10.1016\/j.knosys.2026.116419_bib0006","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1038\/s41598-023-50375-y","article-title":"Improved adaptive-phase fuzzy high utility pattern mining algorithm based on tree-list structure for intelligent decision systems","volume":"14","author":"Chen","year":"2024","journal-title":"Sci. Rep."},{"issue":"3","key":"10.1016\/j.knosys.2026.116419_bib0007","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0283365","article-title":"Mining actionable combined high utility incremental and associated sequential patterns","volume":"18","author":"Shi","year":"2023","journal-title":"PLoS One"},{"key":"10.1016\/j.knosys.2026.116419_bib0008","series-title":"2010 11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing","first-page":"76","article-title":"Mining high utility web access sequences in dynamic web log data","author":"Ahmed","year":"2010"},{"key":"10.1016\/j.knosys.2026.116419_bib0009","series-title":"presented at the International Symposium on Methodologies for Intelligent Systems","first-page":"83","article-title":"FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning","author":"Fournier-Viger","year":"2014"},{"key":"10.1016\/j.knosys.2026.116419_bib0010","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","article-title":"HMiner: Efficiently mining high utility itemsets","volume":"90","author":"Krishnamoorthy","year":"2017","journal-title":"Expert. Syst. Appl."},{"issue":"2","key":"10.1016\/j.knosys.2026.116419_bib0011","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","article-title":"EFIM: a fast and memory efficient algorithm for high-utility itemset mining","volume":"51","author":"Zida","year":"2017","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.knosys.2026.116419_bib0012","series-title":"presented at the European Conference on Advances in Databases and Information Systems","first-page":"224","article-title":"Discovering high-utility itemsets at multiple abstraction levels","author":"Cagliero","year":"2017"},{"issue":"17","key":"10.1016\/j.knosys.2026.116419_bib0013","doi-asserted-by":"crossref","first-page":"12947","DOI":"10.1016\/j.eswa.2012.05.035","article-title":"Efficient algorithms for mining maximal high utility itemsets from data streams with different models","volume":"39","author":"Shie","year":"2012","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.knosys.2026.116419_bib0014","series-title":"Proceedings - IEEE International Conference on Data Mining, ICDM","first-page":"163","article-title":"Efficiently mining maximal frequent itemsets","author":"Gouda","year":"2001"},{"key":"10.1016\/j.knosys.2026.116419_bib0015","series-title":"presented at the TAAI 2015 - 2015 Conference on Technologies and Applications of Artificial Intelligence","first-page":"187","article-title":"Mining closed+ high utility itemsets without candidate generation","author":"Wu","year":"2016"},{"key":"10.1016\/j.knosys.2026.116419_bib0016","series-title":"presented at the Machine Learning and Data Mining in Pattern Recognition","first-page":"199","article-title":"EFIM-closed: Fast and memory efficient discovery of closed high-utility itemsets","author":"Fournier-Viger","year":"2016"},{"key":"10.1016\/j.knosys.2026.116419_bib0017","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","article-title":"An efficient method for mining high utility closed itemsets","volume":"495","author":"Nguyen","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.knosys.2026.116419_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115741","article-title":"Efficient algorithms for mining closed high utility itemsets in dynamic profit databases","volume":"186","author":"Nguyen","year":"2021","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.knosys.2026.116419_bib0019","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.124383","article-title":"MLC-miner: Efficiently discovering multi-level closed high utility patterns from quantitative hierarchical transaction databases","volume":"254","author":"Nguyen","year":"2024","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.knosys.2026.116419_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.109921","article-title":"Efficient algorithms for mining closed and maximal high utility itemsets","volume":"257","author":"Duong","year":"2022","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.knosys.2026.116419_bib0021","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","article-title":"Mining high-utility itemsets in dynamic profit databases","volume":"175","author":"Nguyen","year":"2019","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.knosys.2026.116419_bib0022","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118214","article-title":"EHMIN: Efficient approach of list based high-utility pattern mining with negative unit profits","volume":"209","author":"Kim","year":"2022","journal-title":"Expert. Syst. Appl."},{"issue":"10","key":"10.1016\/j.knosys.2026.116419_bib0023","doi-asserted-by":"crossref","first-page":"10224","DOI":"10.1109\/TKDE.2023.3256126","article-title":"Mining high utility itemsets using prefix trees and utility vectors","volume":"35","author":"Qu","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.knosys.2026.116419_bib0024","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","article-title":"Mining frequent patterns without candidate generation","volume":"29","author":"Han","year":"2000","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/j.knosys.2026.116419_bib0025","series-title":"ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"253","article-title":"UP-Growth: An efficient algorithm for high utility itemset mining","author":"Tseng","year":"2010"},{"key":"10.1016\/j.knosys.2026.116419_bib0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.111060","article-title":"Efficient approach for mining high-utility patterns on incremental databases with dynamic profits","volume":"282","author":"Kim","year":"2023","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.knosys.2026.116419_bib0027","series-title":"presented at the Workshop on Frequent Itemset Mining Implementations","article-title":"DCI closed: a fast and memory efficient algorithm to mine frequent closed itemsets","author":"Lucchese","year":"2004"},{"issue":"2","key":"10.1016\/j.knosys.2026.116419_bib0028","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s11704-016-6245-4","article-title":"CLS-Miner: efficient and effective closed high-utility itemset mining","volume":"13","author":"Dam","year":"2019","journal-title":"Front. Comput. Sci."},{"issue":"10","key":"10.1016\/j.knosys.2026.116419_bib0029","doi-asserted-by":"crossref","first-page":"11750","DOI":"10.1007\/s10489-022-03876-8","article-title":"Mining closed high utility patterns with negative utility in dynamic databases","volume":"53","author":"Han","year":"2023","journal-title":"Appl. Intell."},{"key":"10.1016\/j.knosys.2026.116419_bib0030","series-title":"presented at the 33rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems","first-page":"858","article-title":"Mining cross-level high utility itemsets","author":"Fournier-Viger","year":"2020"},{"issue":"5","key":"10.1016\/j.knosys.2026.116419_bib0031","doi-asserted-by":"crossref","first-page":"5475","DOI":"10.1007\/s10489-021-02681-z","article-title":"An efficient method for mining multi-level high utility Itemsets","volume":"52","author":"Tung","year":"2022","journal-title":"Appl. Intell."},{"key":"10.1016\/j.knosys.2026.116419_bib0032","series-title":"presented at the Computational Collective Intelligence","first-page":"382","article-title":"Efficiently discover multi-level maximal high-utility patterns from hierarchical databases","author":"Nguyen","year":"2024"},{"key":"10.1016\/j.knosys.2026.116419_bib0033","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ins.2021.12.017","article-title":"Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases","volume":"587","author":"Tung","year":"2022","journal-title":"Inf. Sci."},{"key":"10.1016\/j.knosys.2026.116419_bib0034","first-page":"1","article-title":"Mining cross-level high utility itemsets in unstable and negative profit databases","author":"Tung","year":"2025","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.knosys.2026.116419_bib0035","doi-asserted-by":"crossref","first-page":"104789","DOI":"10.1109\/ACCESS.2023.3314984","article-title":"FTKHUIM: a fast and efficient method for mining top-K high-utility itemsets","volume":"11","author":"Vu","year":"2023","journal-title":"IEEE Access."},{"key":"10.1016\/j.knosys.2026.116419_bib0036","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.107047","article-title":"Targeted mining of top-k high utility itemsets","volume":"126","author":"Huang","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"10.1016\/j.knosys.2026.116419_bib0037","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s41019-024-00241-2","article-title":"Efficient top-K frequent itemset mining on massive data","volume":"9","author":"Wan","year":"2024","journal-title":"Data Sci. Eng."},{"key":"10.1016\/j.knosys.2026.116419_bib0038","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113359","article-title":"An efficient method for mining top-K multi-level high utility itemsets","volume":"316","author":"Nguyen","year":"2025","journal-title":"Knowl. Based. Syst."},{"issue":"3","key":"10.1016\/j.knosys.2026.116419_bib0039","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3480245","article-title":"NTP-miner: nonoverlapping three-way sequential pattern mining","volume":"16","author":"Wu","year":"2022","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.knosys.2026.116419_bib0040","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2021.12.064","article-title":"NWP-miner: Nonoverlapping weak-gap sequential pattern mining","volume":"588","author":"Wu","year":"2022","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.knosys.2026.116419_bib0041","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1080\/08839514.2014.891839","article-title":"Discovery of high utility itemsets using genetic algorithm with ranked mutation","volume":"28","author":"Kannimuthu","year":"2014","journal-title":"Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.knosys.2026.116419_bib0042","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3462636","article-title":"Mining high utility itemsets with hill climbing and simulated annealing","volume":"13","author":"Nawaz","year":"2022","journal-title":"ACM Trans. Manage. Inf. Syst."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126011457?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126011457?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T13:33:00Z","timestamp":1785072780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126011457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":42,"alternative-id":["S0950705126011457"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116419","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Directly extracting maximal multi-level high-utility patterns","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116419","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116419"}}