{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T18:42:39Z","timestamp":1770576159635,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T00:00:00Z","timestamp":1695945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T00:00:00Z","timestamp":1695945600000},"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":["Data Sci. Eng."],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>High utility itemset mining is a crucial research area that focuses on identifying combinations of itemsets from databases that possess a utility value higher than a user-specified threshold. However, most existing algorithms assume that the databases are static, which is not realistic for real-life datasets that are continuously growing with new data. Furthermore, existing algorithms only rely on the utility value to identify relevant itemsets, leading to even the earliest occurring combinations being produced as output. Although some mining algorithms adopt a support-based approach to account for itemset frequency, they do not consider the temporal nature of itemsets. To address these challenges, this paper proposes the Scented Utility Miner (SUM) algorithm that uses a reinduction strategy to track the recency of itemset occurrence and mine itemsets from incremental databases. The paper provides a novel approach for mining high utility itemsets from dynamic databases and presents several experiments that demonstrate the effectiveness of the proposed approach.<\/jats:p>","DOI":"10.1007\/s41019-023-00229-4","type":"journal-article","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:02:56Z","timestamp":1695978176000},"page":"73-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Reinduction-Based Approach for Efficient High Utility Itemset Mining from Incremental Datasets"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6806-2345","authenticated-orcid":false,"given":"Pushp","family":"Sra","sequence":"first","affiliation":[]},{"given":"Satish","family":"Chand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,29]]},"reference":[{"issue":"12","key":"229_CR1","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (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"},{"issue":"1","key":"229_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TETCI.2020.3000224","volume":"5","author":"U Ahmed","year":"2020","unstructured":"Ahmed U, Chun-Wei Lin J, Srivastava G, Yasin R, Djenouri Y (2020) An evolutionary model to mine high expected utility patterns from uncertain databases. IEEE Trans Emerg Top Comput Intell 5(1):19\u201328","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"issue":"4","key":"229_CR3","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1007\/s10489-017-0939-7","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Sharma V, Goyal V (2017) Mining top-k high-utility itemsets from a data stream under sliding window model. Appl Intell 47(4):1240\u20131255","journal-title":"Appl Intell"},{"key":"229_CR4","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:1859\u20131877","journal-title":"Appl Intell"},{"key":"229_CR5","unstructured":"Fang W, Zhang Q, Sun J, Wu X-J (2020) Mining high quality patterns using multi-objective evolutionary algorithm. IEEE Trans Knowl Data Eng"},{"key":"229_CR6","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Chun-Wei Lin J, Gueniche T, Barhate P (2015) Efficient incremental high utility itemset mining. In: Proceedings of the ASE BigData & SocialInformatics 2015, pp 1\u20136","DOI":"10.1145\/2818869.2818887"},{"key":"229_CR7","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C-W, Zida S, Tseng VS (2014) Fhm: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: International symposium on methodologies for intelligent systems. Springer, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"2","key":"229_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.3233\/IDA-2001-5203","volume":"5","author":"T-P Hong","year":"2001","unstructured":"Hong T-P, Wang C-Y, Tao Y-H (2001) A new incremental data mining algorithm using pre-large itemsets. Intell Data Anal 5(2):111\u2013129","journal-title":"Intell Data Anal"},{"issue":"11","key":"229_CR9","doi-asserted-by":"publisher","first-page":"3317","DOI":"10.1016\/j.patcog.2007.02.003","volume":"40","author":"H Jianying","year":"2007","unstructured":"Jianying H, Mojsilovic A (2007) High-utility pattern mining: a method for discovery of high-utility item sets. Pattern Recognit 40(11):3317\u20133324","journal-title":"Pattern Recognit"},{"issue":"5","key":"229_CR10","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371\u20132381","journal-title":"Expert Syst Appl"},{"issue":"2","key":"229_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10489-013-0467-z","volume":"40","author":"C-W Lin","year":"2014","unstructured":"Lin C-W, Hong T-P, Lan G-C, Wong J-W, Lin W-Y (2014) Incrementally mining high utility patterns based on pre-large concept. Appl Intell 40(2):343\u2013357","journal-title":"Appl Intell"},{"issue":"6","key":"229_CR12","doi-asserted-by":"publisher","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"C-W Lin","year":"2011","unstructured":"Lin C-W, Hong T-P, Wen-Hsiang L (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38(6):7419\u20137424","journal-title":"Expert Syst Appl"},{"issue":"8","key":"229_CR13","doi-asserted-by":"publisher","first-page":"7173","DOI":"10.1016\/j.eswa.2012.01.072","volume":"39","author":"C-W Lin","year":"2012","unstructured":"Lin C-W, Lan G-C, Hong T-P (2012) An incremental mining algorithm for high utility itemsets. Expert Syst Appl 39(8):7173\u20137180","journal-title":"Expert Syst Appl"},{"key":"229_CR14","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. ACM, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"229_CR15","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-k, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proceedings of the 1st international workshop on Utility-based data mining. ACM, pp 90\u201399","DOI":"10.1145\/1089827.1089839"},{"key":"229_CR16","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, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"229_CR17","doi-asserted-by":"crossref","unstructured":"Qu J-F, Liu M, Fournier-Viger P (2019) Efficient algorithms for high utility itemset mining without candidate generation. In: High-utility pattern mining: theory, algorithms and applications, pp 131\u2013160","DOI":"10.1007\/978-3-030-04921-8_5"},{"key":"229_CR18","doi-asserted-by":"crossref","unstructured":"Sra P, Chand S (2023) A residual utility-based concept for high-utility itemset mining. Knowl Inf Syst, pp 1\u201325","DOI":"10.1007\/s10115-023-01948-w"},{"key":"229_CR19","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu C-W, Shie B-E, 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. ACM, pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"229_CR20","doi-asserted-by":"publisher","first-page":"104008","DOI":"10.1016\/j.tourman.2019.104008","volume":"77","author":"HQ Vu","year":"2020","unstructured":"Vu HQ, Li G, Law R (2020) Discovering highly profitable travel patterns by high-utility pattern mining. Tour Manag 77:104008","journal-title":"Tour Manag"},{"issue":"4","key":"229_CR21","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s41019-022-00196-2","volume":"7","author":"Q Yin","year":"2022","unstructured":"Yin Q, Wang J, Sheng D, Leng J, Li J, Hong Y, Zhang F, Chai Y, Zhang X, Zhao X et al (2022) An adaptive elastic multi-model big data analysis and information extraction system. Data Sci Eng 7(4):328\u2013338","journal-title":"Data Sci Eng"},{"key":"229_CR22","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.03.016","volume":"124","author":"U Yun","year":"2017","unstructured":"Yun U, Ryang H, Lee G, Fujita H (2017) An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl-Based Syst 124:188\u2013206","journal-title":"Knowl-Based Syst"},{"key":"229_CR23","doi-asserted-by":"crossref","unstructured":"Zida S, Fournier-Viger P, Chun-Wei Lin J, Wu C-W, Tseng VS (2015) Efim: a highly efficient algorithm for high-utility itemset mining. In: Mexican international conference on artificial intelligence. Springer, pp 530\u2013546","DOI":"10.1007\/978-3-319-27060-9_44"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00229-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-023-00229-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00229-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T15:21:12Z","timestamp":1711725672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-023-00229-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,29]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["229"],"URL":"https:\/\/doi.org\/10.1007\/s41019-023-00229-4","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,29]]},"assertion":[{"value":"4 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2023","order":4,"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 there are no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}