{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T11:13:11Z","timestamp":1778238791536,"version":"3.51.4"},"reference-count":55,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","award":["2018R1D1A1A09083"],"award-info":[{"award-number":["2018R1D1A1A09083"]}],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1016\/j.future.2019.09.024","type":"journal-article","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T11:14:15Z","timestamp":1569323655000},"page":"58-78","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":51,"special_numbering":"C","title":["Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases"],"prefix":"10.1016","volume":"103","author":[{"given":"Unil","family":"Yun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyoju","family":"Nam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongseong","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heonho","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoonji","family":"Baek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judae","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunchul","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tin","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Witold","family":"Pedrycz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.future.2019.09.024_b1","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","article-title":"An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies","volume":"104","author":"Duong","year":"2016","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"10.1016\/j.future.2019.09.024_b2","doi-asserted-by":"crossref","DOI":"10.1002\/widm.1242","article-title":"A survey of incremental high-utility itemset mining","volume":"8","author":"Gan","year":"2018","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"issue":"3","key":"10.1016\/j.future.2019.09.024_b3","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/3314107","article-title":"A survey of parallel sequential pattern mining","volume":"13","author":"Gan","year":"2019","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.future.2019.09.024_b4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.future.2017.07.035","article-title":"Single-pass based efficient erasable pattern mining using list data structure on dynamic incremental databases","volume":"80","author":"Lee","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.09.024_b5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.engappai.2016.03.003","article-title":"Erasable itemset mining over incremental databases with weight conditions","volume":"52","author":"Lee","year":"2016","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.future.2019.09.024_b6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1142\/S0218488517500052","article-title":"Mining frequent weighted itemsets without storing transaction IDs and generating candidates","volume":"25","author":"Lee","year":"2017","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"key":"10.1016\/j.future.2019.09.024_b7","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.eswa.2016.01.049","article-title":"Incremental mining of weighted maximal frequent itemsets from dynamic databases","volume":"54","author":"Yun","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.future.2019.09.024_b8","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.eswa.2018.09.051","article-title":"Mining top-k high utility itemsets with effective threshold raising strategies","volume":"117","author":"Krishnamoorthy","year":"2019","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.future.2019.09.024_b9","first-page":"1297","article-title":"A method for mining top-rank-k frequent closed itemsets","volume":"32","author":"Nguyen","year":"2017","journal-title":"J. Intell. Fuzzy Systems"},{"key":"10.1016\/j.future.2019.09.024_b10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","article-title":"Top-k high utility pattern mining with effective threshold raising strategies","volume":"76","author":"Ryang","year":"2015","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.future.2019.09.024_b11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.future.2016.09.007","article-title":"A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives","volume":"68","author":"Lee","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"issue":"11","key":"10.1016\/j.future.2019.09.024_b12","doi-asserted-by":"crossref","first-page":"2801","DOI":"10.1007\/s00500-016-2159-1","article-title":"Efficiently mining uncertain high-utility itemsets","volume":"21","author":"Lin","year":"2017","journal-title":"Soft Comput."},{"issue":"4","key":"10.1016\/j.future.2019.09.024_b13","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1007\/s11390-016-1662-2","article-title":"HUITWU: An efficient algorithm for high-utility itemset mining in transaction databases","volume":"31","author":"Guo","year":"2016","journal-title":"J. Comput. Sci. Tech."},{"key":"10.1016\/j.future.2019.09.024_b14","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","article-title":"An efficient method for mining high utility closed itemsets","volume":"495","author":"Nguyen","year":"2019","journal-title":"Inform. Sci."},{"issue":"2","key":"10.1016\/j.future.2019.09.024_b15","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TKDE.2018.2833478","article-title":"Efficient vertical mining of high average-utility itemsets based on novel upper-bounds","volume":"31","author":"Truong","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.future.2019.09.024_b16","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","article-title":"Mining of high average-utility itemsets using novel list structure and pruning strategy","volume":"68","author":"Yun","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"10.1016\/j.future.2019.09.024_b17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1142\/S0218488516500185","article-title":"An efficient approach for incremental mining fuzzy frequent itemsets with FP-tree","volume":"24","author":"Hyo","year":"2016","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"key":"10.1016\/j.future.2019.09.024_b18","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.chb.2016.11.036","article-title":"Frequent itemset mining using cellular learning automata","volume":"68","author":"Sohrabi","year":"2017","journal-title":"Comput. Hum. Behav."},{"issue":"1","key":"10.1016\/j.future.2019.09.024_b19","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/s10489-015-0750-2","article-title":"Efficient mining of high utility pattern with considering of rarity and length","volume":"45","author":"Kim","year":"2016","journal-title":"Appl. Intell."},{"issue":"1","key":"10.1016\/j.future.2019.09.024_b20","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","article-title":"Efficient algorithms for mining top-k high utility itemsets","volume":"28","author":"Tseng","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.future.2019.09.024_b21","unstructured":"R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB 1994, 1994, pp. 487\u2013499."},{"key":"10.1016\/j.future.2019.09.024_b22","doi-asserted-by":"crossref","unstructured":"Y. Liu, W.-K. Liao, A.N. Choudhary, A two-phase algorithm for fast discovery of high utility itemsets, in: Proceedings of the 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2005, 2005, pp. 689\u2013695.","DOI":"10.1007\/11430919_79"},{"issue":"15","key":"10.1016\/j.future.2019.09.024_b23","doi-asserted-by":"crossref","first-page":"11979","DOI":"10.1016\/j.eswa.2012.03.062","article-title":"Interactive mining of high utility patterns over data streams","volume":"39","author":"Ahmed","year":"2012","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.future.2019.09.024_b24","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ins.2013.09.007","article-title":"Mining frequent items in data stream using time fading model","volume":"257","author":"Chen","year":"2014","journal-title":"Inform. Sci."},{"issue":"4","key":"10.1016\/j.future.2019.09.024_b25","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1007\/s10489-017-0939-7","article-title":"Mining top-k high-utility itemsets from a data stream under sliding window model","volume":"47","author":"Dawar","year":"2017","journal-title":"Appl. Intell."},{"key":"10.1016\/j.future.2019.09.024_b26","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.future.2018.12.029","article-title":"Efficient approach for incremental high utility pattern mining with indexed list structure","volume":"95","author":"Yun","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2019.09.024_b27","doi-asserted-by":"crossref","unstructured":"J.-Z. Wang, J.-L. Huang, Incremental mining of high utility sequential patterns in incremental databases, in: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, CIKM 2016, 2016, pp. 2341\u20132346.","DOI":"10.1145\/2983323.2983691"},{"key":"10.1016\/j.future.2019.09.024_b28","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.engappai.2018.03.020","article-title":"Efficient incremental high utility pattern mining based on pre-large concept","volume":"72","author":"Lee","year":"2018","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"10.1016\/j.future.2019.09.024_b29","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10489-013-0467-z","article-title":"Incrementally mining high utility patterns based on pre-large concept","volume":"40","author":"Lin","year":"2014","journal-title":"Appl. Intell."},{"issue":"1","key":"10.1016\/j.future.2019.09.024_b30","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.aei.2014.08.003","article-title":"Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases","volume":"29","author":"Lin","year":"2015","journal-title":"Adv. Eng. Inform."},{"issue":"4","key":"10.1016\/j.future.2019.09.024_b31","doi-asserted-by":"crossref","first-page":"891","DOI":"10.3233\/IDA-160837","article-title":"A fast maintenance algorithm of the discovered high-utility itemsets with transaction deletion","volume":"20","author":"Lin","year":"2016","journal-title":"Intell. Data Anal."},{"issue":"8","key":"10.1016\/j.future.2019.09.024_b32","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","article-title":"Efficient algorithms for mining high utility itemsets from transactional databases","volume":"25","author":"Tseng","year":"2013","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.future.2019.09.024_b33","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3233\/IDA-160811","article-title":"Fast algorithm for high utility pattern mining with the sum of item quantities","volume":"20","author":"Ryang","year":"2016","journal-title":"Intell. Data Anal."},{"key":"10.1016\/j.future.2019.09.024_b34","doi-asserted-by":"crossref","unstructured":"P. Fournier-Viger, S. Zida, C.-W. Lin, C.-W. Wu, V.S. Tseng, EFIM-closed: Fast and memory efficient discovery of closed high-utility itemsets, in: International Conference on Machine Learning and Data Mining in Pattern Recognition, 2016, pp. 199\u2013213.","DOI":"10.1007\/978-3-319-41920-6_15"},{"issue":"3","key":"10.1016\/j.future.2019.09.024_b35","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1007\/s10115-016-0991-3","article-title":"FDHUP: Fast algorithm for mining discriminative high utility patterns","volume":"51","author":"Lin","year":"2017","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.future.2019.09.024_b36","doi-asserted-by":"crossref","unstructured":"M. Liu, J.-F. Qu, Mining high utility itemsets without candidate generation, in: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, 2012, pp. 55\u201364.","DOI":"10.1145\/2396761.2396773"},{"key":"10.1016\/j.future.2019.09.024_b37","doi-asserted-by":"crossref","unstructured":"P. Fournier-Viger, C.-W. Wu, S. Zida, V.S. Tseng, FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning, in: Proceedings of the 21st International Symposium on Methodologies for Intelligent Systems, ISMIS 2014, 2014, pp. 83\u201392.","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"10.1016\/j.future.2019.09.024_b38","doi-asserted-by":"crossref","unstructured":"J. Liu, K. Wang, B.C.M. Fung, Direct discovery of high utility itemsets without candidate generation, in: Proceedings of the 12th IEEE International Conference on Data Mining, ICDM 2012, 2012, pp. 984\u2013898.","DOI":"10.1109\/ICDM.2012.20"},{"issue":"2","key":"10.1016\/j.future.2019.09.024_b39","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/s10115-016-0989-x","article-title":"Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques","volume":"51","author":"Ryang","year":"2017","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.future.2019.09.024_b40","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","article-title":"Mining local and peak high utility itemsets","volume":"481","author":"Fournier-Viger","year":"2019","journal-title":"Inform. Sci."},{"key":"10.1016\/j.future.2019.09.024_b41","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.ins.2019.07.005","article-title":"Correlated utility-based pattern mining","volume":"504","author":"Gan","year":"2019","journal-title":"Inform. Sci."},{"issue":"8","key":"10.1016\/j.future.2019.09.024_b42","doi-asserted-by":"crossref","first-page":"7173","DOI":"10.1016\/j.eswa.2012.01.072","article-title":"An incremental mining algorithm for high utility itemsets","volume":"39","author":"Lin","year":"2012","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.future.2019.09.024_b43","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/IDA-140695","article-title":"Mining high utility itemsets for transaction deletion in a dynamic database","volume":"19","author":"Lin","year":"2015","journal-title":"Intell. Data Anal."},{"key":"10.1016\/j.future.2019.09.024_b44","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.datak.2015.04.006","article-title":"Fast updated frequent-itemset lattice for transaction deletion","volume":"96","author":"Vo","year":"2015","journal-title":"Data Knowl. Eng."},{"issue":"6","key":"10.1016\/j.future.2019.09.024_b45","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1007\/s10489-017-1023-z","article-title":"Efficient method for updating class association rules in dynamic datasets with record deletion","volume":"48","author":"Nguyen","year":"2018","journal-title":"Appl. Intell."},{"issue":"3","key":"10.1016\/j.future.2019.09.024_b46","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.aei.2015.05.003","article-title":"A fast updated algorithm to maintain the discovered high-utility itemsets for transaction modification","volume":"29","author":"Lin","year":"2015","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.future.2019.09.024_b47","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ins.2014.03.023","article-title":"Maintenance of pre-large trees for data mining with modified records","volume":"278","author":"Lin","year":"2014","journal-title":"Inform. Sci."},{"key":"10.1016\/j.future.2019.09.024_b48","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.knosys.2017.03.016","article-title":"An efficient algorithm for mining high utility patterns from incremental databases with one database scan","volume":"124","author":"Yun","year":"2017","journal-title":"Knowl.-Based Syst."},{"issue":"9","key":"10.1016\/j.future.2019.09.024_b49","doi-asserted-by":"crossref","first-page":"7239","DOI":"10.1109\/TIE.2017.2682782","article-title":"Efficient high utility pattern mining for establishing manufacturing plans with sliding window control","volume":"64","author":"Yun","year":"2017","journal-title":"IEEE Trans. Ind. Electron."},{"issue":"5","key":"10.1016\/j.future.2019.09.024_b50","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3233\/IDA-160861","article-title":"Mining high utility itemsets based on the time decaying model","volume":"50","author":"Kim","year":"2016","journal-title":"Intell. Data Anal."},{"key":"10.1016\/j.future.2019.09.024_b51","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","article-title":"Damped window based high average utility pattern mining over data streams","volume":"144","author":"Yun","year":"2018","journal-title":"Knowl.-Based Syst."},{"issue":"12","key":"10.1016\/j.future.2019.09.024_b52","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","article-title":"Efficient tree structures for high utility pattern mining in incremental databases","volume":"21","author":"Ahmed","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.future.2019.09.024_b53","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10489-014-0601-6","article-title":"Incremental high utility pattern mining with static and dynamic databases","volume":"42","author":"Yun","year":"2015","journal-title":"Appl. Intell."},{"key":"10.1016\/j.future.2019.09.024_b54","series-title":"Incrementally Updating High-Utility Itemsets with Transaction Insertion, ADMA 2014","first-page":"44","author":"Lin","year":"2014"},{"key":"10.1016\/j.future.2019.09.024_b55","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","article-title":"Mining high-utility itemsets in dynamic profit databases","volume":"175","author":"Nguyen","year":"2019","journal-title":"Knowl.-Based Syst."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X19313937?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167739X19313937?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T04:07:24Z","timestamp":1759118844000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X19313937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":55,"alternative-id":["S0167739X19313937"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2019.09.024","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2020,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2019.09.024","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}