{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T03:22:01Z","timestamp":1778556121366,"version":"3.51.4"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10115-020-01485-w","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T17:02:56Z","timestamp":1596214976000},"page":"4141-4167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["An efficient projection-based method for high utility itemset mining using a novel pruning approach on the utility matrix"],"prefix":"10.1007","volume":"62","author":[{"given":"Mohammad Karim","family":"Sohrabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"1485_CR1","doi-asserted-by":"crossref","unstructured":"Sohrabi MK, Ghods V (2016). CUSE: A novel cube-based approach for sequential pattern mining. In: 4th international symposium on computational and business intelligence (ISCBI), pp 186\u2013190","DOI":"10.1109\/ISCBI.2016.7743281"},{"issue":"1","key":"1485_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10115-015-0872-1","volume":"48","author":"J Wu","year":"2016","unstructured":"Wu J, Hong Z, Pan S, Zhu X, Cai Z, Zhang C (2016) Multi-graph-view subgraph mining for graph classification. Knowl Inf Syst 48(1):29\u201354","journal-title":"Knowl Inf Syst"},{"key":"1485_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993ACM-SIGMOD international conference on management of data (SIGMOD\u201993), Washington, DC, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"1485_CR4","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceeding of the 2000 ACM-SIGMOD international conference on management of data (SIGMOD\u201900), Dallas, TX, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"1485_CR5","doi-asserted-by":"crossref","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":"1485_CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"key":"1485_CR7","doi-asserted-by":"crossref","unstructured":"Sohrabi MK, Ghods V (2014) Top-down vertical itemset mining. In: Proceedings of the SPIE 9443 sixth international conference on graphic and image processing","DOI":"10.1117\/12.2179150"},{"key":"1485_CR8","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":"1485_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.eswa.2018.03.041","volume":"105","author":"N Aryabarzan","year":"2018","unstructured":"Aryabarzan N, Minaei-Bidgoli B, Teshnehlab M (2018) negFIN: An efficient algorithm for fast mining frequent itemsets. Expert Syst Appl 105:129\u2013143","journal-title":"Expert Syst Appl"},{"key":"1485_CR10","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":"1485_CR11","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.eswa.2016.09.023","volume":"67","author":"T Hashem","year":"2017","unstructured":"Hashem T, Karim MR, Samiullah M, Ahmed CF (2017) An efficient dynamic superset bit-vector approach for mining frequent closed itemsets and their lattice structure. Expert Syst Appl 67:252\u2013271","journal-title":"Expert Syst Appl"},{"key":"1485_CR12","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"},{"issue":"6","key":"1485_CR13","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1080\/17517575.2017.1405286","volume":"12","author":"MK Sohrabi","year":"2018","unstructured":"Sohrabi MK (2018) A gossip based information fusion protocol for distributed frequent itemset mining. Enterp Inf Syst 12(6):674\u2013694","journal-title":"Enterp Inf Syst"},{"key":"1485_CR14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.ins.2018.07.020","volume":"496","author":"Y Djenouri","year":"2019","unstructured":"Djenouri Y, Djenouri D, Belhadi A, Cano A (2019) Exploiting GPU and cluster parallelism in single scan frequent itemset mining. Inf Sci 496:363\u2013377","journal-title":"Inf Sci"},{"key":"1485_CR15","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"},{"issue":"3","key":"1485_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1080\/02533839.2018.1454853","volume":"41","author":"MK Sohrabi","year":"2018","unstructured":"Sohrabi MK, Taheri N (2018) A haoop-based parallel mining of frequent itemsets using N-lists. J Chin Inst Eng 41(3):229\u2013238","journal-title":"J Chin Inst Eng"},{"key":"1485_CR17","unstructured":"Chan R, Yang Q, Shen Y-D (2003) Mining high utility itemsets. In: Proceedings of 3rd IEEE international conference data mining, 2003, (Washington, D.C., USA, 2003) pp. 19\u201322"},{"key":"1485_CR18","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of 3rd SIAM international conference on data mining, 2004, (Orlando, Florida, USA, 2004) pp 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"1485_CR19","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: Ho T, Cheung D, Liu H (eds), Pacific-Asia conference on advances in knowledge discovery and data Mining, 2005, (Hanoi, Vietnam, 2005), Advances in knowledge discovery and data mining 2005, LCNS, vol 3518, Springer, Heidelberg, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"issue":"3","key":"1485_CR20","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(3):603\u2013626","journal-title":"Data Knowl Eng"},{"issue":"1","key":"1485_CR21","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"Y-C Li","year":"2008","unstructured":"Li Y-C, Yeh J-S, Chang C-C (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64(1):198\u2013217","journal-title":"Data Knowl Eng"},{"issue":"12","key":"1485_CR22","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 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":"2","key":"1485_CR23","doi-asserted-by":"crossref","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 Intel 34(2):181\u2013198","journal-title":"Appl Intel"},{"issue":"6","key":"1485_CR24","doi-asserted-by":"crossref","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, Lu W-H (2011) An effective tree structure for mining high utility itemsets. Exp Syst Appl 38(6):7419\u20137424","journal-title":"Exp Syst Appl"},{"key":"1485_CR25","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 16th ACM SIGKDD international conference of knowledge discovery and data mining, 2010, (Washington, D.C., USA, 2010), pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"1485_CR26","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 Trans Knowl Data Eng 25(8):1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1485_CR27","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1007\/s11390-016-1662-2","volume":"31","author":"S-M Guo","year":"2016","unstructured":"Guo S-M, Gao H (2016) HUITWU: an efficient algorithm for high-utility itemset mining in transaction databases. J Comput Sci Technol 31(4):776\u2013786","journal-title":"J Comput Sci Technol"},{"key":"1485_CR28","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2007) A bottom-up projection based algorithm for mining high utility itemsets. In: Proceedings of 2nd international workshop integrating artificial intelligence and data mining, 2007, (Gold Coast, Australia, 2007), vol 84, pp 3\u201311"},{"key":"1485_CR29","doi-asserted-by":"crossref","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2008) Efficient mining of high utility itemsets from large datasets. In: Washio T, Suzuki E, Ting KM, Inokuchi A (Eds), Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, 2008, (Osaka, Japan, 2008), Advances in knowledge discovery and data mining. PAKDD 2008. LNCS. Springer, Berlin, vol 5012, pp 554\u2013561","DOI":"10.1007\/978-3-540-68125-0_50"},{"issue":"1","key":"1485_CR30","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"G-C Lan","year":"2014","unstructured":"Lan G-C, Hong T-P, Tseng VS (2014) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38(1):85\u2013107","journal-title":"Knowl Inf Syst"},{"key":"1485_CR31","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"},{"key":"1485_CR32","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of 21st ACM international conference on information and knowledge management, 2012, (Maui, Hawaii, USA, 2012), pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"1485_CR33","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K, Fung BCM (2012) Direct discovery of high utility itemsets without candidate generation. In: Proceedings 12th IEEE international conference on data mining, 2012, (Washington, D.C., USA, 2012) pp 984\u2013989","DOI":"10.1109\/ICDM.2012.20"},{"key":"1485_CR34","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: Andreasen T, Christiansen H, Cubero JC, Ra\u015b ZW (eds), International symposium on methodologies for intelligent systems, (Roskilde, Denmark, 2013), foundations of intelligent systems. ISMIS 2014, LNCS, Springer, Cham, vol 8502, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"5","key":"1485_CR35","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. Exp Syst Appl 42(5):2371\u20132381","journal-title":"Exp Syst Appl"},{"key":"1485_CR36","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2018","unstructured":"Krishnamoorthy S (2018) HMiner: efficiently mining high utility itemsets. Exp Syst Appl 90:168\u2013183","journal-title":"Exp Syst Appl"},{"issue":"2","key":"1485_CR37","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 JC-W, Wu C, 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":"3","key":"1485_CR38","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. Applied Intelligence 47(3):809\u2013827","journal-title":"Applied Intelligence"},{"issue":"2","key":"1485_CR39","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(2):627\u2013659","journal-title":"Knowl Inf Syst"},{"key":"1485_CR40","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Tseng VS, Yu PS (2018) A survey of utility-oriented pattern mining. arXiv: 1805.10511"},{"issue":"4","key":"1485_CR41","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 Technol Decis Mak 18(4):1113\u20131185","journal-title":"Int J Inf Technol Decis Mak"},{"issue":"2","key":"1485_CR42","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 Comput 215(2):767\u2013778","journal-title":"Appl Math Comput"},{"key":"1485_CR43","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.knosys.2016.08.022","volume":"111","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Fournier-Viger P, Gan W (2016) FHN: an efficient algorithm for mining high-utility itemsets with negative unit profits. Knowl-Based Syst 111:283\u2013298","journal-title":"Knowl-Based Syst"},{"key":"1485_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2017.12.035","volume":"145","author":"S Krishnamoorthy","year":"2018","unstructured":"Krishnamoorthy S (2018) Efficiently mining high utility itemsets with negative unit profits. Knowl-Based Syst 145:1\u201314","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"1485_CR45","doi-asserted-by":"publisher","first-page":"e12296","DOI":"10.1111\/exsy.12296","volume":"35","author":"K Singh","year":"2018","unstructured":"Singh K, Shakya HK, Singh A, Biswas B (2018) Mining of high-utility itemsets with negative utility. Expert Systems 35(6):e12296. https:\/\/doi.org\/10.1111\/exsy.12296","journal-title":"Expert Systems"},{"key":"1485_CR46","doi-asserted-by":"crossref","unstructured":"Hong T-P, Lee C-H, Wang S-L (2009) Mining high average-utility itemsets. In: Proceedings of IEEE international conference on systems, man and cybernetics, 2009, (San Antonio, TX, USA, 2009) pp 2526\u20132530","DOI":"10.1109\/ICSMC.2009.5346333"},{"issue":"7","key":"1485_CR47","doi-asserted-by":"crossref","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"T-P Hong","year":"2011","unstructured":"Hong T-P, Lee C-H, Wang S-L (2011) Effective utility mining with the measure of average utility. Exp Syst Appl 38(7):8259\u20138265","journal-title":"Exp Syst Appl"},{"issue":"1","key":"1485_CR48","first-page":"193","volume":"28","author":"G-C Lan","year":"2012","unstructured":"Lan G-C, Hong T-P, Tseng VS (2012) A projection-based approach for discovering high average-utility itemsets. J Inf Sci Eng 28(1):193\u2013209","journal-title":"J Inf Sci Eng"},{"issue":"2","key":"1485_CR49","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Li T, Fournier-Viger P, Hong T-P, Zhan J, Voznak M (2016) An efficient algorithm to mine high average-utility itemsets. Adv Eng Inf 30(2):233\u2013243","journal-title":"Adv Eng Inf"},{"issue":"2","key":"1485_CR50","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10489-017-0896-1","volume":"47","author":"JC-W Lin","year":"2017","unstructured":"Lin JC-W, Ren S, Fournier-Viger P, Hong T-P, Su J-H, Vo B (2017) A fast algorithm for mining high average-utility itemsets. Appl Intell 47(2):331\u2013346","journal-title":"Appl Intell"},{"key":"1485_CR51","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 Comput Syst 68:346\u2013360","journal-title":"Future Gener Comput Syst"},{"key":"1485_CR52","doi-asserted-by":"crossref","first-page":"12927","DOI":"10.1109\/ACCESS.2017.2717438","volume":"5","author":"JC-W Lin","year":"2017","unstructured":"Lin JC-W, Ren S, Fournier-Viger P, Hong T-P (2017) EHAUPM: efficient high average-utility pattern mining with tighter upper bounds. IEEE Access 5:12927\u201312940","journal-title":"IEEE Access"},{"key":"1485_CR53","doi-asserted-by":"crossref","first-page":"18655","DOI":"10.1109\/ACCESS.2018.2820740","volume":"6","author":"JM-T Wu","year":"2018","unstructured":"Wu JM-T, Lin JC-W, 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"},{"issue":"2","key":"1485_CR54","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 Trans Knowl Data Eng 31(2):301\u2013314","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1485_CR55","doi-asserted-by":"crossref","unstructured":"Wu C, Shie V, Tseng VS, Yu PS (2012) Mining top-k high utility itemsets. In: Proceedings 18th ACM SIGKDD international conference on knowledge discovery and data mining, 2012, (Beijing, China, 2012) pp 78\u201386","DOI":"10.1145\/2339530.2339546"},{"key":"1485_CR56","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","volume":"76","author":"H Ryang","year":"2015","unstructured":"Ryang H, Yun U (2015) Top-k high utility pattern mining with effective threshold raising strategies. Knowl-Based Syst 76:109\u2013126","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"1485_CR57","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2016","unstructured":"Tseng VS, Wu C, Fournier-Viger P, Yu PS (2016) Efficient algorithms for mining top-K high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54\u201367","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1485_CR58","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"Q-H Duong","year":"2016","unstructured":"Duong Q-H, Liao B, Fournier-Viger P, Dam T-L (2016) An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowl-Based Syst 104:106\u2013122","journal-title":"Knowl-Based Syst"},{"key":"1485_CR59","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ins.2018.02.035","volume":"441","author":"J Liu","year":"2018","unstructured":"Liu J, Zhang X, Fung BCM, Li J, Iqbal F (2018) Opportunistic mining of top-n high utility patterns. Inf Sci 441:171\u2013185","journal-title":"Inf Sci"},{"key":"1485_CR60","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.eswa.2018.09.051","volume":"117","author":"S Krishnamoorthy","year":"2019","unstructured":"Krishnamoorthy S (2019) Mining top-k high utility itemsets with effective threshold raising strategies. Expert Syst Appl 117:148\u2013165","journal-title":"Expert Syst Appl"},{"key":"1485_CR61","doi-asserted-by":"crossref","unstructured":"Wang C, Chen S, Huang Y (2009). A fuzzy approach for mining high utility quantitative itemsets. In: Proceedings of IEEE International conference on fuzzy systems, 2009, (Jeju Island, Korea, 2009) pp 1909\u20131913","DOI":"10.1109\/FUZZY.2009.5277408"},{"issue":"10","key":"1485_CR62","first-page":"4347","volume":"6","author":"C Lai","year":"2010","unstructured":"Lai C, Chung P, Tseng VS (2010) A novel algorithm for mining fuzzy high utility itemsets. Int J Innov Comput Inf Control 6(10):4347\u20134361","journal-title":"Int J Innov Comput Inf Control"},{"issue":"12","key":"1485_CR63","doi-asserted-by":"crossref","first-page":"2413","DOI":"10.1007\/s00500-013-1214-4","volume":"18","author":"C-H Chen","year":"2014","unstructured":"Chen C-H, Li A-F, Lee Y-C (2014) Actionable high-coherent-utility fuzzy itemset mining. Soft Comput 18(12):2413\u20132424","journal-title":"Soft Comput"},{"issue":"4","key":"1485_CR64","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1080\/08839514.2014.891839","volume":"28","author":"S Kannimuthu","year":"2014","unstructured":"Kannimuthu S, Premalatha K (2014) Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl Artif Intel 28(4):337\u2013359","journal-title":"Appl Artif Intel"},{"key":"1485_CR65","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","volume":"55","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Yang L, Fournier-Viger P, Wu JM-T, Hong T-P, Wang LS-L, Zhan J (2016) Mining high-utility itemsets based on particle swarm optimization. Eng Appl Artif Intell 55:320\u2013330","journal-title":"Eng Appl Artif Intell"},{"issue":"17","key":"1485_CR66","doi-asserted-by":"crossref","first-page":"5103","DOI":"10.1007\/s00500-016-2106-1","volume":"21","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Yang L, Fournier-Viger P, Hong T-P, Voznak M (2016) A binary PSO approach to mine high-utility itemsets. Soft Comput 21(17):5103\u20135121","journal-title":"Soft Comput"},{"key":"1485_CR67","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.knosys.2016.10.027","volume":"116","author":"JM-T Wu","year":"2017","unstructured":"Wu JM-T, Zhan J, Lin JC-W (2017) An ACO-based approach to mine high-utility itemsets. Knowl-Based Syst 116:102\u2013113","journal-title":"Knowl-Based Syst"},{"key":"1485_CR68","doi-asserted-by":"crossref","unstructured":"Khode S, Mohod S (2017) Mining high utility itemsets using TKO and TKU to find top-k high utility web access patterns. In: International conference of electronics, communication and aerospace technology (ICECA), pp 504\u2013509","DOI":"10.1109\/ICECA.2017.8203736"},{"issue":"1","key":"1485_CR69","doi-asserted-by":"crossref","first-page":"3","DOI":"10.4103\/0256-4602.74506","volume":"28","author":"CF Ahmed","year":"2011","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S (2011) A framework for mining high utility web access sequences. IETE Tech Rev 28(1):3\u201316","journal-title":"IETE Tech Rev"},{"key":"1485_CR70","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10586-018-1959-8","volume":"22","author":"T Tamilselvi","year":"2019","unstructured":"Tamilselvi T, Arasun GT (2019) Handling high web access utility mining using intelligent hybrid hill climbing algorithm based tree construction. Clust Comput 22:145\u2013155","journal-title":"Clust Comput"},{"issue":"2","key":"1485_CR71","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1080\/02564602.2014.1000396","volume":"32","author":"B Bakariya","year":"2015","unstructured":"Bakariya B, Thakur GS (2015) An efficient algorithm for extracting high utility itemsets from weblog data. IETE Tech Rev 32(2):151\u2013160","journal-title":"IETE Tech Rev"},{"key":"1485_CR72","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.eswa.2018.07.051","volume":"115","author":"H-J Choi","year":"2019","unstructured":"Choi H-J, Park CH (2019) Emerging topic detection in twitter stream based on high utility pattern mining. Exp Syst Appl 115:27\u201336","journal-title":"Exp Syst Appl"},{"key":"1485_CR73","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.knosys.2017.12.003","volume":"143","author":"W Gan","year":"2018","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Fujita H (2018) Extracting non-redundant correlated purchase behaviors by utility measure. Knowl-Based Syst 143:30\u201341","journal-title":"Knowl-Based Syst"},{"key":"1485_CR74","doi-asserted-by":"crossref","unstructured":"Padhye PR, Deshmukh RJ (2016) A marketing solution for cross-selling by high utility itemset mining with dynamic transactional databases. In: International conference on computational techniques in information and communication technologies (ICCTICT), pp 367\u2013373","DOI":"10.1109\/ICCTICT.2016.7514609"},{"key":"1485_CR75","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.knosys.2016.04.009","volume":"104","author":"C-H Weng","year":"2016","unstructured":"Weng C-H (2016) Discovering highly expected utility itemsets for revenue prediction. Knowl-Based Syst 104:39\u201351","journal-title":"Knowl-Based Syst"},{"issue":"9","key":"1485_CR76","doi-asserted-by":"crossref","first-page":"7239","DOI":"10.1109\/TIE.2017.2682782","volume":"64","author":"U Yun","year":"2017","unstructured":"Yun U, Lee G, Yoon E (2017) Efficient high utility pattern mining for establishing manufacturing plans with sliding window control. IEEE Trans Ind Electron 64(9):7239\u20137249","journal-title":"IEEE Trans Ind Electron"},{"key":"1485_CR77","doi-asserted-by":"crossref","unstructured":"Kannimuthu S, Premalatha K, Shankar S (2012) Investigation of high utility itemset mining in service oriented computing: deployment of knowledge as a service in E-commerce. In: 2012 fourth international conference on advanced computing (ICoAC), pp 1\u20138","DOI":"10.1109\/ICoAC.2012.6416812"},{"key":"1485_CR78","doi-asserted-by":"crossref","unstructured":"Yang R, Xu M, Jones P, Samatova N (2017) Real time utility-based recommendation for revenue optimization via an adaptive online Top-K high utility itemsets mining model. In: 13th international conference on natural computation, fuzzy systems and knowledge discovery (ICNC-FSKD), pp 1859\u20131866","DOI":"10.1109\/FSKD.2017.8393050"},{"issue":"3","key":"1485_CR79","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/s10489-012-0379-3","volume":"38","author":"B-E Shie","year":"2013","unstructured":"Shie B-E, Yu PS, Tseng VS (2013) Mining interesting user behavior patterns in mobile commerce environments. Appl Intell 38(3):418\u2013435","journal-title":"Appl Intell"},{"issue":"2","key":"1485_CR80","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10115-012-0483-z","volume":"37","author":"B-E Shie","year":"2013","unstructured":"Shie B-E, Hsiao H-F, Tseng VS (2013) Efficient algorithms for discovering high utility user behavior patterns in mobile commerce environments. Knowl Inf Syst 37(2):363\u2013387","journal-title":"Knowl Inf Syst"},{"key":"1485_CR81","unstructured":"Fournier-Viger P, Gomariz A, Soltani A, Lam H, Gueniche T (2014) SPMF: open-source data mining platform. http:\/\/www.philippe-fournier-viger.com\/spmf"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01485-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-020-01485-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01485-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T10:01:43Z","timestamp":1667642503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-020-01485-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":81,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1485"],"URL":"https:\/\/doi.org\/10.1007\/s10115-020-01485-w","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"12 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}