{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:32:52Z","timestamp":1762342372204,"version":"3.32.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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":[[2025,1]]},"DOI":"10.1007\/s10489-024-05855-7","type":"journal-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T11:22:13Z","timestamp":1733224933000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Re-induction based mining for high utility item-sets"],"prefix":"10.1007","volume":"55","author":[{"given":"Pushp S.","family":"Mathur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satish","family":"Chand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"5855_CR1","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":"5855_CR2","unstructured":"Agrawal R, Srikant R, et al (1994) Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, vol 1215. Citeseer, pp 487\u2013499"},{"key":"5855_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10489-009-0188-5","volume":"34","author":"CF Ahmed","year":"2011","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (2011) Huc-prune: an efficient candidate pruning technique to mine high utility patterns. Appl Intell 34:181\u2013198","journal-title":"Appl Intell"},{"issue":"5","key":"5855_CR4","first-page":"6099","volume":"53","author":"G Li","year":"2023","unstructured":"Li G, Shang T, Zhang Y (2023) Efficient mining high average-utility itemsets with effective pruning strategies and novel list structure. Appl Intell 53(5):6099\u20136118","journal-title":"Appl Intell"},{"key":"5855_CR5","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1007\/s10489-020-01994-9","volume":"51","author":"X Liu","year":"2021","unstructured":"Liu X, Niu X, Fournier-Viger P (2021) Fast top-k association rule mining using rule generation property pruning. Appl Intell 51:2077\u20132093","journal-title":"Appl Intell"},{"key":"5855_CR6","doi-asserted-by":"crossref","unstructured":"Kumar R, Singh K (2023) High utility itemsets mining from transactional databases: a survey. Appl Intell 1\u201349","DOI":"10.1007\/s10489-023-04853-5"},{"key":"5855_CR7","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. SIAM, pp 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"5855_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"4","author":"MJ Zaki","year":"1999","unstructured":"Zaki MJ (1999) Parallel and distributed association mining: a survey. IEEE Concurr 4:14\u201325","journal-title":"IEEE Concurr"},{"key":"5855_CR9","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":"5855_CR10","doi-asserted-by":"crossref","unstructured":"Qu J-F, Fournier-Viger P, Liu M, Hang B, Hu C (2023) Mining high utility itemsets using prefix trees and utility vectors. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2023.3256126"},{"issue":"11","key":"5855_CR11","doi-asserted-by":"publisher","first-page":"3317","DOI":"10.1016\/j.patcog.2007.02.003","volume":"40","author":"J Hu","year":"2007","unstructured":"Hu J, Mojsilovic A (2007) High-utility pattern mining: a method for discovery of high-utility item sets. Pattern Recogn 40(11):3317\u20133324","journal-title":"Pattern Recogn"},{"issue":"12","key":"5855_CR12","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"},{"key":"5855_CR13","doi-asserted-by":"crossref","unstructured":"Subramanian K, Kandhasamy P (2023) Mining high utility itemsets using genetic algorithm based-particle swarm optimization (ga-pso). J Intell Fuzzy Syst (Preprint), 1\u201321","DOI":"10.3233\/JIFS-220871"},{"key":"5855_CR14","doi-asserted-by":"crossref","unstructured":"Freitas AA (2003) A survey of evolutionary algorithms for data mining and knowledge discovery. Advances in evolutionary computing: theory and applications, 819\u2013845","DOI":"10.1007\/978-3-642-18965-4_33"},{"key":"5855_CR15","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":"5855_CR16","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":"5","key":"5855_CR17","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":"5855_CR18","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 JC-W, Wu C-W, 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"},{"issue":"7","key":"5855_CR19","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(7):1859\u20131877","journal-title":"Appl Intell"},{"key":"5855_CR20","doi-asserted-by":"crossref","unstructured":"Cheng Z, Fang W, Shen W, Lin JC-W, Yuan B (2022) An efficient utility-list based high-utility itemset mining algorithm. Appl Intell, 1\u201315","DOI":"10.23919\/CSMS.2022.0023"},{"key":"5855_CR21","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Zida, S.: Foshu: faster on-shelf high utility itemset mining\u2013with or without negative unit profit. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing, pp. 857\u2013864 (2015)","DOI":"10.1145\/2695664.2695823"},{"issue":"3","key":"5855_CR22","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2015","unstructured":"Tseng VS, Wu C-W, Fournier-Viger P, Philip SY (2015) Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans Knowl Data Eng 27(3):726\u2013739","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"11","key":"5855_CR23","doi-asserted-by":"publisher","first-page":"2801","DOI":"10.1007\/s00500-016-2159-1","volume":"21","author":"JC-W Lin","year":"2017","unstructured":"Lin JC-W, Gan W, Fournier-Viger P, Hong T-P, Tseng VS (2017) Efficiently mining uncertain high-utility itemsets. Soft Comput 21(11):2801\u20132820","journal-title":"Soft Comput"},{"issue":"2","key":"5855_CR24","first-page":"767","volume":"215","author":"C-J Chu","year":"2009","unstructured":"Chu C-J, Tseng VS, Liang T (2009) An efficient algorithm for mining high utility itemsets with negative item values in large databases. Appl Math ComputAppl Math Comput Sci 215(2):767\u2013778","journal-title":"Appl Math ComputAppl Math Comput Sci"},{"issue":"3","key":"5855_CR25","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.aei.2015.06.002","volume":"29","author":"JC-W Lin","year":"2015","unstructured":"Lin JC-W, Gan W, Hong T-P, Tseng VS (2015) Efficient algorithms for mining up-to-date high-utility patterns. Adv Eng Inform 29(3):648\u2013661","journal-title":"Adv Eng Inform"},{"key":"5855_CR26","doi-asserted-by":"crossref","unstructured":"Han M, Zhang N, Wang L, Li X, Cheng H (2022) Mining closed high utility patterns with negative utility in dynamic databases. Appl Intell, 1\u201318","DOI":"10.1007\/s10489-022-03876-8"},{"issue":"17","key":"5855_CR27","doi-asserted-by":"publisher","first-page":"6297","DOI":"10.12733\/jics20104994","volume":"11","author":"Y Li","year":"2014","unstructured":"Li Y, Zhang Z, Chen W, Min F (2014) Mining high utility itemsets with discount strategies. J Inf Comput Sci 11(17):6297\u20136307","journal-title":"J Inf Comput Sci"},{"issue":"4","key":"5855_CR28","doi-asserted-by":"publisher","first-page":"891","DOI":"10.3233\/IDA-160837","volume":"20","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Gan W, Hong T-P (2016) A fast maintenance algorithm of the discovered high-utility itemsets with transaction deletion. Intell Data Anal 20(4):891\u2013913","journal-title":"Intell Data Anal"},{"key":"5855_CR29","doi-asserted-by":"publisher","first-page":"26639","DOI":"10.1109\/ACCESS.2017.2774510","volume":"5","author":"W-M Huang","year":"2017","unstructured":"Huang W-M, Hong T-P, Lan G-C, Chiang M-C, Lin JC-W (2017) Temporal-based fuzzy utility mining. IEEE Access 5:26639\u201326652","journal-title":"IEEE Access"},{"issue":"6","key":"5855_CR30","doi-asserted-by":"publisher","first-page":"6992","DOI":"10.1007\/s10489-022-03850-4","volume":"53","author":"Z Cheng","year":"2023","unstructured":"Cheng Z, Fang W, Shen W, Lin JC-W, Yuan B (2023) An efficient utility-list based high-utility itemset mining algorithm. Appl Intell 53(6):6992\u20137006","journal-title":"Appl Intell"},{"key":"5855_CR31","doi-asserted-by":"crossref","unstructured":"Ali A, Ullah I, Shabaz M, Sharafian A, Khan MA, Bai X, Qiu L (2024) A resource-aware multi-graph neural network\u00a0for urban traffic flow prediction in multi-access edge computing systems. IEEE Trans Consum Electron","DOI":"10.1109\/TCE.2024.3439719"},{"key":"5855_CR32","doi-asserted-by":"publisher","first-page":"100620","DOI":"10.1016\/j.cosrev.2024.100620","volume":"52","author":"M Zakarya","year":"2024","unstructured":"Zakarya M, Khan AA, Qazani MRC, Ali H, Al-Bahri M, Khan AUR, Ali A, Khan R (2024) Sustainable computing across datacenters: a review of enabling models and techniques. Comput Sci Rev 52:100620","journal-title":"Comput Sci Rev"},{"key":"5855_CR33","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JC-W, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The spmf open-source data mining library version 2. In: Joint european conference on machine learning and knowledge discovery in databases. Springer, pp 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"5855_CR34","doi-asserted-by":"crossref","unstructured":"Chauhan S, Singh M, Aggarwal AK (2023) Investigative analysis of different mutation on diversity-driven multi-parent evolutionary algorithm and its application in area coverage optimization of wsn. Soft Comput 1\u201327","DOI":"10.1007\/s00500-023-08090-3"},{"key":"5855_CR35","doi-asserted-by":"publisher","first-page":"105803","DOI":"10.1016\/j.engappai.2022.105803","volume":"119","author":"S Chauhan","year":"2023","unstructured":"Chauhan S, Singh M, Aggarwal AK (2023) Designing of optimal digital iir filter in the multi-objective framework using an evolutionary algorithm. Eng Appl Artif Intell 119:105803","journal-title":"Eng Appl Artif Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05855-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05855-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05855-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T16:05:16Z","timestamp":1735833916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05855-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["5855"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05855-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"6 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"The experiments designed for this study are openly available on the internet, hence ethical and informed consent for data used are not applicable for this study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}],"article-number":"75"}}