{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:45:23Z","timestamp":1773254723675,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science and 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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s10115-026-02722-4","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:19:57Z","timestamp":1773191997000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient mining of top-K cross-level high utility itemsets on unstable profit databases"],"prefix":"10.1007","volume":"68","author":[{"given":"N. T.","family":"Tung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duc-Lung","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6440-6462","authenticated-orcid":false,"given":"Loan T. T.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,11]]},"reference":[{"key":"2722_CR1","doi-asserted-by":"publisher","unstructured":"Luna JM, Fournier-Viger P, Ventura S (2019) Frequent itemset mining: a 25 years review. Wiley Interdiscip Rev Data Min Knowl Discov 9. https:\/\/doi.org\/10.1002\/widm.1329","DOI":"10.1002\/widm.1329"},{"key":"2722_CR2","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. ACM International Conference Proceeding Series. ACM, New York, NY, USA, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"2722_CR3","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"2722_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy S (2017) HMiner: efficiently mining high utility itemsets. Expert Syst Appl 90:168\u2013183. https:\/\/doi.org\/10.1016\/j.eswa.2017.08.028","journal-title":"Expert Syst Appl"},{"key":"2722_CR5","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida S, Fournier-Viger P, Lin JCW et al (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51:595\u2013625. https:\/\/doi.org\/10.1007\/s10115-016-0986-0","journal-title":"Knowl Inf Syst"},{"key":"2722_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108865","volume":"248","author":"P Wu","year":"2022","unstructured":"Wu P, Niu X, Fournier-Viger P et al (2022) UBP-Miner: an efficient bit based high utility itemset mining algorithm. Knowl Based Syst 248:108865. https:\/\/doi.org\/10.1016\/j.knosys.2022.108865","journal-title":"Knowl Based Syst"},{"key":"2722_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Nguyen P, Nguyen TDD et al (2019) Mining high-utility itemsets in dynamic profit databases. Knowl Based Syst 175:130\u2013144. https:\/\/doi.org\/10.1016\/j.knosys.2019.03.022","journal-title":"Knowl Based Syst"},{"key":"2722_CR8","doi-asserted-by":"publisher","first-page":"10224","DOI":"10.1109\/TKDE.2023.3256126","volume":"35","author":"JF Qu","year":"2023","unstructured":"Qu JF, Fournier-Viger P, Liu M et al (2023) Mining high utility itemsets using prefix trees and utility vectors. IEEE Trans Knowl Data Eng 35:10224\u201310236. https:\/\/doi.org\/10.1109\/TKDE.2023.3256126","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2722_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.knosys.2016.08.022","volume":"111","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Fournier-Viger P, Gan W (2016) FHN: an efficient algorithm for mining high-utility itemsets with negative unit profits. Knowl Based Syst 111:283\u2013298. https:\/\/doi.org\/10.1016\/j.knosys.2016.08.022","journal-title":"Knowl Based Syst"},{"key":"2722_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2017.12.035","volume":"145","author":"S Krishnamoorthy","year":"2018","unstructured":"Krishnamoorthy S (2018) Efficiently mining high utility itemsets with negative unit profits. Knowl Based Syst 145:1\u201314. https:\/\/doi.org\/10.1016\/j.knosys.2017.12.035","journal-title":"Knowl Based Syst"},{"key":"2722_CR11","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12296","volume":"35","author":"K Singh","year":"2018","unstructured":"Singh K, Shakya HK, Singh A, Biswas B (2018) Mining of high-utility itemsets with negative utility. Expert Syst 35:e12296. https:\/\/doi.org\/10.1111\/exsy.12296","journal-title":"Expert Syst"},{"key":"2722_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118214","volume":"209","author":"H Kim","year":"2022","unstructured":"Kim H, Ryu T, Lee C et al (2022) EHMIN: efficient approach of list based high-utility pattern mining with negative unit profits. Expert Syst Appl 209:118214. https:\/\/doi.org\/10.1016\/j.eswa.2022.118214","journal-title":"Expert Syst Appl"},{"key":"2722_CR13","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wang Y, Lin JCW, et al (2020) Mining cross-level high utility itemsets. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp 858\u2013871","DOI":"10.1007\/978-3-030-55789-8_73"},{"key":"2722_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2021.12.017","volume":"587","author":"NT Tung","year":"2022","unstructured":"Tung NT, Nguyen LTT, Nguyen TDD et al (2022) Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf Sci 587:41\u201362. https:\/\/doi.org\/10.1016\/j.ins.2021.12.017","journal-title":"Inf Sci"},{"key":"2722_CR15","doi-asserted-by":"crossref","unstructured":"Cagliero L, Chiusano S, Garza P, Ricupero G (2017) Discovering high-utility itemsets at multiple abstraction levels. In: Communications in computer and information science,  pp 224\u2013234","DOI":"10.1007\/978-3-319-67162-8_22"},{"key":"2722_CR16","doi-asserted-by":"publisher","first-page":"5475","DOI":"10.1007\/s10489-021-02681-z","volume":"52","author":"NT Tung","year":"2022","unstructured":"Tung NT, Nguyen LTT, Nguyen TDD, Vo B (2022) An efficient method for mining multi-level high utility itemsets. Appl Intell 52:5475\u20135496. https:\/\/doi.org\/10.1007\/s10489-021-02681-z","journal-title":"Appl Intell"},{"key":"2722_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110733","volume":"276","author":"TDD Nguyen","year":"2023","unstructured":"Nguyen TDD, Tung NT, Pham T, Nguyen LTT (2023) Parallel approaches to extract multi-level high utility itemsets from hierarchical transaction databases. Knowl Based Syst 276:110733. https:\/\/doi.org\/10.1016\/j.knosys.2023.110733","journal-title":"Knowl Based Syst"},{"key":"2722_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2024.124383","volume":"254","author":"TDD Nguyen","year":"2024","unstructured":"Nguyen TDD, Tung NT, Nguyen LTT et al (2024) MLC-miner: efficiently discovering multi-level closed high utility patterns from quantitative hierarchical transaction databases. Expert Syst Appl 254:124383. https:\/\/doi.org\/10.1016\/J.ESWA.2024.124383","journal-title":"Expert Syst Appl"},{"key":"2722_CR19","doi-asserted-by":"publisher","first-page":"5420","DOI":"10.1109\/TKDE.2025.3579746","volume":"37","author":"NT Tung","year":"2025","unstructured":"Tung NT, Nguyen TDD, Nguyen LTT et al (2025) Mining cross-level high utility itemsets in unstable and negative profit databases. IEEE Trans Knowl Data Eng 37:5420\u20135435. https:\/\/doi.org\/10.1109\/TKDE.2025.3579746","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2722_CR20","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2016","unstructured":"Tseng VS, Wu CW, Fournier-Viger P, Yu PS (2016) Efficient algorithms for mining top-K high utility itemsets. IEEE Trans Knowl Data Eng 28:54\u201367. https:\/\/doi.org\/10.1109\/TKDE.2015.2458860","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2722_CR21","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.eswa.2018.09.051","volume":"117","author":"S Krishnamoorthy","year":"2019","unstructured":"Krishnamoorthy S (2019) Mining top-k high utility itemsets with effective threshold raising strategies. Expert Syst Appl 117:148\u2013165. https:\/\/doi.org\/10.1016\/j.eswa.2018.09.051","journal-title":"Expert Syst Appl"},{"key":"2722_CR22","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"QH Duong","year":"2016","unstructured":"Duong QH, Liao B, Fournier-Viger P, Dam TL (2016) An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowl Based Syst 104:106\u2013122. https:\/\/doi.org\/10.1016\/j.knosys.2016.04.016","journal-title":"Knowl Based Syst"},{"key":"2722_CR23","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1007\/s10489-018-1316-x","volume":"49","author":"K Singh","year":"2019","unstructured":"Singh K, Singh SS, Kumar A, Biswas B (2019) TKEH: an efficient algorithm for mining top-k high utility itemsets. Appl Intell 49:1078\u20131097. https:\/\/doi.org\/10.1007\/s10489-018-1316-x","journal-title":"Appl Intell"},{"key":"2722_CR24","doi-asserted-by":"publisher","first-page":"104789","DOI":"10.1109\/ACCESS.2023.3314984","volume":"11","author":"VV Vu","year":"2023","unstructured":"Vu VV, Lam MTH, Duong TTM et al (2023) FTKHUIM: a fast and efficient method for mining top-K high-utility itemsets. IEEE Access 11:104789\u2013104805. https:\/\/doi.org\/10.1109\/ACCESS.2023.3314984","journal-title":"IEEE Access"},{"key":"2722_CR25","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.ins.2021.12.024","volume":"587","author":"M Ashraf","year":"2022","unstructured":"Ashraf M, Abdelkader T, Rady S, Gharib TF (2022) TKN: an efficient approach for discovering top-k high utility itemsets with positive or negative profits. Inf Sci (N Y) 587:654\u2013678. https:\/\/doi.org\/10.1016\/j.ins.2021.12.024","journal-title":"Inf Sci (N Y)"},{"key":"2722_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2025.113359","volume":"316","author":"LTT Nguyen","year":"2025","unstructured":"Nguyen LTT, Tung NT, Vo B (2025) An efficient method for mining top-k multi-level high utility itemsets. Knowl Based Syst 316:113359. https:\/\/doi.org\/10.1016\/j.knosys.2025.113359","journal-title":"Knowl Based Syst"},{"key":"2722_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121218","volume":"681","author":"Y Yan","year":"2024","unstructured":"Yan Y, Niu X, Zhang Z et al (2024) Efficient high utility itemset mining without the join operation. Inf Sci 681:121218. https:\/\/doi.org\/10.1016\/j.ins.2024.121218","journal-title":"Inf Sci"},{"key":"2722_CR28","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2020.12.004","volume":"553","author":"JMT Wu","year":"2021","unstructured":"Wu JMT, Srivastava G, Wei M et al (2021) Fuzzy high-utility pattern mining in parallel and distributed Hadoop framework. Inf Sci 553:31\u201348. https:\/\/doi.org\/10.1016\/j.ins.2020.12.004","journal-title":"Inf Sci"},{"key":"2722_CR29","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2023.3290371","volume":"36","author":"W Fang","year":"2024","unstructured":"Fang W, Jiang H, Lu H et al (2024) GPU-based efficient parallel heuristic algorithm for high-utility itemset mining in large transaction datasets. IEEE Trans Knowl Data Eng 36:652\u2013667. https:\/\/doi.org\/10.1109\/TKDE.2023.3290371","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2722_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107047","volume":"126","author":"S Huang","year":"2023","unstructured":"Huang S, Gan W, Miao J et al (2023) Targeted mining of top-k high utility itemsets. Eng Appl Artif Intell 126:107047. https:\/\/doi.org\/10.1016\/j.engappai.2023.107047","journal-title":"Eng Appl Artif Intell"},{"key":"2722_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106182","volume":"123","author":"F Lai","year":"2023","unstructured":"Lai F, Zhang X, Chen G, Gan W (2023) Mining periodic high-utility itemsets with both positive and negative utilities. Eng Appl Artif Intell 123:106182. https:\/\/doi.org\/10.1016\/j.engappai.2023.106182","journal-title":"Eng Appl Artif Intell"},{"key":"2722_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/J.ESWA.2023.120697","author":"H Kim","year":"2023","unstructured":"Kim H, Kim H, Kim S et al (2023) An advanced approach for incremental flexible periodic pattern mining on time-series data. Expert Syst Appl. https:\/\/doi.org\/10.1016\/J.ESWA.2023.120697","journal-title":"Expert Syst Appl"},{"key":"2722_CR33","doi-asserted-by":"publisher","first-page":"5325","DOI":"10.1002\/int.22794","volume":"37","author":"M Han","year":"2022","unstructured":"Han M, Zhang N, Wang L et al (2022) Mining high utility pattern with negative items in dynamic databases. Int J Intell Syst 37:5325\u20135353. https:\/\/doi.org\/10.1002\/int.22794","journal-title":"Int J Intell Syst"},{"key":"2722_CR34","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00354-019-00078-8","volume":"38","author":"I Yildirim","year":"2020","unstructured":"Yildirim I, Celik M (2020) Mining high-average utility itemsets with positive and negative external utilities. New Gener Comput 38:153\u2013186. https:\/\/doi.org\/10.1007\/s00354-019-00078-8","journal-title":"New Gener Comput"},{"key":"2722_CR35","doi-asserted-by":"publisher","DOI":"10.3390\/math13040659","volume":"13","author":"I Yildirim","year":"2025","unstructured":"Yildirim I (2025) Mining high-efficiency itemsets with negative utilities. Mathematics 13:659. https:\/\/doi.org\/10.3390\/math13040659","journal-title":"Mathematics"},{"key":"2722_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121489","volume":"237","author":"NT Tung","year":"2024","unstructured":"Tung NT, Nguyen TDD, Nguyen LTT, Vo B (2024) An efficient method for mining high-utility itemsets from unstable negative profit databases. Expert Syst Appl 237:121489. https:\/\/doi.org\/10.1016\/j.eswa.2023.121489","journal-title":"Expert Syst Appl"},{"key":"2722_CR37","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.ins.2022.12.092","volume":"624","author":"JM Luna","year":"2023","unstructured":"Luna JM, Kiran RU, Fournier-Viger P, Ventura S (2023) Efficient mining of top-k high utility itemsets through genetic algorithms. Inf Sci (N Y) 624:529\u2013553. https:\/\/doi.org\/10.1016\/j.ins.2022.12.092","journal-title":"Inf Sci (N Y)"},{"key":"2722_CR38","doi-asserted-by":"publisher","first-page":"77605","DOI":"10.1109\/ACCESS.2024.3406562","volume":"12","author":"C Lee","year":"2024","unstructured":"Lee C, Kim H, Cho M et al (2024) Incremental top-k high utility pattern mining and analyzing over the entire accumulated dynamic database. IEEE Access 12:77605\u201377620. https:\/\/doi.org\/10.1109\/ACCESS.2024.3406562","journal-title":"IEEE Access"},{"key":"2722_CR39","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ins.2020.08.028","volume":"557","author":"X Han","year":"2021","unstructured":"Han X, Liu X, Li J, Gao H (2021) Efficient top-k high utility itemset mining on massive data. Inf Sci (N Y) 557:382\u2013406. https:\/\/doi.org\/10.1016\/j.ins.2020.08.028","journal-title":"Inf Sci (N Y)"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-026-02722-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-026-02722-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-026-02722-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:19:59Z","timestamp":1773191999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-026-02722-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,11]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["2722"],"URL":"https:\/\/doi.org\/10.1007\/s10115-026-02722-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No experiments were conducted with humans or animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human or animal participants"}}],"article-number":"97"}}