{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:49:47Z","timestamp":1773233387058,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10489-021-02681-z","type":"journal-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T18:02:41Z","timestamp":1628877761000},"page":"5475-5496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["An efficient method for mining multi-level high utility Itemsets"],"prefix":"10.1007","volume":"52","author":[{"given":"N. T.","family":"Tung","sequence":"first","affiliation":[]},{"given":"Loan T. T.","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Trinh D. D.","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-1138","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,13]]},"reference":[{"issue":"2","key":"2681_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Rec 22(2):207\u2013216","journal-title":"ACM SIGMOD Rec"},{"key":"2681_CR2","first-page":"482","volume":"4","author":"H Yao","year":"2004","unstructured":"Yao H, Hamilton HJ, Butz GJ (2004) A foundational approach to mining itemset utilities from databases. SIAM Intl Conf Data Mining 4:482\u2013486","journal-title":"SIAM Intl Conf Data Mining"},{"issue":"2\u20133","key":"2681_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-739X(97)00019-8","volume":"13","author":"R Srikant","year":"1997","unstructured":"Srikant R, Agrawal R (1997) Mining generalized association rules. Futur Gener Comput Syst 13(2\u20133):161\u2013180","journal-title":"Futur Gener Comput Syst"},{"key":"2681_CR4","first-page":"74","volume":"1510","author":"J Hipp","year":"1998","unstructured":"Hipp J, Myka A, Wirth R, G\u00fcntzer U (1998) A new algorithm for faster mining of generalized association rules. Eur Sympo Princ Data Mining Knowl Disc 1510:74\u201382","journal-title":"Eur Sympo Princ Data Mining Knowl Disc"},{"issue":"3","key":"2681_CR5","first-page":"19","volume":"2","author":"B Vo","year":"2009","unstructured":"Vo B, Le B (2009) Fast algorithm for mining generalized association rules. Int J Database Theory 2(3):19\u201321","journal-title":"Int J Database Theory"},{"key":"2681_CR6","first-page":"224","volume":"767","author":"L Cagliero","year":"2017","unstructured":"Cagliero L, Chiusano S, Garza P, Ricupero G (2017) Discovering high-utility itemsets at multiple abstraction levels. Eur Conf Adv Databases Inform Syst 767:224\u2013234","journal-title":"Eur Conf Adv Databases Inform Syst"},{"key":"2681_CR7","doi-asserted-by":"crossref","unstructured":"P. Fournier-Viger, Y. Yang, J. C.-W. Lin, J. M. Luna, and S. Ventura, \u201cMining Cross-Level High Utility Itemsets,\u201d in 33rd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, p. 12, 2020","DOI":"10.1007\/978-3-030-55789-8_73"},{"key":"2681_CR8","unstructured":"R. Agrawal and R. Srikant, \u201cFast Algorithms for Mining Association Rules in Large Databases,\u201d in the 20th International Conference on Very Large Data Bases (VLDB \u201894), pp. 487\u2013499, 1994"},{"issue":"3","key":"2681_CR9","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"2681_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Disc 8(1):53\u201387","journal-title":"Data Min Knowl Disc"},{"key":"2681_CR11","unstructured":"K. Sriphaew and T. Theeramunkong, \u201cA new method for finding generalized frequent itemsets in generalized association rule mining,\u201d in IEEE Symposium on Computers and Communications, pp. 1040\u20131045, 2002"},{"issue":"6","key":"2681_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.3233\/IDA-2003-7604","volume":"7","author":"A Appice","year":"2003","unstructured":"Appice A, Ceci M, Lanza A, Lisi FA, Malerba D (2003) Discovery of spatial association rules in geo-referenced census data: a relational mining approach. Intell Data Anal 7(6):541\u2013566","journal-title":"Intell Data Anal"},{"key":"2681_CR13","doi-asserted-by":"crossref","unstructured":"A. Appice, M. Berardi, M. Ceci, and D. Malerba, \u201cMining and Filtering Multi-level Spatial Association Rules with ARES,\u201d in Foundations of Intelligent Systems, pp. 342\u2013353, 2005","DOI":"10.1007\/11425274_36"},{"issue":"4","key":"2681_CR14","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ, Hsiao CJ (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"2681_CR15","doi-asserted-by":"publisher","first-page":"7277","DOI":"10.1016\/j.eswa.2010.12.023","volume":"38","author":"CM Wu","year":"2011","unstructured":"Wu CM, Huang YF (2011) Generalized association rule mining using an efficient data structure. Expert Syst Appl 38(6):7277\u20137290","journal-title":"Expert Syst Appl"},{"key":"2681_CR16","doi-asserted-by":"crossref","unstructured":"I. Pramudiono and M. Kitsuregawa, \u201cFP-tax: Tree structure based generalized association rule mining,\u201d in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 60\u201363, 2004","DOI":"10.1145\/1008694.1008704"},{"key":"2681_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ins.2011.05.016","volume":"194","author":"E Baralis","year":"2012","unstructured":"Baralis E, Cagliero L, Cerquitelli T, Garza P (2012) Generalized association rule mining with constraints. Inf Sci 194:68\u201384","journal-title":"Inf Sci"},{"issue":"5","key":"2681_CR18","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1109\/69.806937","volume":"11","author":"J Han","year":"1999","unstructured":"Han J, Fu Y (1999) Mining multiple-level association rules in large databases. IEEE Trans Knowl Data Eng 11(5):798\u2013805","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2681_CR19","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-45372-5_59","volume":"1910","author":"CL Lui","year":"2000","unstructured":"Lui CL, Chung FL (2000) Discovery of generalized association rules with multiple minimum supports. Eur Conf Princ Data Mining Knowl Disc 1910:510\u2013515","journal-title":"Eur Conf Princ Data Mining Knowl Disc"},{"key":"2681_CR20","doi-asserted-by":"crossref","unstructured":"Y. Liu, W. K. Liao, and A. Choudhary, \u201cA two-phase algorithm for fast discovery of high utility itemsets,\u201d in the 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, vol. 3518, pp. 689\u2013695, 2005","DOI":"10.1007\/11430919_79"},{"issue":"8","key":"2681_CR21","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie BE, Wu CW, Yu PS (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2681_CR22","doi-asserted-by":"crossref","unstructured":"M. Liu and J. Qu, \u201cMining high utility itemsets without candidate generation,\u201d in the 21st ACM International Conference on Information and Knowledge Management, pp. 55\u201364, 2012","DOI":"10.1145\/2396761.2396773"},{"key":"2681_CR23","doi-asserted-by":"crossref","unstructured":"J. Liu, K. Wang, and B. C. M. Fung, \u201cDirect discovery of high utility itemsets without candidate generation,\u201d in Proceedings - IEEE International Conference on Data Mining, ICDM, pp. 984\u2013989, 2012","DOI":"10.1109\/ICDM.2012.20"},{"key":"2681_CR24","doi-asserted-by":"crossref","unstructured":"P. Fournier-Viger, C. W. Wu, S. Zida, and V. S. Tseng, \u201cFHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning,\u201d in International Symposium on Methodologies for Intelligent Systems, vol. 8502 LNAI, pp. 83\u201392, 2014","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"9","key":"2681_CR25","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1007\/s10489-017-1130-x","volume":"48","author":"Z-H Deng","year":"2018","unstructured":"Deng Z-H (2018) An efficient structure for fast mining high utility itemsets. Appl Intell 48(9):3161\u20133177","journal-title":"Appl Intell"},{"issue":"2","key":"2681_CR26","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, Wu CW, Tseng VS (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625","journal-title":"Knowl Inf Syst"},{"key":"2681_CR27","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","journal-title":"Expert Syst Appl"},{"key":"2681_CR28","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, Vo B, Fournier-Viger P, Tseng VS (2019) Mining high-utility itemsets in dynamic profit databases. Knowl-Based Syst 175:130\u2013144","journal-title":"Knowl-Based Syst"},{"key":"2681_CR29","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","volume":"481","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Zhang Y, Chun-Wei Lin J, Fujita H, Koh YS (2019) Mining local and peak high utility itemsets. Inf Sci 481:344\u2013367","journal-title":"Inf Sci"},{"key":"2681_CR30","doi-asserted-by":"publisher","first-page":"106596","DOI":"10.1016\/j.knosys.2020.106596","volume":"212","author":"Y Baek","year":"2021","unstructured":"Baek Y, Yun U, Kim H, Kim J, Vo B, Truong T, Deng Z-H (2021) Approximate high utility itemset mining in noisy environments. Knowl-Based Syst 212:106596","journal-title":"Knowl-Based Syst"},{"key":"2681_CR31","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Vu VV, Lam MTH, Duong TTM, Manh LT, Nguyen TTT, Vo B, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78\u201399","journal-title":"Inf Sci"},{"key":"2681_CR32","doi-asserted-by":"publisher","first-page":"109928","DOI":"10.1109\/ACCESS.2020.3001975","volume":"8","author":"T Wei","year":"2020","unstructured":"Wei T, Wang B, Zhang Y, Hu K, Yao Y, Liu H (2020) FCHUIM: efficient frequent and closed high-utility Itemsets mining. IEEE Access 8:109928\u2013109939","journal-title":"IEEE Access"},{"issue":"2","key":"2681_CR33","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1080\/01969722.2019.1705549","volume":"51","author":"LTT Nguyen","year":"2020","unstructured":"Nguyen LTT, Vu DB, Nguyen TDD, Vo B (2020) Mining maximal high utility Itemsets on dynamic profit databases. Cybern Syst 51(2):140\u2013160","journal-title":"Cybern Syst"},{"key":"2681_CR34","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.future.2019.09.024","volume":"103","author":"U Yun","year":"2020","unstructured":"Yun U, Nam H, Kim J, Kim H, Baek Y, Lee J, Yoon E, Truong T, Vo B, Pedrycz W (2020) Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Futur Gener Comput Syst 103:58\u201378","journal-title":"Futur Gener Comput Syst"},{"key":"2681_CR35","doi-asserted-by":"crossref","unstructured":"G. Srivastava, J. C. Lin, M. Pirouz, Y. Li, and U. Yun, \u201cA Pre-large Weighted-Fusion System of Sensed High-Utility Patterns,\u201d IEEE Sensors Journal, p. 1, 2020","DOI":"10.1109\/JSEN.2020.2991045"},{"key":"2681_CR36","doi-asserted-by":"publisher","first-page":"90465","DOI":"10.1109\/ACCESS.2020.2994059","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo B, Nguyen LV, Vu VV, Lam MTH, Duong TTM, Manh LT, Nguyen TTT, Nguyen LTT, Hong T-P (2020) Mining correlated high utility Itemsets in one phase. IEEE Access 8:90465\u201390477","journal-title":"IEEE Access"},{"key":"2681_CR37","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ins.2019.07.005","volume":"504","author":"W Gan","year":"2019","unstructured":"Gan W, Lin JC-W, Chao H-C, Fujita H, Yu PS (2019) Correlated utility-based pattern mining. Inf Sci 504:470\u2013486","journal-title":"Inf Sci"},{"key":"2681_CR38","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ins.2019.10.033","volume":"513","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JC-W, Zhang J, Chao H-C, Fujita H, Yu PS (2020) ProUM: projection-based utility mining on sequence data. Inf Sci 513:222\u2013240","journal-title":"Inf Sci"},{"key":"2681_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2020.03.030","volume":"529","author":"H Nam","year":"2020","unstructured":"Nam H, Yun U, Yoon E, Lin JC-W (2020) Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions. Inf Sci 529:1\u201327","journal-title":"Inf Sci"},{"key":"2681_CR40","doi-asserted-by":"publisher","first-page":"85890","DOI":"10.1109\/ACCESS.2020.2992729","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo B, Nguyen LTT, Nguyen TDD, Fournier-Viger P, Yun U (2020) A multi-Core approach to efficiently mining high-utility Itemsets in dynamic profit databases. IEEE Access 8:85890\u201385899","journal-title":"IEEE Access"},{"key":"2681_CR41","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2020.12.004","volume":"553","author":"JM-T Wu","year":"2021","unstructured":"Wu JM-T, Srivastava G, Wei M, Yun U, Lin JC-W (2021) Fuzzy high-utility pattern mining in parallel and distributed Hadoop framework. Inf Sci 553:31\u201348","journal-title":"Inf Sci"},{"key":"2681_CR42","doi-asserted-by":"crossref","unstructured":"C.-W. Lin, T.-P. Hong, and W.-H. Lu, \u201cEfficiently Mining High Average Utility Itemsets with a Tree Structure,\u201d in Intelligent Information and Database Systems, pp. 131\u2013139, 2010","DOI":"10.1007\/978-3-642-12145-6_14"},{"issue":"2","key":"2681_CR43","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Li T, Fournier-Viger P, Hong TP, Zhan J, Voznak M (2016) An efficient algorithm to mine high average-utility itemsets. Adv Eng Inform 30(2):233\u2013243","journal-title":"Adv Eng Inform"},{"key":"2681_CR44","doi-asserted-by":"publisher","first-page":"12927","DOI":"10.1109\/ACCESS.2017.2717438","volume":"5","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Ren S, Fournier-Viger P, Hong TP (2017) EHAUPM: efficient high average-utility pattern mining with tighter upper bounds. IEEE Access 5:12927\u201312940","journal-title":"IEEE Access"},{"key":"2681_CR45","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.future.2020.04.027","volume":"111","author":"J Kim","year":"2020","unstructured":"Kim J, Yun U, Yoon E, Lin JC-W, Fournier-Viger P (2020) One scan based high average-utility pattern mining in static and dynamic databases. Futur Gener Comput Syst 111:143\u2013158","journal-title":"Futur Gener Comput Syst"},{"key":"2681_CR46","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y, Kim J, Vo B, Yoon E, Fujita H (2021) Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf Sci 543:85\u2013105","journal-title":"Inf Sci"},{"key":"2681_CR47","doi-asserted-by":"crossref","unstructured":"M. Nouioua, Y. Wang, P. Fournier-Viger, J. C.-W. Lin, and J. M.-T. Wu, \u201cTKC: Mining Top-K Cross-Level High Utility Itemsets,\u201d in 2020 International Conference on Data Mining Workshops (ICDMW), pp. 673\u2013682, 2020","DOI":"10.1109\/ICDMW51313.2020.00095"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02681-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02681-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02681-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T05:23:37Z","timestamp":1646457817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02681-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,13]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["2681"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02681-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,13]]},"assertion":[{"value":"11 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}