{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T10:36:36Z","timestamp":1767522996690,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T00:00:00Z","timestamp":1624320000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T00:00:00Z","timestamp":1624320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100016999","name":"Western Norway University Of Applied Sciences","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100016999","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The high average-utility itemset mining (HAUIM) was established to provide a fair measure instead of genetic high-utility itemset mining (HUIM) for revealing the satisfied and interesting patterns. In practical applications, the database is dynamically changed when insertion\/deletion operations are performed on databases. Several works were designed to handle the insertion process but fewer studies focused on processing the deletion process for knowledge maintenance. In this paper, we then develop a PRE-HAUI-DEL algorithm that utilizes the pre-large concept on HAUIM for handling transaction deletion in the dynamic databases. The pre-large concept is served as the buffer on HAUIM that reduces the number of database scans while the database is updated particularly in transaction deletion. Two upper-bound values are also established here to reduce the unpromising candidates early which can speed up the computational cost. From the experimental results, the designed PRE-HAUI-DEL algorithm is well performed compared to the Apriori-like model in terms of runtime, memory, and scalability in dynamic databases.<\/jats:p>","DOI":"10.1007\/s10489-021-02539-4","type":"journal-article","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T21:02:28Z","timestamp":1624395748000},"page":"17012-17025","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic maintenance model for high average-utility pattern mining with deletion operation"],"prefix":"10.1007","volume":"52","author":[{"given":"Jimmy Ming-Tai","family":"Wu","sequence":"first","affiliation":[]},{"given":"Qian","family":"Teng","sequence":"additional","affiliation":[]},{"given":"Shahab","family":"Tayeb","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,22]]},"reference":[{"key":"2539_CR1","unstructured":"Agarwal R, Srikant R (1994) Fast algorithms for mining association rules. In: International conference on very large data bases, vol 1215, pp 487\u2013499"},{"key":"2539_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: ACM SIGMOD International Conference on Management of Data, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"2539_CR3","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng VT, Wong C (1996) Maintenance of discovered association rules in large databases: An incremental updating technique. In: Proceedings of the Twelfth International Conference on Data Engineering, pp 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"2539_CR4","doi-asserted-by":"crossref","unstructured":"Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: Database systems for advanced applications\u2019, vol 97, pp 185\u2013194","DOI":"10.1142\/9789812819536_0020"},{"issue":"10","key":"2539_CR5","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng ZH, Lv SL (2014) Fast mining frequent itemsets using nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"key":"2539_CR6","doi-asserted-by":"crossref","unstructured":"Erwin A, Gopalan RP, Achuthan N (2008) Effcient mining of high utility itemsets from large datasets. In: Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp 554\u2013561","DOI":"10.1007\/978-3-540-68125-0_50"},{"key":"2539_CR7","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Tseng VS, Yu PS (2019a) A survey of utility-oriented pattern mining. IEEE Transactions on Knowledge and Data Engineering"},{"key":"2539_CR8","doi-asserted-by":"crossref","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Yu PS (2019b) A survey of parallel sequential pattern mining. ACM Trans Knowl Discov Data 3(3):1\u201334","DOI":"10.1145\/3314107"},{"issue":"1","key":"2539_CR9","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"},{"issue":"2","key":"2539_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.3233\/IDA-2001-5203","volume":"5","author":"TP Hong","year":"2001","unstructured":"Hong TP, Wang CY, Tao YH (2001) A new incremental data mining algorithm using pre-large. Intell Data Anal 5(2):111\u2013129","journal-title":"Intell Data Anal"},{"issue":"7","key":"2539_CR11","doi-asserted-by":"publisher","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"TP Hong","year":"2011","unstructured":"Hong TP, Lee CH, Wang SL (2011) Effective utility mining with the measure of average utility. Expert Syst Appl 38(7):8259\u20138265","journal-title":"Expert Syst Appl"},{"key":"2539_CR12","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":"2539_CR13","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"},{"issue":"5","key":"2539_CR14","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng VS (2012) Efficient mining high average-utility itemsets with an improved upper-bound strategy. Int J Inf Technol Decis Making 11(5):1009\u20131030","journal-title":"Int J Inf Technol Decis Making"},{"key":"2539_CR15","doi-asserted-by":"crossref","unstructured":"Lin CW, Hong TP, Lu WH (2010) Efficiently mining high average utility itemsets with a tree structure. In: Asian Conference on Intelligent Information and Database Systems, pp 131\u2013139","DOI":"10.1007\/978-3-642-12145-6_14"},{"issue":"6","key":"2539_CR16","doi-asserted-by":"publisher","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"CW Lin","year":"2011","unstructured":"Lin CW, Hong TP, Lu WH (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38(6):7419\u20137424","journal-title":"Expert Syst Appl"},{"key":"2539_CR17","doi-asserted-by":"crossref","unstructured":"Lin JCW, Ren S, Fournier-Viger P, Hong TP (2017a) Ehaupm: efficient high average-utility pattern mining with tighter upper-bounds. IEEE Access 5:12927\u201312940","DOI":"10.1109\/ACCESS.2017.2717438"},{"key":"2539_CR18","doi-asserted-by":"crossref","unstructured":"Lin JCW, Ren S, Fournier-Viger P, Hong TP, Su JH, Vo B (2017a) A fast algorithm for mining high average-utility itemsets. Appl Intell 47(2):331\u2013346","DOI":"10.1007\/s10489-017-0896-1"},{"issue":"1","key":"2539_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3233\/JIFS-179061","volume":"37","author":"Z Ling","year":"2019","unstructured":"Ling Z, Zengrui T, Metawa N (2019) Data mining-based competency model of innovation and entrepreneurship. J Intell Fuzzy Syst 37(1):35\u201343","journal-title":"J Intell Fuzzy Syst"},{"key":"2539_CR20","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K, Fung BC (2012) Direct discovery of high utility itemsets without candidate generation. In: International Conference on Data Mining, pp 984\u2013989","DOI":"10.1109\/ICDM.2012.20"},{"issue":"5","key":"2539_CR21","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","volume":"28","author":"J Liu","year":"2015","unstructured":"Liu J, Wang K, Fung BC (2015) Mining high utility patterns in one phase without generating candidates. IEEE Trans Knowl Data Eng 28(5):1245\u20131257","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2539_CR22","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: International Conference on Information and Knowledge Management, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"2539_CR23","doi-asserted-by":"crossref","unstructured":"Liu Y, Wk Liao, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp 689\u2013 695","DOI":"10.1007\/11430919_79"},{"key":"2539_CR24","first-page":"183","volume":"104847","author":"T Truong","year":"2019","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P, Yun U (2019) Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowl-Based Syst 104847:183","journal-title":"Knowl-Based Syst"},{"issue":"8","key":"2539_CR25","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2012","unstructured":"Tseng VS, Shie BE, Wu CW, Philip SY (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"},{"issue":"6","key":"2539_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3363571","volume":"13","author":"JMT Wu","year":"2019","unstructured":"Wu JMT, Lin JCW, Tamrakar A (2019) High-utility itemset mining with effective pruning strategies. ACM Trans Knowl Discov Data 13(6):1\u201322","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"5","key":"2539_CR27","doi-asserted-by":"publisher","first-page":"5831","DOI":"10.3233\/JIFS-179670","volume":"38","author":"JMT Wu","year":"2020","unstructured":"Wu JMT, Teng Q, Lin JCW, Yun U, Chen HC (2020) Updating high average-utility itemsets with pre-large concept. J Intell Fuzzy Syst 38(5):5831\u20135840","journal-title":"J Intell Fuzzy Syst"},{"key":"2539_CR28","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: International Conference on Data Mining, pp 215\u2013221","DOI":"10.1137\/1.9781611972740.51"},{"key":"2539_CR29","doi-asserted-by":"crossref","unstructured":"Yen SJ, Lee YS (2007) Mining high utility quantitative association rules. International Conferenceon Data Ware Housing and Knowledge Discovery, pp 283\u2013292","DOI":"10.1007\/978-3-540-74553-2_26"},{"key":"2539_CR30","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, Yoo 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":"2539_CR31","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":"2539_CR32","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.knosys.2018.09.002","volume":"163","author":"Z Zhao","year":"2019","unstructured":"Zhao Z, Li C, Zhang X, Chiclana F, Viedma EH (2019) An incremental method to detect communities in dynamic evolving social networks. Knowl-Based Syst 163:404\u2013415","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"2539_CR33","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"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02539-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02539-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02539-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T10:19:06Z","timestamp":1668853146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02539-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,22]]},"references-count":33,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2539"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02539-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2021,6,22]]},"assertion":[{"value":"18 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}