{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:17:49Z","timestamp":1778692669089,"version":"3.51.4"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s10115-026-02776-4","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T13:32:58Z","timestamp":1778506378000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extracting interesting CoHUPs from dataset with skewed and non-skewed item\u2019s support distribution"],"prefix":"10.1007","volume":"68","author":[{"given":"Rashad","family":"Saeed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azhar","family":"Rauf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahmi H.","family":"Quradaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Mumtaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saqib","family":"Alam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed H. S.","family":"Al-Hakimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,11]]},"reference":[{"issue":"2","key":"2776_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1080\/00031305.1998.10480549","volume":"52","author":"DJ Hand","year":"1998","unstructured":"Hand DJ (1998) Data mining: statistics and more? Am Stat 52(2):112\u2013118","journal-title":"Am Stat"},{"issue":"4","key":"2776_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1207","volume":"7","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger P, Lin JCW, Vo B, Chi TT, Zhang J, Le HB (2017) A survey of itemset mining. Wiley Interdiscip Rev Data Min Knowledge Discov 7(4):e1207","journal-title":"Wiley Interdiscip Rev Data Min Knowledge Discov"},{"issue":"4","key":"2776_CR3","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1007\/s10462-018-9629-z","volume":"52","author":"CH Chee","year":"2019","unstructured":"Chee CH, Jaafar J, Aziz IA, Hasan MH, Yeoh W (2019) Algorithms for frequent itemset mining: a literature review. Artif Intell Rev 52(4):2603\u20132621","journal-title":"Artif Intell Rev"},{"key":"2776_CR4","doi-asserted-by":"publisher","first-page":"55798","DOI":"10.1109\/ACCESS.2020.2981962","volume":"8","author":"C Zhang","year":"2020","unstructured":"Zhang C, Han M, Sun R, Du S, Shen M (2020) A survey of key technologies for high utility patterns mining. IEEE Access 8:55798\u201355814","journal-title":"IEEE Access"},{"issue":"3","key":"2776_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3314107","volume":"13","author":"W Gan","year":"2019","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Yu PS (2019) A survey of parallel sequential pattern mining. ACM Trans Knowl Discov Data 13(3):1\u201334","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"4","key":"2776_CR6","first-page":"1243","volume":"12","author":"MK Gupta","year":"2020","unstructured":"Gupta MK, Chandra P (2020) A comprehensive survey of data mining. Int J Inf Technol 12(4):1243\u20131257","journal-title":"Int J Inf Technol"},{"issue":"3","key":"2776_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3444690","volume":"54","author":"A Bl\u00e1zquez-Garc\u00eda","year":"2021","unstructured":"Bl\u00e1zquez-Garc\u00eda A, Conde A, Mori U, Lozano JA (2021) A review on outlier\/anomaly detection in time series data. ACM Comput Surv 54(3):1\u201333","journal-title":"ACM Comput Surv"},{"key":"2776_CR8","doi-asserted-by":"crossref","unstructured":"Dias V, Teixeira CH, Guedes D, Meira W, Parthasarathy S (2019) Fractal: a general-purpose graph pattern mining system. In: Proceedings of the 2019 international conference on management of data, pp. 1357\u20131374","DOI":"10.1145\/3299869.3319875"},{"key":"2776_CR9","doi-asserted-by":"publisher","first-page":"42786","DOI":"10.1109\/ACCESS.2021.3065393","volume":"9","author":"RS Almoqbily","year":"2021","unstructured":"Almoqbily RS, Rauf A, Quradaa FH (2021) A survey of correlated high utility pattern mining. IEEE Access 9:42786\u201342800","journal-title":"IEEE Access"},{"key":"2776_CR10","doi-asserted-by":"crossref","unstructured":"Maylawati D (2018) The concept of frequent itemset mining for text. In: IOP conference series: materials science and engineering. 434: 012043","DOI":"10.1088\/1757-899X\/434\/1\/012043"},{"key":"2776_CR11","doi-asserted-by":"crossref","unstructured":"Manda P, Ozkan S, Wang H, McCarthy F, Bridges SM (2012) Cross-ontology multi-level association rule mining in the gene ontology. PLOS ONE. 7","DOI":"10.1371\/journal.pone.0047411"},{"issue":"1","key":"2776_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-7-54","volume":"7","author":"P Carmona-Saez","year":"2006","unstructured":"Carmona-Saez P, Chagoyen M, Rodriguez A, Trelles O, Carazo JM, Pascual-Montano A (2006) Integrated analysis of gene expression by association rules discovery. BMC Bioinform 7(1):1\u201316","journal-title":"BMC Bioinform"},{"issue":"2","key":"2776_CR13","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TCBB.2011.131","volume":"9","author":"Y Yoon","year":"2011","unstructured":"Yoon Y, Lee GG (2011) Subcellular localization prediction through boosting association rules. IEEE\/ACM Trans Comput Biol Bioinf 9(2):609\u2013618","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"1","key":"2776_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-019-0169-4","volume":"6","author":"K Dahdouh","year":"2019","unstructured":"Dahdouh K, Dakkak A, Oughdir L, Ibriz A (2019) Large-scale e-learning recommender system based on spark and hadoop. J Big Data 6(1):1\u201323","journal-title":"J Big Data"},{"issue":"8","key":"2776_CR15","doi-asserted-by":"publisher","first-page":"5145","DOI":"10.1007\/s11227-019-02791-z","volume":"75","author":"S Pariserum Perumal","year":"2019","unstructured":"Pariserum Perumal S, Sannasi G, Arputharaj K (2019) An intelligent fuzzy rule-based e-learning recommendation system for dynamic user interests. J Supercomput 75(8):5145\u20135160","journal-title":"J Supercomput"},{"issue":"5","key":"2776_CR16","first-page":"411","volume":"3","author":"J Jha","year":"2013","unstructured":"Jha J, Ragha L (2013) Educational data mining using improved apriori algorithm. Int J Inf Comput Technol 3(5):411\u2013418","journal-title":"Int J Inf Comput Technol"},{"issue":"2","key":"2776_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.3390\/data5020033","volume":"5","author":"SS Abdullah","year":"2020","unstructured":"Abdullah SS, Rostamzadeh N, Sedig K, Garg AX, McArthur E (2020) Multiple regression analysis and frequent itemset mining of electronic medical records: a visual analytics approach using visa_m3r3. Data 5(2):33","journal-title":"Data"},{"key":"2776_CR18","doi-asserted-by":"crossref","unstructured":"Mulyawan B, Sutrisno T et\u00a0al (2020) Product recommendation system on building materials shopping using fp-growth algorithm. In: IOP Conference series: materials science and engineering. 1007: 012144. IOP Publishing","DOI":"10.1088\/1757-899X\/1007\/1\/012144"},{"key":"2776_CR19","unstructured":"Xiao Y (2018) Recommending best products from e-commerce purchase history and user click behavior data. University of Windsor"},{"key":"2776_CR20","doi-asserted-by":"crossref","unstructured":"Xueyuan W, Bo Y (2018) Design and implementation of an apriori-based recommendation system for college libraries. In: 2018 International conference on engineering simulation and intelligent control (ESAIC), pp. 372\u2013375. IEEE","DOI":"10.1109\/ESAIC.2018.00094"},{"key":"2776_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.chb.2016.11.010","volume":"67","author":"MK Najafabadi","year":"2017","unstructured":"Najafabadi MK, Mahrin MN, Chuprat S, Sarkan HM (2017) Improving the accuracy of collaborative filtering recommendations using clustering and association rules mining on implicit data. Comput Hum Behav 67:113\u2013128","journal-title":"Comput Hum Behav"},{"issue":"2","key":"2776_CR22","first-page":"48","volume":"11","author":"BS Neysiani","year":"2019","unstructured":"Neysiani BS, Soltani N, Mofidi R, Nadimi-Shahraki MH (2019) Improve performance of association rule-based collaborative filtering recommendation systems using genetic algorithm. Int J Inf Technol Comput Sci 11(2):48\u201355","journal-title":"Int J Inf Technol Comput Sci"},{"key":"2776_CR23","doi-asserted-by":"crossref","unstructured":"Qu JF, Liu M, Fournier-Viger P (2019) Efficient algorithms for high utility itemset mining without candidate generation. In: High-Utility Pattern Mining, pp. 131\u2013160. Springer","DOI":"10.1007\/978-3-030-04921-8_5"},{"issue":"2","key":"2776_CR24","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"},{"issue":"12","key":"2776_CR25","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 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":"2776_CR26","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Chun-Wei\u00a0Lin J, Truong-Chi T, Nkambou R (2019) A survey of high utility itemset mining. In: High-utility pattern mining, pp. 1\u201345. Springer","DOI":"10.1007\/978-3-030-04921-8_1"},{"issue":"4","key":"2776_CR27","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TKDE.2019.2942594","volume":"33","author":"W Gan","year":"2019","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Tseng VS, Philip SY (2019) A survey of utility-oriented pattern mining. IEEE Trans Knowl Data Eng 33(4):1306\u20131327","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2776_CR28","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Chun-Wei\u00a0Lin J, Truong-Chi T, Nkambou R (2019) A survey of high utility itemset mining. In: High-utility pattern mining, pp. 1\u201345. Springer","DOI":"10.1007\/978-3-030-04921-8_1"},{"key":"2776_CR29","first-page":"110","volume":"263","author":"S Kim","year":"2023","unstructured":"Kim S, Kim H, Cho M, Vo B, Lin JC-W, Yun U (2023) Efficient approach for mining high-utility patterns on incremental databases with dynamic profits. Knowl-Based Syst 263:110\u2013125","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"2776_CR30","first-page":"123","volume":"40","author":"Y Shao","year":"2025","unstructured":"Shao Y, Li P, Zhang X, Kumar R (2025) Mining of high utility itemsets from incremental datasets: a survey. Knowl Eng Rev 40(2):123\u2013152","journal-title":"Knowl Eng Rev"},{"key":"2776_CR31","first-page":"115","volume":"642","author":"S Kim","year":"2024","unstructured":"Kim S, Han M, Lee J, Park K (2024) Efficient approach of high average utility pattern mining with indexed list-based structure in dynamic environments. Inf Sci 642:115\u2013138","journal-title":"Inf Sci"},{"key":"2776_CR32","first-page":"123456","volume":"8","author":"C Zhang","year":"2020","unstructured":"Zhang C, Han M, Sun R, Du S, Shen M (2020) A survey of key technologies for high utility patterns mining. IEEE Access 8:123456\u2013123478","journal-title":"IEEE Access"},{"key":"2776_CR33","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.future.2018.12.029","volume":"95","author":"U Yun","year":"2019","unstructured":"Yun U, Nam H, Lee G, Yoon E (2019) Efficient approach for incremental high utility pattern mining with indexed list structure. Futur Gener Comput Syst 95:221\u2013239","journal-title":"Futur Gener Comput Syst"},{"key":"2776_CR34","doi-asserted-by":"publisher","first-page":"74168","DOI":"10.1109\/ACCESS.2019.2919524","volume":"7","author":"J Liu","year":"2019","unstructured":"Liu J, Ju X, Zhang X, Fung BC, Yang X, Yu C (2019) Incremental mining of high utility patterns in one phase by absence and legacy-based pruning. IEEE access 7:74168\u201374180","journal-title":"IEEE access"},{"key":"2776_CR35","doi-asserted-by":"crossref","unstructured":"Chen J, Guo X, Gan W, Chen CM, Ding W, Chen G (2020) Osumi: On-shelf utility mining from itemset-based data. In: 2020 IEEE International conference on big data (big data), pp. 5340\u20135349. IEEE","DOI":"10.1109\/BigData50022.2020.9377761"},{"issue":"3","key":"2776_CR36","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10115-016-1020-2","volume":"52","author":"TL Dam","year":"2017","unstructured":"Dam TL, Li K, Fournier-Viger P, Duong QH (2017) An efficient algorithm for mining top-k on-shelf high utility itemsets. Knowl Inf Syst 52(3):621\u2013655","journal-title":"Knowl Inf Syst"},{"issue":"6","key":"2776_CR37","doi-asserted-by":"publisher","first-page":"8321","DOI":"10.1007\/s11227-021-04218-0","volume":"78","author":"L Chen","year":"2022","unstructured":"Chen L, Gan W, Lin Q, Huang S, Chen CM (2022) Ohuqi: mining on-shelf high-utility quantitative itemsets. J Supercomput 78(6):8321\u20138345","journal-title":"J Supercomput"},{"key":"2776_CR38","doi-asserted-by":"crossref","unstructured":"Hidouri A, Jabbour S, Dlala IO, Raddaoui B (2021) On minimal and maximal high utility itemsets mining using propositional satisfiability. In: 2021 IEEE international conference on big data (big data), pp. 622\u2013628. IEEE","DOI":"10.1109\/BigData52589.2021.9671422"},{"issue":"11","key":"2776_CR39","doi-asserted-by":"publisher","first-page":"2947","DOI":"10.1007\/s10115-021-01614-z","volume":"63","author":"W Song","year":"2021","unstructured":"Song W, Liu L, Huang C (2021) Generalized maximal utility for mining high average-utility itemsets. Knowl Inf Syst 63(11):2947\u20132967","journal-title":"Knowl Inf Syst"},{"key":"2776_CR40","doi-asserted-by":"publisher","first-page":"31813","DOI":"10.1109\/ACCESS.2020.2974104","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo B, Nguyen LT, Bui N, Nguyen TD, Huynh VN, Hong TP (2020) An efficient method for mining closed potential high-utility itemsets. IEEE Access 8:31813\u201331822","journal-title":"IEEE Access"},{"issue":"115","key":"2776_CR41","first-page":"741","volume":"186","author":"TD Nguyen","year":"2021","unstructured":"Nguyen TD, Nguyen LT, Vu L, Vo B, Pedrycz W (2021) Efficient algorithms for mining closed high utility itemsets in dynamic profit databases. Expert Syst Appl 186(115):741","journal-title":"Expert Syst Appl"},{"key":"2776_CR42","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.datak.2021.101927","volume":"136","author":"A Hidouri","year":"2021","unstructured":"Hidouri A, Jabbour S, Raddaoui B, Yaghlane BB (2021) Mining closed high utility itemsets based on propositional satisfiability. Data Knowl Eng 136:101\u2013927","journal-title":"Data Knowl Eng"},{"issue":"21","key":"2776_CR43","doi-asserted-by":"publisher","first-page":"4878","DOI":"10.1016\/j.ins.2011.05.012","volume":"181","author":"CF Ahmed","year":"2011","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Choi HJ (2011) A framework for mining interesting high utility patterns with a strong frequency affinity. Inf Sci 181(21):4878\u20134894","journal-title":"Inf Sci"},{"issue":"3","key":"2776_CR44","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1007\/s10115-016-0991-3","volume":"51","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP, Chao HC (2017) Fdhup: fast algorithm for mining discriminative high utility patterns. Knowl Inf Syst 51(3):873\u2013909","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"2776_CR45","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1093\/jigpal\/jzz068","volume":"28","author":"P Fournier-Viger","year":"2020","unstructured":"Fournier-Viger P, Zhang Y, Lin JCW, Dinh DT, Le Bac H (2020) Mining correlated high-utility itemsets using various measures. Logic J IGPL 28(1):19\u201332","journal-title":"Logic J IGPL"},{"key":"2776_CR46","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.knosys.2017.12.003","volume":"143","author":"W Gan","year":"2018","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Fujita H (2018) Extracting non-redundant correlated purchase behaviors by utility measure. Knowl-Based Syst 143:30\u201341","journal-title":"Knowl-Based Syst"},{"key":"2776_CR47","doi-asserted-by":"publisher","first-page":"90465","DOI":"10.1109\/ACCESS.2020.2994059","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo B, Nguyen LV, Vu VV, Lam MT, Duong TT, Manh LT, Nguyen TT, Nguyen LT, Hong TP (2020) Mining correlated high utility itemsets in one phase. IEEE Access 8:90465\u201390477","journal-title":"IEEE Access"},{"key":"2776_CR48","doi-asserted-by":"crossref","unstructured":"Saeed R, Rauf A, Quradaa FH, Asim SM (2021) Efficient utility tree-based algorithm to mine high utility patterns having strong correlation. Complexity. 2021","DOI":"10.1155\/2021\/7310137"},{"key":"2776_CR49","doi-asserted-by":"publisher","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, Philip SY (2019) Correlated utility-based pattern mining. Inf Sci 504:470\u2013486","journal-title":"Inf Sci"},{"issue":"3","key":"2776_CR50","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10844-014-0314-7","volume":"45","author":"UK Rage","year":"2015","unstructured":"Rage UK, Kitsuregawa M (2015) Efficient discovery of correlated patterns using multiple minimum all-confidence thresholds. J Intell Inf Syst 45(3):357\u2013377","journal-title":"J Intell Inf Syst"},{"issue":"3","key":"2776_CR51","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10618-009-0161-2","volume":"21","author":"T Wu","year":"2010","unstructured":"Wu T, Chen Y, Han J (2010) Re-examination of interestingness measures in pattern mining: a unified framework. Data Min Knowl Disc 21(3):371\u2013397","journal-title":"Data Min Knowl Disc"},{"issue":"2","key":"2776_CR52","first-page":"181","volume":"24","author":"L Vu","year":"2015","unstructured":"Vu L, Alaghband G (2015) Efficient algorithms for mining frequent patterns from sparse and dense databases. J Intell Syst 24(2):181\u2013197","journal-title":"J Intell Syst"},{"issue":"1","key":"2776_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10844-008-0077-0","volume":"34","author":"F Flouvat","year":"2010","unstructured":"Flouvat F, De Marchi F, Petit JM (2010) A new classification of datasets for frequent itemsets. J Intell Inf Syst 34(1):1\u201319","journal-title":"J Intell Inf Syst"},{"key":"2776_CR54","doi-asserted-by":"crossref","unstructured":"Pearson K (1900) I. mathematical contributions to the theory of evolution. vii. on the correlation of characters not quantitatively measurable. Philosoph Trans R Soc London Ser A Contain Papers Math Phys Character. 195: 262\u2013273","DOI":"10.1098\/rsta.1900.0022"},{"key":"2776_CR55","doi-asserted-by":"crossref","unstructured":"Stigler SM (2002) Statistics on the table: The history of statistical concepts and methods. Harvard University Press","DOI":"10.2307\/j.ctv1pdrpsj"},{"issue":"1","key":"2776_CR56","doi-asserted-by":"publisher","first-page":"87","DOI":"10.2307\/2340521","volume":"85","author":"RA Fisher","year":"1922","unstructured":"Fisher RA (1922) On the interpretation of $$\\chi $$ 2 from contingency tables, and the calculation of p. J Roy Stat Soc 85(1):87\u201394","journal-title":"J Roy Stat Soc"},{"issue":"4","key":"2776_CR57","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF02345483","volume":"1","author":"P H\u00e1jek","year":"1966","unstructured":"H\u00e1jek P, Havel I, Chytil M (1966) The guha method of automatic hypotheses determination. Computing 1(4):293\u2013308","journal-title":"Computing"},{"issue":"4","key":"2776_CR58","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1022641700528","volume":"3","author":"P Clark","year":"1989","unstructured":"Clark P, Niblett T (1989) The cn2 induction algorithm. Mach Learn 3(4):261\u2013283","journal-title":"Mach Learn"},{"key":"2776_CR59","doi-asserted-by":"crossref","unstructured":"Agrawal R. Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on Management of data, pp. 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"2776_CR60","unstructured":"Agrawal R, Srikant R et\u00a0al (1994) Fast algorithms for mining association rules. In: Proc. 20th int. conf. very large data bases, VLDB, vol. 1215, pp. 487\u2013499. Santiago, Chile"},{"issue":"1","key":"2776_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X Wu","year":"2008","unstructured":"Wu X, Kumar V, Ross Quinlan J, Ghosh J, Yang Q, Motoda H, McLachlan GJ, Ng A, Liu B, Yu PS et al (2008) Top 10 algorithms in data mining. Knowl Inf Syst 14(1):1\u201337","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"2776_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Rec 29(2):1\u201312","journal-title":"ACM SIGMOD Rec"},{"issue":"3","key":"2776_CR63","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"2776_CR64","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11227-020-03253-7","volume":"77","author":"S Raj","year":"2021","unstructured":"Raj S, Ramesh D, Sethi KK (2021) A spark-based apriori algorithm with reduced shuffle overhead. J Supercomput 77(1):133\u2013151","journal-title":"J Supercomput"},{"issue":"5","key":"2776_CR65","doi-asserted-by":"publisher","first-page":"251","DOI":"10.14257\/ijdta.2016.9.5.26","volume":"9","author":"Z Ma","year":"2016","unstructured":"Ma Z, Yang J, Zhang T, Liu F (2016) An improved eclat algorithm for mining association rules based on increased search strategy. Int J Database Theory Appl 9(5):251\u2013266","journal-title":"Int J Database Theory Appl"},{"key":"2776_CR66","doi-asserted-by":"crossref","unstructured":"Yang Y, Tian N, Wang Y, Yuan Z (2022) A parallel fp-growth mining algorithm with load balancing constraints for traffic crash data. Int J Comput Commun Control. 17(4)","DOI":"10.15837\/ijccc.2022.4.4806"},{"issue":"100","key":"2776_CR67","first-page":"035","volume":"7","author":"S Bagui","year":"2020","unstructured":"Bagui S, Devulapalli K, Coffey J (2020) A heuristic approach for load balancing the fp-growth algorithm on mapreduce. Array 7(100):035","journal-title":"Array"},{"key":"2776_CR68","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2025.114803","volume":"332","author":"Y Li","year":"2026","unstructured":"Li Y, Gao X, Li J, Gao R, Fournier-Viger P, Wu Y (2026) CoTP-Miner: co-occurrence three-way sequential pattern mining. Knowl-Based Syst 332:114803","journal-title":"Knowl-Based Syst"},{"key":"2776_CR69","doi-asserted-by":"crossref","unstructured":"Li Y, Zhang C, Li J, Song W, Qi Z, Wu Y, Xindong W (2023) Maximal co-occurrence nonoverlapping sequential rule mining","DOI":"10.1109\/TKDE.2023.3241213"},{"key":"2776_CR70","unstructured":"Chen Z, Gan W, Huang G, Qi Z, Li Y, Yu PS (2023) TALENT: Targeted mining of non-overlapping sequential patterns"},{"key":"2776_CR71","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. pp. 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"2776_CR72","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao Wk, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Advances in knowledge discovery and data mining: 9th Pacific-Asia conference, PAKDD 2005, Hanoi, Vietnam, May 18-20, 2005. Proceedings 9, pp. 689\u2013695. Springer","DOI":"10.1007\/11430919_79"},{"issue":"6","key":"2776_CR73","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"},{"issue":"8","key":"2776_CR74","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"},{"key":"2776_CR75","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, pp. 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"2776_CR76","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, 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, pp. 83\u201392. Springer","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"5","key":"2776_CR77","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"},{"key":"2776_CR78","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.bdr.2016.07.001","volume":"6","author":"Y Chen","year":"2016","unstructured":"Chen Y, An A (2016) Approximate parallel high utility itemset mining. Big Data Res 6:26\u201342","journal-title":"Big Data Res"},{"issue":"7","key":"2776_CR79","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s10489-017-1057-2","volume":"48","author":"QH Duong","year":"2018","unstructured":"Duong QH, Fournier-Viger P, Ramampiaro H, N\u00f8rv\u00e5g K, Dam TL (2018) Efficient high utility itemset mining using buffered utility-lists. Appl Intell 48(7):1859\u20131877","journal-title":"Appl Intell"},{"issue":"11","key":"2776_CR80","doi-asserted-by":"publisher","first-page":"4141","DOI":"10.1007\/s10115-020-01485-w","volume":"62","author":"MK Sohrabi","year":"2020","unstructured":"Sohrabi MK (2020) An efficient projection-based method for high utility itemset mining using a novel pruning approach on the utility matrix. Knowl Inf Syst 62(11):4141\u20134167","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"2776_CR81","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu CW, Tseng VS et al (2014) Spmf: a java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393","journal-title":"J Mach Learn Res"},{"key":"2776_CR82","first-page":"1831","volume":"62","author":"J Li","year":"2020","unstructured":"Li J, Lu H (2020) Disk-based High-Utility Pattern Mining for Big Data. Knowl Inf Syst 62:1831\u20131857","journal-title":"Knowl Inf Syst"},{"key":"2776_CR83","unstructured":"Ahmed CF, Jeong H, Lee K (2013) Efficient high utility itemset mining using disk-resident data. In: 2013 IEEE International conference on data mining, pp. 37\u201346"},{"key":"2776_CR84","unstructured":"Pham T et al (2021) High utility pattern mining in dynamic data streams with concept drift. IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-026-02776-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-026-02776-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-026-02776-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:45:18Z","timestamp":1778690718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-026-02776-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,11]]},"references-count":84,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["2776"],"URL":"https:\/\/doi.org\/10.1007\/s10115-026-02776-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,11]]},"assertion":[{"value":"11 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","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 is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"154"}}