{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:08:37Z","timestamp":1778645317781,"version":"3.51.4"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00500-022-07123-7","type":"journal-article","created":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T02:03:24Z","timestamp":1653444204000},"page":"6063-6086","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mining fuzzy high average-utility itemsets using fuzzy utility lists and efficient pruning approach"],"prefix":"10.1007","volume":"26","author":[{"given":"Manijeh","family":"Hajihoseini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Karim","family":"Sohrabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"7123_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc. 20th int conf very large data bases, VLDB'94. pp 487\u2013499"},{"issue":"12","key":"7123_CR2","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 T Knowl Data En 21(12):1708\u20131721","journal-title":"IEEE T Knowl Data En"},{"issue":"7","key":"7123_CR3","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/j.fss.2008.05.012","volume":"160","author":"J Alcal\u00e1-Fdez","year":"2009","unstructured":"Alcal\u00e1-Fdez J, Alcal\u00e1 R, Gacto MJ, Herrera F (2009) Learning the membership function contexts for mining fuzzy association rules by using genetic algorithms. Fuzzy Sets Syst 160(7):905\u2013921","journal-title":"Fuzzy Sets Syst"},{"key":"7123_CR4","doi-asserted-by":"crossref","first-page":"14389","DOI":"10.1109\/ACCESS.2017.2788083","volume":"6","author":"A Bai","year":"2018","unstructured":"Bai A, Deshpande PS, Dhabu M (2018) Selective database projections based approach for mining high-utility itemsets. IEEE Access 6:14389\u201314409","journal-title":"IEEE Access"},{"issue":"6","key":"7123_CR5","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1109\/TKDE.2010.32","volume":"22","author":"L Cao","year":"2010","unstructured":"Cao L (2010) Domain-driven data mining: Challenges and prospects. IEEE T Knowl Data En 22(6):755\u2013769","journal-title":"IEEE T Knowl Data En"},{"issue":"9","key":"7123_CR6","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1109\/TKDE.2009.143","volume":"22","author":"L Cao","year":"2010","unstructured":"Cao L, Zhao Y, Zhang H, Luo D, Zhang C, Park EK (2010) Flexible frameworks for actionable knowledge discovery. IEEE T Knowl Data En 22(9):1299\u20131312","journal-title":"IEEE T Knowl Data En"},{"key":"7123_CR7","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.artint.2016.03.001","volume":"235","author":"L Cao","year":"2016","unstructured":"Cao L, Dong X, Zheng Z (2016) e-NSP: efficient negative sequential pattern mining. Artif Intell 235:156\u2013182","journal-title":"Artif Intell"},{"key":"7123_CR8","doi-asserted-by":"crossref","unstructured":"Chan KC, Au WH (1997a) An effective algorithm for mining interesting quantitative association rules. In: proc 1997a ACM symposium on applied computing, ACM","DOI":"10.1145\/331697.331714"},{"key":"7123_CR9","doi-asserted-by":"crossref","unstructured":"Chan KC, Au WH (1997b) Mining fuzzy association rules. In: proc 6th int conf Information and knowledge management, ACM","DOI":"10.1145\/266714.266898"},{"key":"7123_CR10","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In Proc. 3rd IEEE Int. Conf. Data Mining, 2003, (Washington, D.C., USA, 2003). pp 19\u201322"},{"issue":"6","key":"7123_CR11","doi-asserted-by":"crossref","first-page":"10016","DOI":"10.1016\/j.eswa.2009.01.067","volume":"36","author":"CH Chen","year":"2009","unstructured":"Chen CH, Hong TP, Tseng VS (2009) An improved approach to find membership functions and multiple minimum supports in fuzzy data mining. Expert Syst Appl 36(6):10016\u201310024","journal-title":"Expert Syst Appl"},{"issue":"1","key":"7123_CR12","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.asoc.2011.08.006","volume":"12","author":"CH Chen","year":"2012","unstructured":"Chen CH, Hong TP, Tseng VS (2012) Fuzzy data mining for time-series data. Appl Soft Comput 12(1):536\u2013542","journal-title":"Appl Soft Comput"},{"issue":"12","key":"7123_CR13","doi-asserted-by":"crossref","first-page":"2413","DOI":"10.1007\/s00500-013-1214-4","volume":"18","author":"CH Chen","year":"2014","unstructured":"Chen CH, Li AF, Lee YC (2014) Actionable high-coherent-utility fuzzy itemset mining. Soft Comput 18(12):2413\u20132424","journal-title":"Soft Comput"},{"key":"7123_CR14","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s10489-017-0932-1","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Goyal V, Bera D (2017) A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl Intell 47:809\u2013827","journal-title":"Appl Intell"},{"key":"7123_CR15","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"ZH Deng","year":"2016","unstructured":"Deng ZH (2016) DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"issue":"10","key":"7123_CR16","doi-asserted-by":"crossref","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng ZH, Lv SL (2014) Fast mining frequent itemsets using nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"issue":"6","key":"7123_CR17","first-page":"733","volume":"3","author":"ZH Deng","year":"2010","unstructured":"Deng ZH, Wang ZH (2010) A new fast vertical method for mining frequent itemsets. Int J Comput Int Syst 3(6):733\u2013744","journal-title":"Int J Comput Int Syst"},{"issue":"9","key":"7123_CR18","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"ZH Deng","year":"2012","unstructured":"Deng ZH, Wang ZH, Jiang JJ (2012) A new algorithm for fast mining frequent itemsets using n-lists. Sci China Inform Sci 55(9):2008\u20132030","journal-title":"Sci China Inform Sci"},{"key":"7123_CR19","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2007) A bottom-up projection based algorithm for mining high utility itemsets. In: Proc. 2nd Int. Workshop Integrating artificial intelligence and data mining, 2007, (Gold Coast, Australia, 2007), vol 84. pp 3\u201311"},{"key":"7123_CR20","doi-asserted-by":"crossref","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2008) Efficient mining of high utility itemsets from large datasets, Pacific-Asia Conf. Advances in knowledge discovery and data mining, 2008, (Osaka, Japan, 2008), In: Washio T, Suzuki E, Ting KM, Inokuchi A (eds) Advances in knowledge discovery and data mining. PAKDD 2008. LNCS, vol 5012. Springer, Berlin, Heidelberg. pp 554\u2013561","DOI":"10.1007\/978-3-540-68125-0_50"},{"key":"7123_CR21","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: Int. symposium on methodologies for intelligent systems, (Roskilde, Denmark, 2013), In: Andreasen T, Christiansen H, Cubero JC, Ra\u015b ZW (eds) Foundations of intelligent systems. ISMIS, LNCS, vol 8502. Springer, Cham, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"7123_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2942594","author":"W Gan","year":"2019","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Tseng VS, Yu P (2019) A survey of utility-oriented pattern mining. IEEE T Knowl Data En. https:\/\/doi.org\/10.1109\/TKDE.2019.2942594","journal-title":"IEEE T Knowl Data En"},{"issue":"2","key":"7123_CR23","first-page":"305","volume":"15","author":"A Gyenesei","year":"2001","unstructured":"Gyenesei A (2001) A fuzzy approach for mining quantitativeassociation rules. Acta Cybern 15(2):305\u2013320","journal-title":"Acta Cybern"},{"key":"7123_CR24","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD Int. Conf. Management of data, 1993 (Dallas, TX, USA, 2000), ACM SIGMOD Record 29. pp 1\u201312","DOI":"10.1145\/335191.335372"},{"issue":"5","key":"7123_CR25","first-page":"363","volume":"3","author":"TP Hong","year":"1999","unstructured":"Hong TP, Kuo CS, Chi SH (1999) Mining association rules from quantitative data. Intell Data Anal 3(5):363\u2013376","journal-title":"Intell Data Anal"},{"issue":"2","key":"7123_CR26","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0165-0114(02)00272-5","volume":"138","author":"TP Hong","year":"2003","unstructured":"Hong TP, Lin KY, Wang SL (2003) Fuzzy data mining for interesting generalized association rules. Fuzzy Sets Syst 138(2):255\u2013269","journal-title":"Fuzzy Sets Syst"},{"issue":"1","key":"7123_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.asoc.2004.03.009","volume":"5","author":"TP Hong","year":"2004","unstructured":"Hong TP, Kuo CS, Chi SH (2004) A fuzzy AprioriTid mining algorithm with reduced computational time. Appl Soft Comput 5(1):1\u201310","journal-title":"Appl Soft Comput"},{"issue":"7","key":"7123_CR28","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\u20138265","journal-title":"Expert Syst Appl"},{"key":"7123_CR29","unstructured":"Hong TP, Chiang MJ, Wang SL (2002) Mining from quantitative data with linguistic minimum supports and confidences. Fuzzy systems, 2002. FUZZ-IEEE\u201902. In: Proceedings of the 2002 IEEE international conference on, IEEE.3"},{"key":"7123_CR30","doi-asserted-by":"crossref","unstructured":"Hong TP, Lin CW, Lin TC, Wang SL (2012) Incremental multiple fuzzy frequent pattern tree. In: Proc IEEE int conf fuzzy systems (FUZZ-IEEE)","DOI":"10.1109\/FUZZ-IEEE.2012.6251351"},{"issue":"3","key":"7123_CR31","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1016\/j.asoc.2011.11.017","volume":"12","author":"TCK Huang","year":"2012","unstructured":"Huang TCK (2012) Mining the change of customer behavior in fuzzy time-interval sequential patterns. Appl Soft Comput 12(3):1068\u20131086","journal-title":"Appl Soft Comput"},{"issue":"5","key":"7123_CR32","doi-asserted-by":"crossref","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":"1","key":"7123_CR33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/273244.273257","volume":"27","author":"CM Kuok","year":"1998","unstructured":"Kuok CM, Fu A, Wong MH (1998) Mining fuzzy association rules in databases. ACM SIGMOD Rec 27(1):41\u201346","journal-title":"ACM SIGMOD Rec"},{"issue":"10","key":"7123_CR34","first-page":"4347","volume":"6","author":"CP Lai","year":"2010","unstructured":"Lai CP, Chung PC, Tseng VS (2010) A novel algorithm for mining fuzzy high utility itemsets. Int J Innov Comput Inf Control (ICIC) 6(10):4347\u20134361","journal-title":"Int J Innov Comput Inf Control (ICIC)"},{"issue":"05","key":"7123_CR35","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng VS (2012a) Efficiently mining high average-utility itemsets with an improved upper-bound strategy. Int J Inf Tech Decis 11(05):1009\u20131030","journal-title":"Int J Inf Tech Decis"},{"issue":"1","key":"7123_CR36","first-page":"193","volume":"28","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng VS (2012b) A projection-based approach for discovering high average-utility itemsets. J Inf Sci Eng 28(1):193\u2013209","journal-title":"J Inf Sci Eng"},{"key":"7123_CR37","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"GC Lan","year":"2014","unstructured":"Lan GC, Hong TP, Tseng VS (2014) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38:85\u2013107","journal-title":"Knowl Inf Syst"},{"key":"7123_CR38","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.asoc.2015.01.055","volume":"30","author":"GC Lan","year":"2015","unstructured":"Lan GC, Hong TP, Lin YH, Wang SL (2015) Fuzzy utility mining with upper-bound measure. Appl Soft Comput 30:767\u2013777","journal-title":"Appl Soft Comput"},{"issue":"1","key":"7123_CR39","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.eswa.2006.09.011","volume":"34","author":"YC Lee","year":"2008","unstructured":"Lee YC, Hong TP, Wang TC (2008) Multi-levelfuzzy mining with multiple minimum supports. Expert Syst Appl 34(1):459\u2013468","journal-title":"Expert Syst Appl"},{"key":"7123_CR40","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.ins.2015.04.016","volume":"315","author":"H Lee","year":"2015","unstructured":"Lee H, Shao B, Kang U (2015) Fast graph mining with HBase. Inf Sci 315:56\u201366","journal-title":"Inf Sci"},{"key":"7123_CR41","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"YC Li","year":"2008","unstructured":"Li YC, Yeh JS, Chang CC (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64:198\u2013217","journal-title":"Data Knowl Eng"},{"issue":"1","key":"7123_CR42","doi-asserted-by":"crossref","first-page":"535","DOI":"10.3233\/IFS-131022","volume":"27","author":"CW Lin","year":"2014","unstructured":"Lin CW, Hong TP (2014) Mining fuzzy frequent itemsets based on UBFFP trees. J Intell Fuzzy Syst 27(1):535\u2013548","journal-title":"J Intell Fuzzy Syst"},{"issue":"6","key":"7123_CR43","doi-asserted-by":"crossref","first-page":"4560","DOI":"10.1016\/j.eswa.2009.12.052","volume":"37","author":"JCW Lin","year":"2010","unstructured":"Lin JCW, Hong TP, Lu WH (2010a) Linguistic data mining with fuzzy FP-trees. Expert Syst Appl 37(6):4560\u20134567","journal-title":"Expert Syst Appl"},{"issue":"2","key":"7123_CR44","first-page":"150","volume":"12","author":"JCW Lin","year":"2010","unstructured":"Lin JCW, Hong TP, Lu WH (2010b) An efficient tree-based fuzzy data mining approach. Int J Fuzzy Syst 12(2):150\u2013157","journal-title":"Int J Fuzzy Syst"},{"issue":"6","key":"7123_CR45","doi-asserted-by":"crossref","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","volume":"38","author":"JCW Lin","year":"2011","unstructured":"Lin JCW, 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"},{"key":"7123_CR46","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.asoc.2014.11.049","volume":"28","author":"JCW Lin","year":"2015","unstructured":"Lin JCW, Hong TP, Lin TC (2015) A CMFFP-tree algorithm to mine complete multiple fuzzy frequent itemsets. Appl Soft Comput 28:431\u2013439","journal-title":"Appl Soft Comput"},{"key":"7123_CR47","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 bounds. IEEE Access 5:12927\u201312940","journal-title":"IEEE Access"},{"key":"7123_CR48","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proc. 21st ACM Int. Conf. Information and knowledge management, Maui, Hawaii, USA. pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"7123_CR49","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Ho T, Cheung D, Liu H (eds) Pacific-Asia Conf. Advances in knowledge discovery and data mining, 2005, Hanoi, Vietnam. Advances in knowledge discovery and data mining 2005, LCNS, vol 3518, Springer, Heidelberg. pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"7123_CR50","doi-asserted-by":"crossref","unstructured":"Liu L,\u00a0Wang\u00a0K,\u00a0Fung BCM (2012) Direct discovery of high utility itemsets without candidate generation. In: Proc. 12th IEEE Int. Conf. Data mining, 2012, Washington, D.C., USA. pp\u00a0984\u2013989","DOI":"10.1109\/ICDM.2012.20"},{"key":"7123_CR51","doi-asserted-by":"crossref","unstructured":"Lu T, Vo B, Nguyen HT, Hong TP (2014) A new method for mining high average utility itemsets. In: Saeed K, Sn\u00e1\u0161el V (eds) computer information systems and industrial management. CISIM 2015. In: Lecture notes in computer science, vol 8838. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-662-45237-0_5"},{"key":"7123_CR52","unstructured":"Papadimitriou S, Mavroudi S (2005) The fuzzy frequent pattern tree. In: Proc 9th WSEAS int conf computers, ICCOMP'05. pp 1\u20137"},{"key":"7123_CR53","unstructured":"IBM Quest Data Mining Projection, Quest synthetic data generation code (1996) Available at http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.htm"},{"issue":"4","key":"7123_CR54","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1142\/S0219622019300027","volume":"18","author":"B Rahmati","year":"2019","unstructured":"Rahmati B, Sohrabi MK (2019) A systematic survey of high utility itemset mining. Int J Inf Tech Decis 18(4):1113\u20131185","journal-title":"Int J Inf Tech Decis"},{"key":"7123_CR55","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/s10115-016-0989-x","volume":"51","author":"H Ryang","year":"2017","unstructured":"Ryang H, Yun U (2017) Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques. Knowl Inf Syst 51:627\u2013659","journal-title":"Knowl Inf Syst"},{"issue":"6","key":"7123_CR56","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1109\/TKDE.2010.49","volume":"22","author":"ATH Sim","year":"2010","unstructured":"Sim ATH, Indrawan M, Zutshi S, Srinivasan B (2010) Logic-based pattern discovery. IEEE T Knowl Data En 22(6):798\u2013811","journal-title":"IEEE T Knowl Data En"},{"issue":"6","key":"7123_CR57","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1080\/17517575.2017.1405286","volume":"12","author":"MK Sohrabi","year":"2018","unstructured":"Sohrabi MK (2018) Gossip-based information fusion protocol for distributed frequent itemset mining. Enterp Inf Syst-UK 12(6):674\u2013694","journal-title":"Enterp Inf Syst-UK"},{"key":"7123_CR58","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.knosys.2012.03.003","volume":"33","author":"MK Sohrabi","year":"2012","unstructured":"Sohrabi MK, Barforoush AA (2012) Efficient colossal pattern mining in high dimensional datasets. Knowl-Based Syst 33:41\u201352","journal-title":"Knowl-Based Syst"},{"key":"7123_CR59","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.knosys.2012.09.005","volume":"37","author":"MK Sohrabi","year":"2013","unstructured":"Sohrabi MK, Barforoush AA (2013) Parallel frequent itemset mining using systolic arrays. Knowl-Based Syst 37:462\u2013471","journal-title":"Knowl-Based Syst"},{"key":"7123_CR60","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.chb.2016.11.036","volume":"68","author":"MK Sohrabi","year":"2017","unstructured":"Sohrabi MK, Roshani R (2017) Frequent itemset mining using cellular learning automata. Comput Hum Behav 68:244\u2013253","journal-title":"Comput Hum Behav"},{"key":"7123_CR61","doi-asserted-by":"crossref","unstructured":"Sohrabi MK, Ghods V (2014) Top-down vertical itemset mining. In: Proc. 6th Int. Conf. Graphic and image processing, ICGIP. pp 94431V\u201394431V7","DOI":"10.1117\/12.2179150"},{"key":"7123_CR62","doi-asserted-by":"crossref","unstructured":"Sohrabi MK, Ghods V (2016) CUSE: A novel cube-based approach for sequential pattern mining. In: Proc 4th int symposium on Computational and Business Intelligence (ISCBI), 2016, Olten, Switzerland. pp 186\u2013190","DOI":"10.1109\/ISCBI.2016.7743281"},{"issue":"2","key":"7123_CR63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/235968.233311","volume":"25","author":"R Srikant","year":"1996","unstructured":"Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. ACM SIGMOD Rec 25(2):1\u201312","journal-title":"ACM SIGMOD Rec"},{"key":"7123_CR64","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.engappai.2014.10.021","volume":"38","author":"MT Tran","year":"2015","unstructured":"Tran MT, Vo LB, B, (2015) Combination of dynamic bit vectors and transaction information for mining frequent closed sequences efficiently. Eng Appl Artif Intel 38:183\u2013189","journal-title":"Eng Appl Artif Intel"},{"issue":"2","key":"7123_CR65","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TKDE.2018.2833478","volume":"31","author":"T Truong","year":"2019","unstructured":"Truong T, Duong H, Le HB, Fournier-Viger P (2019) Efficient vertical mining of high average-utility itemsets based on novel upper-bounds. IEEE T Knowl Data En 31(2):301\u2013314","journal-title":"IEEE T Knowl Data En"},{"key":"7123_CR66","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 T Knowl Data En 25:1772\u20131786","journal-title":"IEEE T Knowl Data En"},{"key":"7123_CR67","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (2010) UP-Growth: An efficient algorithm for high utility itemset mining. In Proc. 16th ACM SIGKDD Int. Conf. Knowledge discovery and data mining, 2010, Washington, D.C., USA. pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"7123_CR68","doi-asserted-by":"crossref","unstructured":"Wang CM, Chen SH, Huang YF (2009) A fuzzy approach for mining high utility quantitative itemsets. In: 2009 IEEE int conf fuzzy systems, FUZZ-IEEE","DOI":"10.1109\/FUZZY.2009.5277408"},{"key":"7123_CR69","doi-asserted-by":"crossref","first-page":"18655","DOI":"10.1109\/ACCESS.2018.2820740","volume":"6","author":"JMT Wu","year":"2018","unstructured":"Wu JMT, Lin JCW, Pirouz M, Fournier-Viger P (2018) TUB-HAUPM: tighter upper bound for mining high average-utility patterns. IEEE Access 6:18655\u201318669","journal-title":"IEEE Access"},{"key":"7123_CR70","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59:603\u2013626","journal-title":"Data Knowl Eng"},{"key":"7123_CR71","unstructured":"Yue JS, Tseng E, Yeung D, Shi D (2000). Mining fuzzy association rules with weighted items. Systems. In: Proc 2000 IEEE int conf systems, man and cybernetics. pp 1906\u20131911"},{"key":"7123_CR72","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 Gener Comp Sy 68:346\u2013360","journal-title":"Future Gener Comp Sy"},{"key":"7123_CR73","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.eswa.2016.01.049","volume":"54","author":"U Yun","year":"2016","unstructured":"Yun U, Lee G (2016) Incremental mining of weighted maximal frequent itemsets from dynamic databases. Expert Syst Appl 54:304\u2013327","journal-title":"Expert Syst Appl"},{"key":"7123_CR74","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 C, 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":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07123-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07123-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07123-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T13:36:55Z","timestamp":1654868215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07123-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,25]]},"references-count":74,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["7123"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07123-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,25]]},"assertion":[{"value":"7 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Manijeh Hajihosseini (first author) declares that she has no conflict of interest. Mohammad Karim Sohrabi (second author) declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}