{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:45:44Z","timestamp":1769442344502,"version":"3.49.0"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:00:00Z","timestamp":1584489600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:00:00Z","timestamp":1584489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NTNU Norwegian University of Science and Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper explores five pattern mining problems and proposes a new distributed framework called DT-DPM: Decomposition Transaction for Distributed Pattern Mining. DT-DPM addresses the limitations of the existing pattern mining problems by reducing the enumeration search space. Thus, it derives the relevant patterns by studying the different correlation among the transactions. It first decomposes the set of transactions into several clusters of different sizes, and then explores heterogeneous architectures, including MapReduce, single CPU, and multi CPU, based on the densities of each subset of transactions. To evaluate the DT-DPM framework, extensive experiments were carried out by solving five pattern mining problems (FIM: Frequent Itemset Mining, WIM: Weighted Itemset Mining, UIM: Uncertain Itemset Mining, HUIM: High Utility Itemset Mining, and SPM: Sequential Pattern Mining). Experimental results reveal that by using DT-DPM, the scalability of the pattern mining algorithms was improved on large databases. Results also reveal that DT-DPM outperforms the baseline parallel pattern mining algorithms on big databases.<\/jats:p>","DOI":"10.1007\/s10489-020-01664-w","type":"journal-article","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T19:02:52Z","timestamp":1584558172000},"page":"2647-2662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A general-purpose distributed pattern mining system"],"prefix":"10.1007","volume":"50","author":[{"given":"Asma","family":"Belhadi","sequence":"first","affiliation":[]},{"given":"Youcef","family":"Djenouri","sequence":"additional","affiliation":[]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Cano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"1664_CR1","unstructured":"H. Belhadi, K. Akli-Astouati, Y. Djenouri, and J. C.-W. Lin Data mining-based approach for ontology matching problem. Appl Intell, pp. 1\u201318"},{"key":"1664_CR2","doi-asserted-by":"crossref","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","journal-title":"Knowl-Based Syst"},{"key":"1664_CR3","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.eswa.2017.10.042","volume":"94","author":"Y Djenouri","year":"2018","unstructured":"Djenouri Y, Belhadi A, Belkebir R (2018) Bees swarm optimization guided by data mining techniques for document information retrieval. Expert Syst Appl 94:126\u2013136","journal-title":"Expert Syst Appl"},{"key":"1664_CR4","doi-asserted-by":"crossref","unstructured":"Djenouri Y, Djamel D, Djenoouri Z (2017) Data-mining-based decomposition for solving MAXSAT problem: towards a new approach. IEEE Intell Syst, vol. In press, pp. 1\u201315","DOI":"10.1109\/MIS.2017.3121546"},{"key":"1664_CR5","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.ins.2018.11.043","volume":"478","author":"Z He","year":"2019","unstructured":"He Z, Zhang S, Gu F, Wu J (2019) Mining conditional discriminative sequential patterns. Inf Sci 478:524\u2013539","journal-title":"Inf Sci"},{"key":"1664_CR6","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. Expert Syst Appl 115:27\u201336","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1664_CR7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/3311950","volume":"52","author":"D Djenouri","year":"2019","unstructured":"Djenouri D, Laidi R, Djenouri Y, Balasingham I (2019) Machine learning for smart building applications: Review and taxonomy. ACM Comput Surv (CSUR) 52(2):24","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1664_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JC-W, Vo B, Chi TT, Zhang J, Le HB (2017) A survey of itemset mining. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery (4):7, e1207","DOI":"10.1002\/widm.1207"},{"key":"1664_CR9","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Han J (2014) Frequent pattern mining. Springer","DOI":"10.1007\/978-3-319-07821-2"},{"key":"1664_CR10","first-page":"840","volume":"19","author":"B Goethals","year":"2003","unstructured":"Goethals B (2003) Survey on frequent pattern mining. Univ Hels 19:840\u2013852","journal-title":"Univ Hels"},{"issue":"1","key":"1664_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1824795.1824798","volume":"43","author":"NR Mabroukeh","year":"2010","unstructured":"Mabroukeh NR, Ezeife CI (2010) A taxonomy of sequential pattern mining algorithms. ACM Comput Surv (CSUR) 43(1):3","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1664_CR12","unstructured":"Hsieh Y-H, Chen C-C, Shuai H-H, Chen M-S (2018) Highly parallel sequential pattern mining on a heterogeneous platform. in IEEE International Conference on Data Mining, pp. 1037\u20131042"},{"key":"1664_CR13","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1016\/j.asoc.2017.09.033","volume":"62","author":"L Zhang","year":"2018","unstructured":"Zhang L, Fu G, Cheng F, Qiu J, Su Y (2018) A multi-objective evolutionary approach for mining frequent and high utility itemsets. Appl Soft Comput 62:974\u2013986","journal-title":"Appl Soft Comput"},{"key":"1664_CR14","doi-asserted-by":"crossref","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","journal-title":"Inf Sci"},{"issue":"1","key":"1664_CR15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TPDS.2016.2560176","volume":"28","author":"Y Xun","year":"2017","unstructured":"Xun Y, Zhang J, Qin X, Zhao X (2017) FiDoop-DP: data partitioning in frequent itemset mining on hadoop clusters. IEEE Transactions on Parallel and Distributed Systems 28(1):101\u2013114","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"1664_CR16","unstructured":"Baralis E, Cagliero L, Garza P, Grimaudo L (2015) Pawi: Parallel weighted itemset mining by means of mapreduce, in IEEE International Congress on Big Data, pp. 25\u201332"},{"key":"1664_CR17","unstructured":"Leung CK-S, Hayduk Y (2013) Mining frequent patterns from uncertain data with mapreduce for big data analytics, in International Conference on Database Systems for Advanced Applications, pp. 440\u2013455"},{"key":"1664_CR18","unstructured":"Miliaraki I, Berberich K, Gemulla R, Zoupanos S (2013) Mind the gap: Large-scale frequent sequence mining, in ACM SIGMOD International Conference on Management of Data, pp. 797\u2013808"},{"key":"1664_CR19","unstructured":"Djenouri Y, Lin JC-W, N\u00f8rv\u00e5\u030ag K, Ramampiaro H (2019) Highly efficient pattern mining based on transaction decomposition, in IEEE International Conference on Data Engineering, pp. 1646\u20131649"},{"key":"1664_CR20","doi-asserted-by":"crossref","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-W, Fujita H, Koh YS (2019) Mining local and peak high utility itemsets. Inf Sci 481:344\u2013367","journal-title":"Inf Sci"},{"key":"1664_CR21","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","volume":"144","author":"U Yun","year":"2018","unstructured":"Yun U, Kim D, Yoon E, Fujita H (2018) Damped window based high average utility pattern mining over data streams. Knowl-Based Syst 144:188\u2013205","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"1664_CR22","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Rec 22(2):207\u2013216","journal-title":"ACM SIGMOD Rec"},{"issue":"2","key":"1664_CR23","doi-asserted-by":"crossref","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"},{"key":"1664_CR24","doi-asserted-by":"crossref","first-page":"29 271","DOI":"10.1109\/ACCESS.2018.2839751","volume":"6","author":"X Zhao","year":"2018","unstructured":"Zhao X, Zhang X, Wang P, Chen S, Sun Z (2018) A weighted frequent itemset mining algorithm for intelligent decision in smart systems. IEEE Access 6:29 271\u201329 282","journal-title":"IEEE Access"},{"key":"1664_CR25","doi-asserted-by":"crossref","unstructured":"Yun U, Leggett JJ (2005) WFIM: weighted frequent itemset mining with a weight range and a minimum weight. in SIAM International Conference on Data Mining, pp. 636\u2013640","DOI":"10.1137\/1.9781611972757.76"},{"issue":"17","key":"1664_CR26","doi-asserted-by":"crossref","first-page":"3477","DOI":"10.1016\/j.ins.2007.03.018","volume":"177","author":"U Yun","year":"2007","unstructured":"Yun U (2007) Efficient mining of weighted interesting patterns with a strong weight and\/or support affinity. Inf Sci 177(17):3477\u20133499","journal-title":"Inf Sci"},{"issue":"2","key":"1664_CR27","doi-asserted-by":"crossref","first-page":"359","DOI":"10.3233\/IDA-2009-0370","volume":"13","author":"U Yun","year":"2009","unstructured":"Yun U (2009) On pushing weight constraints deeply into frequent itemset mining. Intelligent Data Analysis 13(2):359\u2013383","journal-title":"Intelligent Data Analysis"},{"key":"1664_CR28","first-page":"149","volume":"514","author":"N-T Le","year":"2019","unstructured":"Le N-T, Vo B, Nguyen LB, Fujita H, Le B (2019) Mining weighted subgraphs in a single large graph. Inf Sci 514:149\u2013165","journal-title":"Inf Sci"},{"issue":"01","key":"1664_CR29","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1142\/S0218488517500052","volume":"25","author":"G Lee","year":"2017","unstructured":"Lee G, Yun U, Ryu KH (2017) Mining frequent weighted itemsets without storing transaction ids and generating candidates. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 25(01):111\u2013144","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"1664_CR30","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.eswa.2018.06.042","volume":"112","author":"H Li","year":"2018","unstructured":"Li H, Zhang N, Zhu J, Wang Y, Cao H (2018) Probabilistic frequent itemset mining over uncertain data streams. Expert Syst Appl 112:274\u2013287","journal-title":"Expert Syst Appl"},{"key":"1664_CR31","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.knosys.2015.08.018","volume":"90","author":"G Lee","year":"2015","unstructured":"Lee G, Yun U, Ryang H (2015) An uncertainty-based approach: frequent itemset mining from uncertain data with different item importance. Knowl-Based Syst 90:239\u2013256","journal-title":"Knowl-Based Syst"},{"issue":"8","key":"1664_CR32","doi-asserted-by":"crossref","first-page":"2982","DOI":"10.1007\/s10489-019-01412-9","volume":"49","author":"M Liaqat","year":"2019","unstructured":"Liaqat M, Khan S, Younis MS, Majid M, Rajpoot K (2019) Applying uncertain frequent pattern mining to improve ranking of retrieved images. Appl Intell 49(8):2982\u20133001","journal-title":"Appl Intell"},{"key":"1664_CR33","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.future.2016.09.007","volume":"68","author":"G Lee","year":"2017","unstructured":"Lee G, Yun U (2017) A new efficient approach for mining uncertain frequent patterns using minimum data structure without false positives. Futur Gener Comput Syst 68:89\u2013110","journal-title":"Futur Gener Comput Syst"},{"key":"1664_CR34","unstructured":"Chan R, Yang Q, and Shen Y-D (2003) Mining high utility itemsets, in IEEE International Conference on Data mining, pp. 19\u201326"},{"key":"1664_CR35","unstructured":"Liu Y, Liao W-k, and Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets, in Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 689\u2013695"},{"issue":"6","key":"1664_CR36","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. Expert Syst Appl 38(6):7419\u20137424","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1664_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-W, Tseng VS (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625","journal-title":"Knowl Inf Syst"},{"key":"1664_CR38","unstructured":"Liu J, Wang K, and Fung BC (2012) Direct discovery of high utility itemsets without candidate generation, in IEEE International Conference on Data Mining, pp. 984\u2013989"},{"issue":"3","key":"1664_CR39","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1007\/s10489-018-1316-x","volume":"49","author":"K Singh","year":"2019","unstructured":"Singh K, Singh SS, Kumar A, Biswas B (2019) TKEH: an efficient algorithm for mining top-k high utility itemsets. Appl Intell 49(3):1078\u20131097","journal-title":"Appl Intell"},{"key":"1664_CR40","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.ins.2019.07.005","volume":"504","author":"W Gan","year":"2019","unstructured":"Gan W, Lin JC-W, Chao H-C, Fujita H, Philip SY (2019) Correlated utility-based pattern mining. Inf Sci 504:470\u2013486","journal-title":"Inf Sci"},{"key":"1664_CR41","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.engappai.2018.03.020","volume":"72","author":"J Lee","year":"2018","unstructured":"Lee J, Yun U, Lee G, Yoon E (2018) Efficient incremental high utility pattern mining based on pre-large concept. Eng Appl Artif Intell 72:111\u2013123","journal-title":"Eng Appl Artif Intell"},{"key":"1664_CR42","unstructured":"Salvemini E, Fumarola F, Malerba D, and Han J (2011) Fast sequence mining based on sparse id-lists, in International Symposium on Methodologies for Intelligent Systems, pp. 316\u2013325"},{"issue":"2","key":"1664_CR43","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10115-015-0884-x","volume":"48","author":"F Fumarola","year":"2016","unstructured":"Fumarola F, Lanotte PF, Ceci M, Malerba D (2016) CloFAST: closed sequential pattern mining using sparse and vertical id-lists. Knowl Inf Syst 48(2):429\u2013463","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"1664_CR44","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10115-018-1161-6","volume":"57","author":"T Van","year":"2018","unstructured":"Van T, Vo B, Le B (2018) Mining sequential patterns with itemset constraints. Knowl Inf Syst 57(2):311\u2013330","journal-title":"Knowl Inf Syst"},{"issue":"9","key":"1664_CR45","doi-asserted-by":"crossref","first-page":"948","DOI":"10.14778\/3329772.3329773","volume":"12","author":"F Orakzai","year":"2019","unstructured":"Orakzai F, Calders T, Pedersen TB (2019) k\/2-hop: fast mining of convoy patterns with effective pruning. Proceedings of the VLDB Endowment 12(9):948\u2013960","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"12","key":"1664_CR46","doi-asserted-by":"crossref","first-page":"4348","DOI":"10.1007\/s10489-019-01492-7","volume":"49","author":"R Wu","year":"2019","unstructured":"Wu R, Li Q, Chen X (2019) Mining contrast sequential pattern based on subsequence time distribution variation with discreteness constraints. Appl Intell 49(12):4348\u20134360","journal-title":"Appl Intell"},{"key":"1664_CR47","doi-asserted-by":"crossref","first-page":"10 015","DOI":"10.1109\/ACCESS.2019.2891933","volume":"7","author":"Y Djenouri","year":"2019","unstructured":"Djenouri Y, Belhadi A, Lin J, Cano A (2019) Adapted k nearest neighbors for detecting anomalies on spatio-temporal traffic flow. IEEE Access 7:10 015\u201310 027","journal-title":"IEEE Access"},{"key":"1664_CR48","unstructured":"Belhadi A, Djenouri Y, Lin JC-W, Djenouri D, and Cano A (2020) A GPU-based two phase algorithm for identifying taxi frauds, IEEE Access, vol. In Press, pp. 1\u201314"},{"key":"1664_CR49","doi-asserted-by":"crossref","first-page":"10 569","DOI":"10.1109\/ACCESS.2020.2964682","volume":"8","author":"A Belhadi","year":"2020","unstructured":"Belhadi A, Djenouri Y, Lin JC-W, Zhang CC, Cano A (2020) Exploring pattern mining algorithms for hashtag retrieval problem. IEEE Access 8:10 569\u201310 583","journal-title":"IEEE Access"},{"issue":"3","key":"1664_CR50","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/69.846289","volume":"12","author":"E-H Han","year":"2000","unstructured":"Han E-H, Karypis G, Kumar V (2000) Scalable parallel data mining for association rules. IEEE Trans Knowl Data Eng 12(3):337\u2013352","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1664_CR51","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"MJ Zaki","year":"1999","unstructured":"Zaki MJ (1999) Parallel and distributed association mining: a survey. IEEE Concurr 7(4):14\u201325","journal-title":"IEEE Concurr"},{"issue":"1","key":"1664_CR52","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TKDE.2013.109","volume":"26","author":"X Wu","year":"2014","unstructured":"Wu X, Zhu X, Wu G-Q, Ding W (2014) Data mining with big data. IEEE Trans Knowl Data Eng 26(1):97\u2013107","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1664_CR53","first-page":"e1232","volume":"8","author":"A Cano","year":"2018","unstructured":"Cano A (2018) A survey on graphic processing unit computing for large-scale data mining. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 8(1):e1232","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"1664_CR54","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":"1664_CR55","doi-asserted-by":"crossref","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 research 6:26\u201342","journal-title":"Big data research"},{"key":"1664_CR56","unstructured":"Moens S, Aksehirli E, and Goethals B (2013) Frequent itemset mining for big data, in IEEE International Conference on Big Data, pp. 111\u2013118"},{"issue":"3","key":"1664_CR57","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1007\/s11227-011-0672-7","volume":"64","author":"L Jian","year":"2013","unstructured":"Jian L, Wang C, Liu Y, Liang S, Yi W, Shi Y (2013) Parallel data mining techniques on graphics processing unit with compute unified device architecture (CUDA). J Supercomput 64(3):942\u2013967","journal-title":"J Supercomput"},{"issue":"4","key":"1664_CR58","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1007\/s11227-014-1366-8","volume":"71","author":"Y Djenouri","year":"2015","unstructured":"Djenouri Y, Bendjoudi A, Mehdi M, Nouali-Taboudjemat N, Habbas Z (2015) GPU-based bees swarm optimization for association rules mining. J Supercomput 71(4):1318\u20131344","journal-title":"J Supercomput"},{"key":"1664_CR59","doi-asserted-by":"crossref","unstructured":"Djenouri Y, Bendjoudi A, Habbas Z, Mehdi M, Djenouri D (2017) Reducing thread divergence in gpu-based bees swarm optimization applied to association rule mining. Concurrency and Computation: Practice and Experience 29(9)","DOI":"10.1002\/cpe.3836"},{"key":"1664_CR60","doi-asserted-by":"crossref","unstructured":"Li Y, Xu J, Yuan Y-H, and Chen L (2017) A new closed frequent itemset mining algorithm based on GPU and improved vertical structure. Concurrency and Computation: Practice and Experience, vol. 29, no. 6","DOI":"10.1002\/cpe.3904"},{"issue":"3","key":"1664_CR61","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TSMC.2015.2437327","volume":"46","author":"Y Xun","year":"2016","unstructured":"Xun Y, Zhang J, Qin X (2016) FiDoop: parallel mining of frequent itemsets using mapreduce. IEEE Transactions on Systems, Man, and Cybernetics: systems 46(3):313\u2013325","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: systems"},{"key":"1664_CR62","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.ins.2018.09.016","volume":"496","author":"W Andrzejewski","year":"2019","unstructured":"Andrzejewski W, Boinski P (2019) Parallel approach to incremental co-location pattern mining. Inf Sci 496:485\u2013505","journal-title":"Inf Sci"},{"key":"1664_CR63","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.eswa.2017.10.025","volume":"93","author":"W Andrzejewski","year":"2018","unstructured":"Andrzejewski W, Boinski P (2018) Efficient spatial co-location pattern mining on multiple GPUs. Expert Syst Appl 93:465\u2013483","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1664_CR64","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1007\/s11227-018-2297-6","volume":"75","author":"Y Jiang","year":"2019","unstructured":"Jiang Y, Zhao M, Hu C, He L, Bai H, Wang J (2019) A parallel FP-growth algorithm on World Ocean Atlas data with multi-core CPU. J Supercomput 75(2):732\u2013745","journal-title":"J Supercomput"},{"key":"1664_CR65","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.ins.2018.08.009","volume":"496","author":"MK Vanahalli","year":"2019","unstructured":"Vanahalli MK, Patil N (2019) An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets. Inf Sci 496:343\u2013362","journal-title":"Inf Sci"},{"issue":"1","key":"1664_CR66","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s11280-018-0566-1","volume":"22","author":"X Yu","year":"2019","unstructured":"Yu X, Li Q, Liu J (2019) Scalable and parallel sequential pattern mining using spark. World Wide Web 22(1):295\u2013324","journal-title":"World Wide Web"},{"issue":"9","key":"1664_CR67","doi-asserted-by":"crossref","first-page":"1234","DOI":"10.1631\/FITEE.1800467","volume":"20","author":"Z-j Kuang","year":"2019","unstructured":"Kuang Z-j, Zhou H, Zhou J-p, Yang K et al (2019) A non-group parallel frequent pattern mining algorithm based on conditional patterns. Frontiers of Information Technology & Electronic Engineering 20(9):1234\u20131245","journal-title":"Frontiers of Information Technology & Electronic Engineering"},{"key":"1664_CR68","doi-asserted-by":"crossref","first-page":"112967","DOI":"10.1016\/j.eswa.2019.112967","volume":"141","author":"S Sumalatha","year":"2020","unstructured":"Sumalatha S, Subramanyam R (2020) Distributed mining of high utility time interval sequential patterns using mapreduce approach. Expert Syst Appl 141:112967","journal-title":"Expert Syst Appl"},{"key":"1664_CR69","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.ins.2018.06.060","volume":"496","author":"Y Djenouri","year":"2019","unstructured":"Djenouri Y, Djenouri D, Belhadi A, Fournier-Viger P, Lin JC-W, Bendjoudi A (2019) Exploiting GPU parallelism in improving bees swarm optimization for mining big transactional databases. Inf Sci 496:326\u2013342","journal-title":"Inf Sci"},{"key":"1664_CR70","unstructured":"Djenouri Y, Djenouri D, Belhadi A, Lin JC-W, Bendjoudi A, and Fournier-Viger P (2019) A novel parallel framework for metaheuristic-based frequent itemset mining, in IEEE Congress on Evolutionary Computation, pp. 1439\u20131445"},{"issue":"3","key":"1664_CR71","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv (CSUR) 31(3):264\u2013323","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1664_CR72","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X et al. (1996) A density-based algorithm for discovering clusters in large spatial databases with noise, in International Conference on Knowledge Discovery and Data Mining, vol. 96, pp. 226\u2013231"},{"issue":"1\u20134","key":"1664_CR73","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0360-8352(91)90099-R","volume":"21","author":"H Seifoddini","year":"1991","unstructured":"Seifoddini H, Djassemi M (1991) The production data-based similarity coefficient versus jaccard\u2019s similarity coefficient. Comput Ind Eng 21(1\u20134):263\u2013266","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1664_CR74","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C-W, Tseng VS (2014) SPMF: a Java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393","journal-title":"J Mach Learn Res"},{"issue":"13","key":"1664_CR75","doi-asserted-by":"crossref","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"Z-H Deng","year":"2015","unstructured":"Deng Z-H, Lv S-L (2015) PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via children\u2013parent equivalence pruning. Expert Syst Appl 42(13):5424\u20135432","journal-title":"Expert Syst Appl"},{"key":"1664_CR76","unstructured":"Chui C-K, Kao B, and Hung E (2007) Mining frequent itemsets from uncertain data,\u201d in Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 47\u201358"},{"key":"1664_CR77","unstructured":"Lucchese C, Orlando S, Perego R, and Silvestri F (2004) WebDocs: a real-life huge transactional dataset, in Frequent Itemset Mining Implementations, vol. 126"},{"key":"1664_CR78","unstructured":"Kwak H, Lee C, Park H, and S. Moon (2010) What is Twitter, a social network or a news media? in International Conference on World Wide Web, pp. 591\u2013600"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01664-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-020-01664-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01664-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T00:15:10Z","timestamp":1616026510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-020-01664-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,18]]},"references-count":78,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1664"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01664-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,18]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}