{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T01:13:02Z","timestamp":1775610782253,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T00:00:00Z","timestamp":1603670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T00:00:00Z","timestamp":1603670400000},"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":["Appl Intell"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10489-020-01994-9","type":"journal-article","created":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T16:02:51Z","timestamp":1603728171000},"page":"2077-2093","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Fast Top-K association rule mining using rule generation property pruning"],"prefix":"10.1007","volume":"51","author":[{"given":"Xiangyu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xinzheng","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,26]]},"reference":[{"key":"1994_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal R, Imielinski T, Swami AN (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. https:\/\/doi.org\/10.1145\/170035.170072","DOI":"10.1145\/170035.170072"},{"key":"1994_CR2","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.asoc.2017.11.013","volume":"62","author":"J Alwidian","year":"2018","unstructured":"Alwidian J, Hammo B, Obeid N (2018) WCBA: Weighted Classification based on association rules algorithm for breast cancer disease. Appl Soft Comput 62:536\u2013549. https:\/\/doi.org\/10.1016\/j.asoc.2017.11.013","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1994_CR3","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s13042-016-0546-7","volume":"9","author":"HS Anand","year":"2018","unstructured":"Anand HS, Vinodchandra SS (2018) Association rule mining using treap. Int J Mach Learn Cybern 9(4):589\u2013597. https:\/\/doi.org\/10.1007\/s13042-016-0546-7","journal-title":"Int J Mach Learn Cybern"},{"key":"1994_CR4","doi-asserted-by":"publisher","unstructured":"Anwar T, Uma V (2019) CD-SPM: Cross-domain book recommendation using sequential pattern mining and rule mining. Journal of King Saud University. https:\/\/doi.org\/10.1016\/j.jksuci.2019.01.012","DOI":"10.1016\/j.jksuci.2019.01.012"},{"issue":"24","key":"1994_CR5","doi-asserted-by":"publisher","first-page":"5398","DOI":"10.3390\/app9245398","volume":"9","author":"I Aqra","year":"2019","unstructured":"Aqra I, Ghani NA, Maple C, Machado JM, Safa NS (2019) Incremental algorithm for association rule mining under dynamic threshold. Appl Sci 9(24):5398. https:\/\/doi.org\/10.3390\/app9245398","journal-title":"Appl Sci"},{"key":"1994_CR6","doi-asserted-by":"publisher","unstructured":"Aryabarzan N, Minaeibidgoli B, Teshnehlab M (2018) negFIN: An efficient algorithm for fast mining frequent itemsets. Expert Syst Appl 105:129\u2013143. https:\/\/doi.org\/10.1016\/j.eswa.2018.03.041","DOI":"10.1016\/j.eswa.2018.03.041"},{"key":"1994_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jpdc.2018.11.002","volume":"125","author":"L Bustiomartinez","year":"2019","unstructured":"Bustiomartinez L, Letrasluna M, Cumplido R, Hernandezleon R, Feregrinouribe C, Bandeserrano JM (2019) Using hashing and lexicographic order for Frequent Itemsets Mining on data streams. J Parallel Distrib Comput 125:58\u201371. https:\/\/doi.org\/10.1016\/j.jpdc.2018.11.002","journal-title":"J Parallel Distrib Comput"},{"key":"1994_CR8","doi-asserted-by":"publisher","unstructured":"Chon KW, Hwang SH, Kim M (2018) GMiner: A fast GPU-based frequent itemset mining method for large-scale data. Inf Sci:19\u201338. https:\/\/doi.org\/10.1016\/j.ins.2018.01.046","DOI":"10.1016\/j.ins.2018.01.046"},{"issue":"5","key":"1994_CR9","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1007\/s00778-007-0078-6","volume":"17","author":"K-T Chuang","year":"2008","unstructured":"Chuang K-T, Huang J-L, Chen M-S (2008) Mining top-k frequent patterns in the presence of the memory constraint. VLDB J 17(5):1321\u20131344. https:\/\/doi.org\/10.1007\/s00778-007-0078-6","journal-title":"VLDB J"},{"key":"1994_CR10","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.eswa.2019.01.082","volume":"125","author":"G Czibula","year":"2019","unstructured":"Czibula G, Czibula IG, Miholca D, Crivei LM (2019) A novel concurrent relational association rule mining approach. Expert Syst Appl 125:142\u2013156. https:\/\/doi.org\/10.1016\/j.eswa.2019.01.082","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1994_CR11","doi-asserted-by":"publisher","first-page":"1763","DOI":"10.1016\/j.eswa.2013.08.075","volume":"41","author":"Z Deng","year":"2014","unstructured":"Deng Z (2014) Fast mining Top-Rank-k frequent patterns by using Node-lists. Expert Syst Appl 41(4):1763\u20131768. https:\/\/doi.org\/10.1016\/j.eswa.2013.08.075","journal-title":"Expert Syst Appl"},{"key":"1994_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.knosys.2017.10.016","volume":"139","author":"Y Djenouri","year":"2018","unstructured":"Djenouri Y, Belhadi A, Fournier-Viger P (2018) Extracting useful knowledge from event logs: a frequent itemset mining approach. Knowl Based Syst 139:132\u2013148. https:\/\/doi.org\/10.1016\/j.knosys.2017.10.016","journal-title":"Knowl Based Syst"},{"key":"1994_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.08.043","volume":"420","author":"Y Djenouri","year":"2017","unstructured":"Djenouri Y, Comuzzi M (2017) Combining Apriori heuristic and bio-inspired algorithms for solving the frequent itemsets mining problem. Inf Sci 420:1\u201315. https:\/\/doi.org\/10.1016\/j.ins.2017.08.043","journal-title":"Inf Sci"},{"key":"1994_CR14","doi-asserted-by":"publisher","unstructured":"Fournier-Viger P, Wu C, Tseng VS (2012) Mining top-k association rules. In: Proceedings of the 25th canadian conference on artificial intelligence, pp 61\u201373. https:\/\/doi.org\/10.1007\/978-3-642-30353-1_6","DOI":"10.1007\/978-3-642-30353-1_6"},{"key":"1994_CR15","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","volume":"481","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Zhang Y, Lin JC, Fujita H, Koh YS (2019) Mining local and peak high utility itemsets. Inf Sci 481:344\u2013367. https:\/\/doi.org\/10.1016\/j.ins.2018.12.070","journal-title":"Inf Sci"},{"key":"1994_CR16","doi-asserted-by":"publisher","unstructured":"Gan W, Lin JC, Fournier-Viger P, Chao H, Hong T, Fujita H (2018) A survey of incremental high-utility itemset mining. Wiley Interdiscip Rev-Data Min Knowl Discov 8(2). https:\/\/doi.org\/10.1002\/widm.1242","DOI":"10.1002\/widm.1242"},{"key":"1994_CR17","doi-asserted-by":"publisher","first-page":"31409","DOI":"10.1109\/ACCESS.2019.2902602","volume":"7","author":"X Han","year":"2019","unstructured":"Han X, Liu X, Chen J, Lai G, Gao H, Li J (2019) Efficiently mining frequent itemsets on massive data. IEEE Access 7:31409\u201331421. https:\/\/doi.org\/10.1109\/access.2019.2902602","journal-title":"IEEE Access"},{"key":"1994_CR18","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.eswa.2016.09.023","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1994_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/mmcks-2017-0001","volume":"12","author":"M Heydari","year":"2017","unstructured":"Heydari M, Yousefli A (2017) A new optimization model for market basket analysis with allocation considerations: a genetic algorithm solution approach. Manag Market 12(1):1\u201311. https:\/\/doi.org\/10.1515\/mmcks-2017-0001","journal-title":"Manag Market"},{"issue":"1","key":"1994_CR20","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.eswa.2014.07.045","volume":"42","author":"Q Huynhthile","year":"2015","unstructured":"Huynhthile Q, Le T, Vo B, Le B (2015) An efficient and effective algorithm for mining top-rank-k frequent patterns. Expert Syst Appl 42(1):156\u2013164. https:\/\/doi.org\/10.1016\/j.eswa.2014.07.045","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1994_CR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ijmedinf.2015.10.007","volume":"85","author":"W Jorritsma","year":"2016","unstructured":"Jorritsma W, Cnossen F, Dierckx R, Oudkerk M, Van Ooijen PMA (2016) Pattern mining of user interaction logs for a post-deployment usability evaluation of a radiology PACS client. Int J Med Inform 85(1):36\u201342. https:\/\/doi.org\/10.1016\/j.ijmedinf.2015.10.007","journal-title":"Int J Med Inform"},{"key":"1994_CR22","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.eswa.2018.07.006","volume":"113","author":"S Khan","year":"2018","unstructured":"Khan S, Parkinson S (2018) Eliciting and utilising knowledge for security event log analysis: an association rule mining and automated planning approach. Expert Syst Appl 113:116\u2013127. https:\/\/doi.org\/10.1016\/j.eswa.2018.07.006","journal-title":"Expert Syst Appl"},{"key":"1994_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.eswa.2017.05.021","volume":"85","author":"T Kieu","year":"2017","unstructured":"Kieu T, Vo B, Le T, Deng Z, Le B (2017) Mining top-k co-occurrence items with sequential pattern. Expert Syst Appl 85:123\u2013133. https:\/\/doi.org\/10.1016\/j.eswa.2017.05.021","journal-title":"Expert Syst Appl"},{"key":"1994_CR24","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.eswa.2018.09.051","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1994_CR25","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1002\/widm.1181","volume":"6","author":"T Le","year":"2016","unstructured":"Le T, Vo B (2016) The lattice-based approaches for mining association rules: a review. Wiley Interdiscip Rev-Data Min Knowl Discov 6(4):140\u2013151. https:\/\/doi.org\/10.1002\/widm.1181","journal-title":"Wiley Interdiscip Rev-Data Min Knowl Discov"},{"key":"1994_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2017.09.010","volume":"68","author":"T Le","year":"2018","unstructured":"Le T, Vo B, Baik SW (2018) Efficient algorithms for mining top-rank-k erasable patterns using pruning strategies and the subsume concept. Eng Appl Artif Intell 68:1\u20139. https:\/\/doi.org\/10.1016\/j.engappai.2017.09.010","journal-title":"Eng Appl Artif Intell"},{"key":"1994_CR27","doi-asserted-by":"publisher","unstructured":"Le T, Vo B, Huynh V, Nguyen NT, Baik SW (2020) Mining top- k frequent patterns from uncertain databases. Appl Intell:1\u201311. https:\/\/doi.org\/10.1007\/s10489-019-01622-1","DOI":"10.1007\/s10489-019-01622-1"},{"key":"1994_CR28","doi-asserted-by":"publisher","unstructured":"Li J, Ma X, Zhang J, Tao J, Wang P, Guan X (2017) Mining repeating pattern in packet arrivals: Metrics, models, and applications. Inf Sci 408:1\u201322. https:\/\/doi.org\/10.1016\/j.ins.2017.04.033","DOI":"10.1016\/j.ins.2017.04.033"},{"issue":"2","key":"1994_CR29","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JC Lin","year":"2016","unstructured":"Lin JC, Gan W, Fournier-Viger P, Hong T, Tseng VS (2016) Fast algorithms for mining high-utility itemsets with various discount strategies. Adv Eng Inform 30(2):109\u2013126. https:\/\/doi.org\/10.1016\/j.aei.2016.02.003","journal-title":"Adv Eng Inform"},{"key":"1994_CR30","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ins.2017.02.058","volume":"399","author":"T Mai","year":"2017","unstructured":"Mai T, Vo B, Nguyen LTT (2017) A lattice-based approach for mining high utility association rules. Inf Sci 399:81\u201397. https:\/\/doi.org\/10.1016\/j.ins.2017.02.058","journal-title":"Inf Sci"},{"issue":"6","key":"1994_CR31","doi-asserted-by":"publisher","first-page":"4319","DOI":"10.3233\/JIFS-16963","volume":"32","author":"U Mlakar","year":"2017","unstructured":"Mlakar U, Zorman M, Fister I (2017) Modified binary cuckoo search for association rule mining. J Intell Fuzzy Syst 32(6):4319\u20134330. https:\/\/doi.org\/10.3233\/JIFS-16963","journal-title":"J Intell Fuzzy Syst"},{"key":"1994_CR32","doi-asserted-by":"publisher","unstructured":"Moslehi F, Haeri A, Martinezalvarez F (2020) A novel hybrid GA\u2013PSO framework for mining quantitative association rules. In: soft computing, pp 4645\u20134666. https:\/\/doi.org\/10.1007\/s00500-019-04226-6","DOI":"10.1007\/s00500-019-04226-6"},{"key":"1994_CR33","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.knosys.2018.07.031","volume":"161","author":"D Nguyen","year":"2018","unstructured":"Nguyen D, Luo W, Phung D, Venkatesh S (2018) LTARM: A novel temporal association rule mining method to understand toxicities in a routine cancer treatment. Knowl Based Syst 161:313\u2013328. https:\/\/doi.org\/10.1016\/j.knosys.2018.07.031","journal-title":"Knowl Based Syst"},{"issue":"5","key":"1994_CR34","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1007\/s10489-017-1047-4","volume":"48","author":"LTT Nguyen","year":"2017","unstructured":"Nguyen LTT, Vo B, Nguyen LTT, Fournier-Viger P, Selamat A (2017) ETARM: An efficient top-k association rule mining algorithm. Appl Intell 48(5):1148\u20131160. https:\/\/doi.org\/10.1007\/s10489-017-1047-4","journal-title":"Appl Intell"},{"issue":"9","key":"1994_CR35","doi-asserted-by":"publisher","first-page":"3565","DOI":"10.1007\/s10115-020-01464-1","volume":"62","author":"S Raj","year":"2020","unstructured":"Raj S, Ramesh D, Sreenu M, Sethi KK (2020) EAFIM: Efficient apriori-based frequent itemset mining algorithm on Spark for big transactional data. Knowl Inf Syst 62(9):3565\u20133583. https:\/\/doi.org\/10.1007\/s10115-020-01464-1","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"1994_CR36","doi-asserted-by":"publisher","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(1):109\u2013126. https:\/\/doi.org\/10.1016\/j.knosys.2014.12.010","journal-title":"Knowl Based Syst"},{"issue":"13","key":"1994_CR37","doi-asserted-by":"publisher","first-page":"5754","DOI":"10.1016\/j.eswa.2015.02.051","volume":"42","author":"J Sahoo","year":"2015","unstructured":"Sahoo J, Das AK, Goswami A (2015) An efficient approach for mining association rules from high utility itemsets. Expert Syst Appl 42(13):5754\u20135778. https:\/\/doi.org\/10.1016\/j.eswa.2015.02.051","journal-title":"Expert Syst Appl"},{"key":"1994_CR38","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.knosys.2018.04.038","volume":"154","author":"LH Son","year":"2018","unstructured":"Son LH, Chiclana F, Kumar R, Mittal M, Khari M, Chatterjee JM, Baik SW (2018) ARM-AMO: An efficient association rule mining algorithm based on animal migration optimization. Knowl Based Syst 154:68\u201380. https:\/\/doi.org\/10.1016\/j.knosys.2018.04.038","journal-title":"Knowl Based Syst"},{"key":"1994_CR39","doi-asserted-by":"publisher","unstructured":"Telikani A, Gandomi AH, Shahbahrami A (2020) A survey of evolutionary computation for association rule mining. Information Sciences. https:\/\/doi.org\/10.1016\/j.ins.2020.02.073","DOI":"10.1016\/j.ins.2020.02.073"},{"key":"1994_CR40","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.eswa.2016.06.041","volume":"63","author":"F Thabtah","year":"2016","unstructured":"Thabtah F, Qabajeh I, Chiclana F (2016) Constrained dynamic rule induction learning. Expert Syst Appl 63:74\u201385. https:\/\/doi.org\/10.1016\/j.eswa.2016.06.041","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1994_CR41","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1109\/TKDE.2015.2458860","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1994_CR42","doi-asserted-by":"publisher","unstructured":"Vo B, Bui H, Vo T, Le T (2020) Mining top-rank-k frequent weighted itemsets using WN-list structures and an early pruning strategy. Knowl-Based Syst 201-202:106064. https:\/\/doi.org\/10.1016\/j.knosys.2020.106064","DOI":"10.1016\/j.knosys.2020.106064"},{"issue":"5","key":"1994_CR43","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J Wang","year":"2005","unstructured":"Wang J, Han J, Lu Y, Tzvetkov P (2005) TFP: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans Knowl Data Eng 17(5):652\u2013664. https:\/\/doi.org\/10.1109\/TKDE.2005.81","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1994_CR44","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2017.09.013","volume":"62","author":"L Wang","year":"2018","unstructured":"Wang L, Meng J, Xu P, Peng K (2018) Mining temporal association rules with frequent itemsets tree. Appl Soft Comput 62:817\u2013829. https:\/\/doi.org\/10.1016\/j.asoc.2017.09.013","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1994_CR45","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/widm.28","volume":"1","author":"GI Webb","year":"2011","unstructured":"Webb GI (2011) Filtered-top-k association discovery. Wiley Interdiscip Revi-Data Min Knowl Discov 1(3):183\u2013192. https:\/\/doi.org\/10.1002\/widm.28","journal-title":"Wiley Interdiscip Revi-Data Min Knowl Discov"},{"issue":"1","key":"1994_CR46","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10618-005-0255-4","volume":"10","author":"GI Webb","year":"2005","unstructured":"Webb GI, Zhang S (2005) K-Optimal Rule discovery. Data Min Knowl Disc 10(1):39\u201379. https:\/\/doi.org\/10.1007\/s10618-005-0255-4","journal-title":"Data Min Knowl Disc"},{"key":"1994_CR47","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/j.cie.2019.03.020","volume":"130","author":"F Wen","year":"2019","unstructured":"Wen F, Zhang G, Sun L, Wang X, Xu X (2019) A hybrid temporal association rules mining method for traffic congestion prediction. Comput Ind Eng 130:779\u2013787. https:\/\/doi.org\/10.1016\/j.cie.2019.03.020","journal-title":"Comput Ind Eng"},{"key":"1994_CR48","doi-asserted-by":"publisher","first-page":"28877","DOI":"10.1109\/ACCESS.2018.2839752","volume":"6","author":"X Xiong","year":"2018","unstructured":"Xiong X, Chen F, Huang P, Tian M, Hu X, Chen B, Qin J (2018) Frequent itemsets mining with differential privacy over Large-Scale data. IEEE Access 6:28877\u201328889. https:\/\/doi.org\/10.1109\/access.2018.2839752","journal-title":"IEEE Access"},{"key":"1994_CR49","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.cie.2019.01.040","volume":"129","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Chai N, Ostrosi E, Shang Y (2019) Extraction of association rules in the schematic design of product service system based on pareto-MODGDFA. Comput Ind Eng 129:392\u2013403. https:\/\/doi.org\/10.1016\/j.cie.2019.01.040","journal-title":"Comput Ind Eng"},{"key":"1994_CR50","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.engappai.2017.07.016","volume":"65","author":"Z Zhang","year":"2017","unstructured":"Zhang Z, Pedrycz W, Huang J (2017) Efficient frequent itemsets mining through sampling and information granulation. Eng Appl Artif Intell 65:119\u2013136. https:\/\/doi.org\/10.1016\/j.engappai.2017.07.016","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-020-01994-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01994-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01994-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:40:15Z","timestamp":1635208815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01994-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,26]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1994"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01994-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,26]]},"assertion":[{"value":"1 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}