{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T09:53:53Z","timestamp":1773309233112,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T00:00:00Z","timestamp":1593475200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T00:00:00Z","timestamp":1593475200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>High-utility itemset mining (HUIM) is considered as an emerging approach to detect the high-utility patterns from databases. Most existing algorithms of HUIM only consider the itemset utility regardless of the length. This limitation raises the utility as a result of a growing itemset size. High average-utility itemset mining (HAUIM) considers the size of the itemset, thus providing a more balanced scale to measure the average-utility for decision-making. Several algorithms were presented to efficiently mine the set of high average-utility itemsets (HAUIs) but most of them focus on handling static databases. In the past, a fast-updated (FUP)-based algorithm was developed to efficiently handle the incremental problem but it still has to re-scan the database when the itemset in the original database is small but there is a high average-utility upper-bound itemset (HAUUBI) in the newly inserted transactions. In this paper, an efficient framework called PRE-HAUIMI for transaction insertion in dynamic databases is developed, which relies on the average-utility-list (AUL) structures. Moreover, we apply the pre-large concept on HAUIM. A pre-large concept is used to speed up the mining performance, which can ensure that if the total utility in the newly inserted transaction is within the safety bound, the small itemsets in the original database could not be the large ones after the database is updated. This, in turn, reduces the recurring database scans and obtains the correct HAUIs. Experiments demonstrate that the PRE-HAUIMI outperforms the state-of-the-art batch mode HAUI-Miner, and the state-of-the-art incremental IHAUPM and FUP-based algorithms in terms of runtime, memory, number of assessed patterns and scalability.<\/jats:p>","DOI":"10.1007\/s10489-020-01743-y","type":"journal-article","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T11:04:42Z","timestamp":1593515082000},"page":"3788-3807","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Incrementally updating the high average-utility patterns with pre-large concept"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matin","family":"Pirouz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youcef","family":"Djenouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chien-Fu","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Usman","family":"Ahmed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"1743_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. The International Conference on Very Large Data Bases, pp 487\u2013499"},{"key":"1743_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1994) Quest synthetic data generator. http:\/\/www.Almaden.ibm.com\/cs\/quest\/syndata.html","DOI":"10.1145\/191843.191972"},{"issue":"12","key":"1743_CR3","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1743_CR4","doi-asserted-by":"crossref","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2008) Efficient mining of high utility itemsets from large datasets. The Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp 554\u2013561","DOI":"10.1007\/978-3-540-68125-0_50"},{"key":"1743_CR5","doi-asserted-by":"crossref","unstructured":"Cheung DW, Wong CY, Han J, Ng VT (1996) Maintenance of discovered association rules in large databases: an incremental updating techniques. The International Conference on Data Engineering, pp 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"issue":"2","key":"1743_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"MS Chen","year":"1998","unstructured":"Chen MS, Park JS, Yu PS (1998) Efficient data mining for path traversal patterns. IEEE Trans Knowledge Data Eng 10(2):209\u2013221","journal-title":"IEEE Trans Knowledge Data Eng"},{"issue":"1","key":"1743_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1093\/bioinformatics\/19.1.79","volume":"19","author":"C Creighton","year":"2003","unstructured":"Creighton C, Hanash S (2003) Mining gene expression databases for association rules. Bioinformatics 19(1):79\u201386","journal-title":"Bioinformatics"},{"issue":"10","key":"1743_CR8","doi-asserted-by":"crossref","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"Z Deng","year":"2014","unstructured":"Deng Z, Lv SL (2014) Fast mining frequent itemsets using nodesets. Expert Syst Appl 41 (10):4505\u20134512","journal-title":"Expert Syst Appl"},{"key":"1743_CR9","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. Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"1743_CR10","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S, Lin JCW, Wu CW, Tseng VS (2016) EFIM-closed: fast and memory efficient discovery of closed high-utility itemsets. International Conference on Machine Learning and Data Mining in Pattern Recognition, pp 199\u2013213","DOI":"10.1007\/978-3-319-41920-6_15"},{"key":"1743_CR11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.ins.2019.03.050","volume":"489","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Li Z, Lin JCW, Kira RU, Fujita H (2019) Efficient algorithms to identify periodic patterns in multiple sequences. Inform Sci 489:205\u2013226","journal-title":"Inform Sci"},{"key":"1743_CR12","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.ins.2019.07.005","volume":"504","author":"W Gan","year":"2019","unstructured":"Gan W, Lin JCW, Chao HC, Fujita H, Yu PS (2019) Correlated utility-based pattern mining. Inf Sci 504:470\u2013486","journal-title":"Inf Sci"},{"key":"1743_CR13","doi-asserted-by":"crossref","unstructured":"Le NT, Vo B, Nguyen LBQ, Fujita H, Le B (2020) Mining weighted subgraphs in a single large graph. Inf Sci 514:149\u2013165","DOI":"10.1016\/j.ins.2019.12.010"},{"key":"1743_CR14","doi-asserted-by":"crossref","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 itemsets. Intelligence Data Analysis 5:111\u2013129","journal-title":"Intelligence Data Analysis"},{"issue":"1","key":"1743_CR15","doi-asserted-by":"crossref","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":"4","key":"1743_CR16","doi-asserted-by":"crossref","first-page":"2424","DOI":"10.1016\/j.eswa.2007.04.009","volume":"34","author":"TP Hong","year":"2008","unstructured":"Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34(4):2424\u20132435","journal-title":"Expert Syst Appl"},{"issue":"7","key":"1743_CR17","doi-asserted-by":"crossref","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\u2013 8265","journal-title":"Expert Syst Appl"},{"key":"1743_CR18","doi-asserted-by":"crossref","unstructured":"Krishnamoorthy S (2019) A comparative study of top-K high utility itemset mining methods. High-Utility Pattern Mining, pp 47\u201374","DOI":"10.1007\/978-3-030-04921-8_2"},{"key":"1743_CR19","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A fast high utility itemsets mining algorithm. The International Workshop on Utility-Based Data Mining, pp 90\u201399","DOI":"10.1145\/1089827.1089839"},{"key":"1743_CR20","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. The Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"issue":"1","key":"1743_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese C, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Transactions of Knowledge and Data Engineering 18(1):21\u201336","journal-title":"IEEE Transactions of Knowledge and Data Engineering"},{"issue":"8","key":"1743_CR22","doi-asserted-by":"crossref","first-page":"7173","DOI":"10.1016\/j.eswa.2012.01.072","volume":"39","author":"CW Lin","year":"2009","unstructured":"Lin CW, Lan GC, Hong TP (2009) An incremental mining algorithm for high utility itemsets. Expert Syst Appl 39(8):7173\u2013 7180","journal-title":"Expert Syst Appl"},{"key":"1743_CR23","doi-asserted-by":"crossref","unstructured":"Lin CW, Hong TP, Lu WH (2010) Maintaining high utility pattern trees in dynamic databases. The International Conference on Computer Engineering and Applications. pp, 304\u2013308","DOI":"10.1109\/ICCEA.2010.67"},{"key":"1743_CR24","doi-asserted-by":"crossref","unstructured":"Lin CW, Hong TP, Lu WH (2010) Efficiently mining high average utility itemsets with a tree structure. The Asian Conference on Intelligent Information and Database Systems, pp 131\u2013139","DOI":"10.1007\/978-3-642-12145-6_14"},{"issue":"6","key":"1743_CR25","doi-asserted-by":"crossref","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\u2013 7424","journal-title":"Expert Syst Appl"},{"key":"1743_CR26","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K, Fung BCM (2012) Direct discovery of high utility itemsets without candidate generation. IEEE International Conference on Data Mining, pp 984\u2013989","DOI":"10.1109\/ICDM.2012.20"},{"key":"1743_CR27","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. ACM International Conference on Information and Knowledge Management, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"1743_CR28","first-page":"193","volume":"28","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng VS (2012) A projection-based approach for discovering high average-utility itemsets. J Inf Sci Eng 28:193\u2013209","journal-title":"J Inf Sci Eng"},{"key":"1743_CR29","doi-asserted-by":"crossref","unstructured":"Lu T, Vo B, Nguyen HT, Hong TP (2014) A new method for mining high average utility itemsets. Computer Information Systems and Industrial Management, pp 33\u201342","DOI":"10.1007\/978-3-662-45237-0_5"},{"issue":"5","key":"1743_CR30","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","volume":"28","author":"J Liu","year":"2016","unstructured":"Liu J, Wang K, Fung BCM (2016) 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"},{"issue":"2","key":"1743_CR31","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"CW Lin","year":"2016","unstructured":"Lin CW, 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":"1743_CR32","doi-asserted-by":"crossref","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-bound models. IEEE Access 5:12927\u201312940","journal-title":"IEEE Access"},{"key":"1743_CR33","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.engappai.2018.03.021","volume":"72","author":"JCW Lin","year":"2018","unstructured":"Lin JCW, Ren S, Fournier-Viger P, Pan JS, Hong TP (2018) Efficiently updating the discovered high average-utility itemsets with transaction insertion. Eng Appl Artif Intell 72:136\u2013149","journal-title":"Eng Appl Artif Intell"},{"key":"1743_CR34","doi-asserted-by":"crossref","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"},{"issue":"8","key":"1743_CR35","doi-asserted-by":"crossref","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":"1743_CR36","doi-asserted-by":"crossref","unstructured":"Wu TY, Lin JCW, Shao Y, Fournier-Viger P, Hong TP (2018) Updating the discovered high average-utility patterns with transaction insertion. The International Conference on Genetic and Evolutionary Computing, pp 66\u201373","DOI":"10.1007\/978-981-10-6487-6_9"},{"key":"1743_CR37","first-page":"1","volume":"2020","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. Journal of Intelligent & Fuzzy Systems 2020:1\u201310","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"1743_CR38","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. SIAM International Conference on Data Mining, pp 215\u2013221","DOI":"10.1137\/1.9781611972740.51"},{"key":"1743_CR39","doi-asserted-by":"crossref","unstructured":"Yen SJ, Lee YS (2007) Mining high utility quantitative association rules. The International Conference on Data Warehousing and Knowledge Discovery, pp 283\u2013292","DOI":"10.1007\/978-3-540-74553-2_26"},{"key":"1743_CR40","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","volume":"68","author":"U Yun","year":"2017","unstructured":"Yun U, Kim D (2017) Mining of high average-utility itemsets using novel list structure and pruning strategy. Future Generation Computer System 68:346\u2013360","journal-title":"Future Generation Computer System"},{"key":"1743_CR41","doi-asserted-by":"crossref","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":"1743_CR42","doi-asserted-by":"crossref","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: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-020-01743-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01743-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01743-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:21:14Z","timestamp":1625008874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01743-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,30]]},"references-count":42,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1743"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01743-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,30]]},"assertion":[{"value":"30 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}