{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:56:57Z","timestamp":1770357417946,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10489-022-03580-7","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T02:02:18Z","timestamp":1649728938000},"page":"121-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A new approach for efficiently mining frequent weighted utility patterns"],"prefix":"10.1007","volume":"53","author":[{"given":"Ham","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Nguyen","family":"Le","sequence":"additional","affiliation":[]},{"given":"Huong","family":"Bui","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0909-4974","authenticated-orcid":false,"given":"Tuong","family":"Le","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,12]]},"reference":[{"issue":"4","key":"3580_CR1","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1002\/widm.1181","volume":"6","author":"L Tuong","year":"2016","unstructured":"Tuong L, Vo B (2016) The lattice-based approaches for mining association rules: a review. Wiley Interdiscip Rev Data Min Knowl Discov 6(4):140\u2013151","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"issue":"3","key":"3580_CR2","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10489-014-0551-z","volume":"41","author":"B Vo","year":"2014","unstructured":"Vo B, Le T, Hong T-P, Le B (2014) An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining. Appl Intell 41(3):759\u2013775","journal-title":"Appl Intell"},{"key":"3580_CR3","doi-asserted-by":"publisher","first-page":"74890","DOI":"10.1109\/ACCESS.2019.2911573","volume":"7","author":"S Zhang","year":"2019","unstructured":"Zhang S, Zhang Y, Yin L, Yuan T, Wu Z, Luo H (2019) Mining frequent items over the distributed hierarchical continuous weighted data streams in Internet of Things. IEEE Access 7:74890\u201374898","journal-title":"IEEE Access"},{"key":"3580_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal Rakesh T, Imieli\u0144ski, Swami A (1993) Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD international conference on Management of data, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"issue":"1","key":"3580_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"H Jiawei","year":"2004","unstructured":"Jiawei H, PeiJ Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"3580_CR6","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":"9","key":"3580_CR7","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z-H Deng","year":"2012","unstructured":"Deng Z-H, Wang ZH, Jiang JJ (2012) A new algorithm for fast mining frequent itemsets using N-lists. Sci China Inform Sci 55(9):2008\u20132030","journal-title":"Sci China Inform Sci"},{"issue":"13","key":"3580_CR8","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"Z-H Deng","year":"2015","unstructured":"Deng Z-H, Lv S-L (2015) PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children\u2013Parent Equivalence pruning. Expert Syst Appl 42(13):5424\u20135432","journal-title":"Expert Syst Appl"},{"key":"3580_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"Z-H Deng","year":"2016","unstructured":"Deng Z-H (2016) DiffNodesets: An efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"issue":"2","key":"3580_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s13042-014-0252-2","volume":"7","author":"B Vo","year":"2016","unstructured":"Vo B, Le T, Coenen F, Tzung-Pei H (2016) Mining frequent itemsets using the N-list and subsume concepts. Int J Mach Learn Cybernet 7(2):253\u2013265","journal-title":"Int J Mach Learn Cybernet"},{"issue":"3","key":"3580_CR11","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1007\/s10489-020-01899-7","volume":"51","author":"B Huong","year":"2021","unstructured":"Huong B, Vo B, Nguyen-Hoang T-A, Yun U (2021) Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy. Appl Intell 51(3):1439\u20131459","journal-title":"Appl Intell"},{"key":"3580_CR12","doi-asserted-by":"crossref","unstructured":"Huong B, Nguyen-Hoang T-A, Vo\u00a0B, Nguyen H, Le T (2021) A sliding window-based approach for mining frequent weighted patterns over data streams. IEEE Access 9:56318\u201356329","DOI":"10.1109\/ACCESS.2021.3070132"},{"key":"3580_CR13","doi-asserted-by":"publisher","first-page":"106064","DOI":"10.1016\/j.knosys.2020.106064","volume":"201","author":"B Vo","year":"2020","unstructured":"Vo B, Bui H, Vo T, Le T (2020) Mining top-rank-k frequent weighted itemsets using WN-list structures and an early pruning strategy. Knowl Based Syst 201:106064","journal-title":"Knowl Based Syst"},{"issue":"11","key":"3580_CR14","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1002\/int.22269","volume":"35","author":"B Yoonji","year":"2020","unstructured":"Yoonji B, Yun U, Lin JCW, Yoon E, Fujita H (2020) Efficiently mining erasable stream patterns for intelligent systems over uncertain data. Int J Intell Syst 35(11):1699\u20131734","journal-title":"Int J Intell Syst"},{"issue":"2","key":"3580_CR15","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10489-018-1280-5","volume":"49","author":"L Tuong","year":"2019","unstructured":"Tuong L, Vo B, Fournier-Viger P, Lee MY, Sung Wook Baik (2019) SPPC: a new tree structure for mining erasable patterns in data streams. Appl Intell 49(2):478\u2013495","journal-title":"Appl Intell"},{"key":"3580_CR16","doi-asserted-by":"publisher","first-page":"3111","DOI":"10.1109\/ACCESS.2017.2676803","volume":"5","author":"B Vo","year":"2017","unstructured":"Vo B, Le T, Tzung-Pei H (2017) Efficient algorithms for mining erasable closed patterns from product datasets. IEEE Access 5:3111\u20133120","journal-title":"IEEE Access"},{"key":"3580_CR17","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In Proceedings of the 21st ACM international conference on Information and knowledge management, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"3580_CR18","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-k, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, Berlin, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"3580_CR19","doi-asserted-by":"crossref","unstructured":"Bui Huong B, Vo, Nguyen H (2016) WUN-miner: A new method for mining frequent weighted utility itemsets. In:\u00a02016 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE,\u00a0pp 001365\u2013001370","DOI":"10.1109\/SMC.2016.7844428"},{"key":"3580_CR20","doi-asserted-by":"crossref","unstructured":"Duy HN, Bay VD, Tzung-Pei H (2015) MBiS: an efficient method for mining frequent weighted utility itemsets from quantitative databases. J Comput Sci Cybern 31(1):17\u201330","DOI":"10.15625\/1813-9663\/31\/1\/5154"},{"issue":"8","key":"3580_CR21","doi-asserted-by":"publisher","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","volume":"41","author":"Y Unil","year":"2014","unstructured":"Unil Y, Ryang H, Ryu KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41(8):3861\u20133878","journal-title":"Expert Syst Appl"},{"issue":"2","key":"3580_CR22","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10115-016-0989-x","volume":"51","author":"R Heungmo","year":"2017","unstructured":"Heungmo R, Yun U (2017) Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques. Knowl Inf Syst 51(2):627\u2013659","journal-title":"Knowl Inf Syst"},{"issue":"7","key":"3580_CR23","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s10489-017-1057-2","volume":"48","author":"Q-H Duong","year":"2018","unstructured":"Duong Q-H, Fournier-Viger P, Ramampiaro H, N\u00f8rv\u00e5g K, Dam T-L (2018) Efficient high utility itemset mining using buffered utility-lists. Appl Intell 48(7):1859\u20131877","journal-title":"Appl Intell"},{"key":"3580_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-04921-8_5","volume-title":"High-Utility Pattern Mining","author":"J-F Qu","year":"2019","unstructured":"Qu J-F, Liu M, Fournier-Viger P (2019) Efficient algorithms for high utility itemset mining without candidate generation. High-Utility Pattern Mining. Springer, Cham, pp 131\u2013160"},{"key":"3580_CR25","unstructured":"Vikram G, Sureka A, Patel D (2015) Efficient skyline itemsets mining. In: Proceedings of the Eighth International C* Conference on Computer Science & Software Engineering, pp 119\u2013124"},{"issue":"6","key":"3580_CR26","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.3233\/IDA-163180","volume":"21","author":"P Jeng-Shyang","year":"2017","unstructured":"Jeng-Shyang P, Lin JC-H, Yang L, Fournier-Viger P, Hong T-P (2017) Efficiently mining of skyline frequent-utility patterns. Intell Data Anal 21(6):1407\u20131423","journal-title":"Intell Data Anal"},{"key":"3580_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.engappai.2018.10.010","volume":"77","author":"LJ Chun-Wei","year":"2019","unstructured":"Chun-Wei LJ, Yang Lu, Tzung-Pei H (2019) Mining of skyline patterns by considering both frequent and utility constraints. Eng Appl Artif Intell 77:229\u2013238","journal-title":"Eng Appl Artif Intell"},{"key":"3580_CR28","doi-asserted-by":"crossref","unstructured":"Vo B, Le B, Jung JJ (2012) A tree-based approach for mining frequent weighted utility itemsets. In: International Conference on Computational Collective Intelligence. Springer, Berlin, pp. 114\u2013123","DOI":"10.1007\/978-3-642-34630-9_12"},{"issue":"10","key":"3580_CR29","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"Z-H Deng","year":"2014","unstructured":"Deng Z-H, Sheng-Long Lv (2014) Fast mining frequent itemsets using Nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"key":"3580_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-04921-8","volume-title":"High-utility pattern mining","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Chun-Wei Lin J, Truong-Chi T, Nkambou R (2019) A survey of high utility itemset mining. High-utility pattern mining. Springer, Cham, pp 1\u201345"},{"key":"3580_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"K Heonho","year":"2021","unstructured":"Heonho K, 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. Inform Sci 543:85\u2013105","journal-title":"Inform Sci"},{"key":"3580_CR32","doi-asserted-by":"publisher","first-page":"106596","DOI":"10.1016\/j.knosys.2020.106596","volume":"212","author":"B Yoonji","year":"2021","unstructured":"Yoonji B, 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"},{"issue":"10","key":"3580_CR33","doi-asserted-by":"publisher","first-page":"5741","DOI":"10.1002\/int.22528","volume":"36","author":"K Jongseong","year":"2021","unstructured":"Jongseong K, Yun U, Kim H, Ryu T, Chun-Wei Lin J, Fournier\u2010Vier P, Pedrycz W (2021) Average utility driven data analytics on damped windows for intelligent systems with data streams. Int J Intell Syst 36(10):5741\u20135769","journal-title":"Int J Intell Syst"},{"key":"3580_CR34","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.engappai.2018.03.020","volume":"72","author":"L Judae","year":"2018","unstructured":"Judae L, Yun U, Lee G, Yoon E (2018) Efficient incremental high utility pattern mining based on pre-large concept. Eng Appl Artif Intell 72:111\u2013123","journal-title":"Eng Appl Artif Intell"},{"key":"3580_CR35","doi-asserted-by":"publisher","first-page":"50958","DOI":"10.1109\/ACCESS.2020.2979289","volume":"8","author":"N Hyoju","year":"2020","unstructured":"Hyoju N, Yun U, Vo B, Truong T, Deng Z-H, Yoon E (2020) Efficient approach for damped window-based high utility pattern mining with list structure. IEEE Access 8:50958\u201350968","journal-title":"IEEE Access"},{"key":"3580_CR36","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.future.2019.09.024","volume":"103","author":"Y Unil","year":"2020","unstructured":"Unil Y, 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. Future Gener Comput Syst 103:58\u201378","journal-title":"Future Gener Comput Syst"},{"key":"3580_CR37","unstructured":"Vid P, Lavrac N, Kononenko I (2007) A fast algorithm for mining utility-frequent itemsets. Constraint-Based Mining and Learning :9"},{"key":"3580_CR38","doi-asserted-by":"crossref","unstructured":"Yeh J-S, Li Y-C, Chang C-C (2007) Two-phase algorithms for a novel utility-frequent mining model. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, Berlin, pp 433\u2013444","DOI":"10.1007\/978-3-540-77018-3_43"},{"key":"3580_CR39","unstructured":"Sulaiman KM, Muyeba M, Coenen F (2008) A weighted utility framework for mining association rules. In:\u00a02008 Second UKSIM European Symposium on Computer Modeling and Simulation. IEEE,\u00a0pp 87\u201392"},{"issue":"3","key":"3580_CR40","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/01969722.2016.1276774","volume":"48","author":"T Tram","year":"2017","unstructured":"Tram T, Vo B, Le TTN, Nguyen NT (2017) Text clustering using frequent weighted utility itemsets. Cybernet Syst 48(3):193\u2013209","journal-title":"Cybernet Syst"},{"key":"3580_CR41","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1016\/j.asoc.2017.09.033","volume":"62","author":"L Zhang","year":"2018","unstructured":"Zhang L, Fu G, Cheng F, Qiu J, Su Y (2018) A multi-objective evolutionary approach for mining frequent and high utility itemsets. Appl Soft Comput 62:974\u2013986","journal-title":"Appl Soft Comput"},{"key":"3580_CR42","doi-asserted-by":"publisher","first-page":"107709","DOI":"10.1016\/j.knosys.2021.107709","volume":"237","author":"H Nguyen","year":"2022","unstructured":"Nguyen H, Le T, Nguyen M, Fournier-Viger P, Tseng VS, Vo B (2022) Mining frequent weighted utility itemsets in hierarchical quantitative databases. Knowl Based Syst 237:107709","journal-title":"Knowl Based Syst"},{"key":"3580_CR43","unstructured":"Frequent itemset mining dataset repository. Available:\u00a0http:\/\/fimi.ua.ac.be\/data\/. Accessed 25 Aug 2021"},{"key":"3580_CR44","unstructured":"An open-source data mining library. Available: http:\/\/www.philippe-fournier-viger.com\/spmf\/index.php?link=datasets.php. Accessed 25 Aug 2021"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03580-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03580-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03580-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T04:33:26Z","timestamp":1672720406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03580-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,12]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["3580"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03580-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,12]]},"assertion":[{"value":"1 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}