{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T02:15:19Z","timestamp":1770344119923,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"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,8]]},"DOI":"10.1007\/s10489-023-04554-z","type":"journal-article","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T11:03:13Z","timestamp":1678446193000},"page":"19629-19646","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mining frequent weighted utility patterns with dynamic weighted items from quantitative databases"],"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":[[2023,3,10]]},"reference":[{"key":"4554_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: SIGMOD '93 proceedings of the 1993 ACM SIGMOD international conference on management of data","DOI":"10.1145\/170035.170072"},{"key":"4554_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: The 20th VLDB conference, Santiago, Chile"},{"key":"4554_CR3","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: The 2000 ACM SIGMOD international conference on Management of Data","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"4554_CR4","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":"4554_CR5","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z Deng","year":"2012","unstructured":"Deng Z, Wang Z, Jiang J (2012) A new algorithm for fast mining frequent itemsets using N-lists. Sci China Inf Sci 55(9):2008\u20132030","journal-title":"Sci China Inf Sci"},{"issue":"3","key":"4554_CR6","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, 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"},{"issue":"2","key":"4554_CR7","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, Hong T (2016) Mining frequent itemsets using the N-list and subsume concepts. Int J Mach Learn Cybern 7(2):253\u2013265","journal-title":"Int J Mach Learn Cybern"},{"key":"4554_CR8","doi-asserted-by":"crossref","unstructured":"Tao F, Murtagh F, Farid M (2003) Weighted association rule mining using weighted support and significance framework. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, USA","DOI":"10.1145\/956750.956836"},{"issue":"4","key":"4554_CR9","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.eswa.2012.08.065","volume":"40","author":"B Vo","year":"2013","unstructured":"Vo B, Coenen F, Le B (2013) A new method for mining frequent weighted itemsets based on WIT-tree. Expert Syst Appl 40(4):1256\u20131264","journal-title":"Expert Syst Appl"},{"issue":"1","key":"4554_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S0218488517500052","volume":"25","author":"G Lee","year":"2017","unstructured":"Lee G, Yun U, Ryu K (2017) Mining frequent weighted itemsets without storing transaction IDs and generating candidates. Int J Uncertain Fuzziness Knowl-Based Syst 25(1):111\u2013144","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"key":"4554_CR11","unstructured":"Nguyen H, Vo B, Nguyen MTH, Hong T (2015) An improved algorithm for mining frequent weighted Itemsets. In: 2015 IEEE international conference on systems, man, and cybernetics, Hong Kong, China"},{"issue":"4","key":"4554_CR12","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1007\/s10489-016-0799-6","volume":"45","author":"H Nguyen","year":"2016","unstructured":"Nguyen H, Vo B, Nguyen M, Pedrycz W (2016) An efficient algorithm for mining frequent weighted itemsets using interval word segments. Appl Intell 45(4):1008\u20131020","journal-title":"Appl Intell"},{"key":"4554_CR13","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":"4554_CR14","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.eswa.2017.10.039","volume":"96","author":"H Bui","year":"2018","unstructured":"Bui H, Vo B, Nguyen H, Nguyen-Hoang TA, Hong TP (2018) A weighted N-list-based method for mining frequent weighted itemsets. Expert Syst Appl 96:388\u2013405","journal-title":"Expert Syst Appl"},{"key":"4554_CR15","doi-asserted-by":"crossref","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\u2013202:106064","DOI":"10.1016\/j.knosys.2020.106064"},{"key":"4554_CR16","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1007\/s10489-020-01899-7","volume":"51","author":"H Bui","year":"2020","unstructured":"Bui H, Vo B, Nguyen-Hoang TA, Yun U (2020) Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy. Appl Intell 51:1439\u20131459","journal-title":"Appl Intell"},{"key":"4554_CR17","doi-asserted-by":"publisher","first-page":"56318","DOI":"10.1109\/ACCESS.2021.3070132","volume":"9","author":"H Bui","year":"2021","unstructured":"Bui H, Nguyen-Hoang TA, Vo B, Nguyen H, Le T (2021) A sliding window-based approach for mining frequent weighted patterns over data streams. IEEE Access 9:56318\u201356329","journal-title":"IEEE Access"},{"issue":"1","key":"4554_CR18","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, Nguyen G, Hong T-P (2017) Efficient algorithms for mining erasable closed patterns from product datasets. IEEE Access 5(1):3111\u20133120","journal-title":"IEEE Access"},{"issue":"11","key":"4554_CR19","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1002\/int.22269","volume":"35","author":"Y Baek","year":"2020","unstructured":"Baek Y, 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":"1","key":"4554_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10489-014-0644-8","volume":"43","author":"G Nguyen","year":"2015","unstructured":"Nguyen G, Le T, Vo B, Le B (2015) EIFDD: an efficient approach for erasable itemset mining of very dense datasets. Appl Intell 43(1):85\u201394","journal-title":"Appl Intell"},{"issue":"2","key":"4554_CR21","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10489-018-1280-5","volume":"49","author":"T Le","year":"2019","unstructured":"Le T, Vo B, Fournier-Viger P, Lee MY, Baik SW (2019) SPPC: a new tree structure for mining erasable patterns in data streams. Appl Intell 49(2):478\u2013495","journal-title":"Appl Intell"},{"key":"4554_CR22","doi-asserted-by":"publisher","first-page":"107422","DOI":"10.1016\/j.asoc.2021.107422","volume":"108","author":"JCW Lin","year":"2021","unstructured":"Lin JCW, Djenouri Y, Srivastava G, Yun U, Fournier-Viger P (2021) A predictive GA-based model for closed high-utility itemset mining. Appl Soft Comput 108:107422","journal-title":"Appl Soft Comput"},{"key":"4554_CR23","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 JCW (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":"4554_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106457","volume":"208","author":"JF Qu","year":"2020","unstructured":"Qu JF, Fournier-Viger P, Liu M, Hang B, Wang F (2020) Mining high utility itemsets using extended chain structure and utility machine. Knowl-Based Syst 208:106457","journal-title":"Knowl-Based Syst"},{"key":"4554_CR25","doi-asserted-by":"publisher","first-page":"106653","DOI":"10.1016\/j.knosys.2020.106653","volume":"213","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y, Kim H, Nam H, Lin JC, Fournier-Viger P (2021) Damped sliding based utility oriented pattern mining over stream data. Knowl-Based Syst 213:106653","journal-title":"Knowl-Based Syst"},{"key":"4554_CR26","doi-asserted-by":"publisher","first-page":"50958","DOI":"10.1109\/ACCESS.2020.2979289","volume":"8","author":"H Nam","year":"2020","unstructured":"Nam H, Yun U, Vo B, Truong T, Deng ZH, 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":"4554_CR27","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 JCW, 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":"4554_CR28","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","volume":"144","author":"U Yun","year":"2018","unstructured":"Yun U, Kim D, Yoon E, Fujita H (2018) Damped window based high average utility pattern mining over data streams. Knowl-Based Syst 144:188\u2013205","journal-title":"Knowl-Based Syst"},{"key":"4554_CR29","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 ZH (2021) Approximate high utility itemset mining in noisy environments. Knowl-Based Syst 212:106596","journal-title":"Knowl-Based Syst"},{"issue":"10","key":"4554_CR30","doi-asserted-by":"publisher","first-page":"5741","DOI":"10.1002\/int.22528","volume":"36","author":"J Kim","year":"2021","unstructured":"Kim J, Yun U, Kim H, Ryu T, Lin JCW (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":"4554_CR31","doi-asserted-by":"crossref","unstructured":"Bui H, Vo B, Nguyen H (2016) WUN-miner: a new method for mining frequent weighted utility itemsets. In: The 2016 IEEE conference on system, man, and cybernetics (SMC 2016), Budapest","DOI":"10.1109\/SMC.2016.7844428"},{"key":"4554_CR32","doi-asserted-by":"publisher","unstructured":"Nguyen H, Vo B, Nguyen MTH, Hong T (2015) MBiS: an efficient method for mining frequent weighted utility itemsets from quantitative databases. J Comput Sci Cybern 31. https:\/\/doi.org\/10.15625\/1813-9663\/31\/1\/5154","DOI":"10.15625\/1813-9663\/31\/1\/5154"},{"key":"4554_CR33","doi-asserted-by":"crossref","unstructured":"Khan MS, Muyeba M, Coenen F (2008) A weighted utility framework for mining association rules. In: Computer modeling and simulation, 2008","DOI":"10.1109\/EMS.2008.73"},{"key":"4554_CR34","unstructured":"Ramkumar GD, Ranka S, Tsur S (1998) Weighted association rules: model and algorithm. In: Proceedings of the fourth international conference on knowledge discovery and data mining (KDD-98), New York City, New York, USA"},{"key":"4554_CR35","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the 2004 SIAM international conference on data mining (SDM)","DOI":"10.1137\/1.9781611972740.51"},{"key":"4554_CR36","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Advances in Knowledge Discovery and Data Mining 3518:689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"4554_CR37","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu C, Shie B, Yu PS (2010) UP-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"4554_CR38","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2012","unstructured":"Tseng VS, Shie B, Wu C, Yu PS (2012) 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":"4554_CR39","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","DOI":"10.1145\/2396761.2396773"},{"key":"4554_CR40","doi-asserted-by":"crossref","unstructured":"Zida S, Fournier-Viger P, Lin JC, Wu C, Tseng VS (2015) EFIM: a highly efficient algorithm for high-utility itemset mining. In: Mexican international conference on artificial intelligence","DOI":"10.1007\/978-3-319-27060-9_44"},{"key":"4554_CR41","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":"4554_CR42","unstructured":"Podpecan V, Lavrac N, Kononenko I (2007, September) A fast algorithm for mining utility-frequent itemsets. In: International workshop on constraint-based mining and learning, Warsaw, Poland"},{"key":"4554_CR43","unstructured":"Yeh JS, Li YC, Chang CC, (2007, May) Two-phase algorithms for a novel utility-frequent mining model. In: Pacific-Asia conference on knowledge discovery and data mining, Berlin, Heidelberg"},{"key":"4554_CR44","unstructured":"Goyal V, Sureka A, Patel D (2015, July) Efficient skyline itemsets mining. In: Proceedings of the eighth international C* conference on Computer Science & Software Engineering"},{"issue":"6","key":"4554_CR45","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.3233\/IDA-163180","volume":"21","author":"JS Pan","year":"2017","unstructured":"Pan JS, Lin JCW, Yang L, Fournier-Viger P, Hong TP (2017) Efficiently mining of skyline frequent-utility patterns. Intell Data Anal 21(6):1407\u20131423","journal-title":"Intell Data Anal"},{"key":"4554_CR46","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.engappai.2018.10.010","volume":"77","author":"JCW Lin","year":"2019","unstructured":"Lin JCW, Yang L, Fournier-Viger P, Hong TP (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":"4554_CR47","doi-asserted-by":"crossref","unstructured":"Song W, Zheng C, Fournier-Viger P (2021) Mining skyline frequent-utility itemsets with utility filtering In: Pacific rim international conference on artificial intelligence","DOI":"10.1007\/978-3-030-89188-6_31"},{"issue":"10","key":"4554_CR48","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"Z Deng","year":"2014","unstructured":"Deng Z, Lv S (2014) Fast mining frequent itemsets using Nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"key":"4554_CR49","unstructured":"Rymon R (1992) Search through systematic set enumeration. In: Proceeding of the Int'l conference principles of knowledge representation and reasoning"},{"key":"4554_CR50","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF Open-Source Data Mining Library Version 2. ECML\/PKDD (3): 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04554-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04554-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04554-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T05:14:47Z","timestamp":1693199687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04554-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,10]]},"references-count":50,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["4554"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04554-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,10]]},"assertion":[{"value":"1 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2023","order":2,"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 that they have no conflicts of interest to report regarding the present study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interests\/competing interests"}}]}}