{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:37:31Z","timestamp":1764175051919,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T00:00:00Z","timestamp":1627948800000},"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":["Cluster Comput"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10586-021-03369-2","type":"journal-article","created":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T17:02:40Z","timestamp":1628010160000},"page":"3767-3778","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Exploiting parallel graphics processing units to improve association rule mining in transactional databases using butterfly optimization algorithm"],"prefix":"10.1007","volume":"24","author":[{"given":"Ali Abbas","family":"Zoraghchian","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8066-0356","authenticated-orcid":false,"given":"Mohammad Karim","family":"Sohrabi","sequence":"additional","affiliation":[]},{"given":"Farzin","family":"Yaghmaee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"key":"3369_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A. (1993) Mining association rules between sets of items in big databases. In\u00a0Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (pp. 207\u2013216).","DOI":"10.1145\/170036.170072"},{"key":"3369_CR2","unstructured":"Agrawal, R., Srikant, R. (1994). Fast algorithms for mining association rules. In\u00a0Proc. 20th Int. Conf. very big data bases, VLDB, 1215, 487-499"},{"key":"3369_CR3","unstructured":"Houtsma, M., Swami, A. (1995) Set-oriented mining for association rules in relational databases. In\u00a0Proceedings of the eleventh international conference on data engineering\u00a0(pp. 25\u201333). IEEE."},{"issue":"1","key":"3369_CR4","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.eswa.2010.06.060","volume":"38","author":"HR Qodmanan","year":"2011","unstructured":"Qodmanan, H.R., Nasiri, M., Minaei-Bidgoli, B.: Multi objective association rule mining with genetic algorithm without specifying minimum support and minimum confidence. Expert Syst. Appl. 38(1), 288\u2013298 (2011)","journal-title":"Expert Syst. Appl."},{"key":"3369_CR5","doi-asserted-by":"crossref","unstructured":"Park, J., Chen, M. S., Yu, P. S. (1995). An effective hash based algorithm for mining association rules. In: SIGMOD\u201995, p.175\u2013186.","DOI":"10.1145\/568271.223813"},{"key":"3369_CR6","unstructured":"Toivonen, H. (1996). Sampling large databases for association rules. In: Proceeding of the 1996 International Conference on very Large Data Bases (VLDB\u201996), p.134\u2013145."},{"key":"3369_CR7","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), p.1\u201312.","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"3369_CR8","doi-asserted-by":"publisher","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.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Disc. 8(1), 53\u201387 (2004)","journal-title":"Data Min. Knowl. Disc."},{"issue":"10","key":"3369_CR9","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"H Deng","year":"2014","unstructured":"Deng, H., Lv, S.L.: Fast mining frequent itemsets using Nodesets. Expert Syst. Appl. 41(10), 4505\u20134512 (2014)","journal-title":"Expert Syst. Appl."},{"issue":"9","key":"3369_CR10","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"ZH Deng","year":"2012","unstructured":"Deng, Z.H., Wang, Z.H., Jiang, J.J.: A new algorithm for fast mining frequent itemsets using n-lists. Sci. China Inf. Sci. 55(9), 2008\u20132030 (2012)","journal-title":"Sci. China Inf. Sci."},{"issue":"13","key":"3369_CR11","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"H Deng","year":"2015","unstructured":"Deng, H., Lv, S.L.: PrePost+: an efficient N-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Syst. Appl. 42(13), 5424\u20135432 (2015)","journal-title":"Expert Syst. Appl."},{"key":"3369_CR12","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"ZH Deng","year":"2016","unstructured":"Deng, Z.H.: DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl. Soft Comput. 41, 214\u2013223 (2016)","journal-title":"Appl. Soft Comput."},{"key":"3369_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.: Combining apriori heuristic and bio-inspired algorithms for solving the frequent itemsets mining problem. Inf. Sci. 420, 1\u201315 (2017)","journal-title":"Inf. Sci."},{"issue":"1","key":"3369_CR14","first-page":"141","volume":"5","author":"M Agrawal","year":"2015","unstructured":"Agrawal, M., Mishra, M., Kushwah, S.P.S.: Association rules optimization using particle swarm optimization algorithm with mutation. Int. J. Soft Comput. Eng. (IJSCE) 5(1), 141\u2013144 (2015)","journal-title":"Int. J. Soft Comput. Eng. (IJSCE)"},{"key":"3369_CR15","doi-asserted-by":"publisher","first-page":"4775","DOI":"10.1007\/s10489-018-1245-8","volume":"48","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Djenouri, D., Belhadi, A., Fournier-Viger, P., Lin, J.C.-W.: A new framework for metaheuristic-based frequent itemset mining. Appl. Intell. 48, 4775\u20134791 (2018)","journal-title":"Appl. Intell."},{"key":"3369_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10115-014-0795-2","volume":"45","author":"J Agrawal","year":"2015","unstructured":"Agrawal, J., Agrawal, S., Singhai, A., Sharma, S.: (2015) SET-PSO-based approach for mining positive and negative association rules. Knowl. Inf. Syst. 45, 453\u2013471 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"3369_CR17","doi-asserted-by":"publisher","first-page":"2969","DOI":"10.1007\/s10586-020-03062-w","volume":"23","author":"A Yadav","year":"2020","unstructured":"Yadav, A., Vishwakarma, D.K.: A comparative study on bio-inspired algorithms for sentiment analysis. Cluster Comput. 23, 2969\u20132989 (2020)","journal-title":"Cluster Comput."},{"key":"3369_CR18","doi-asserted-by":"publisher","first-page":"2009","DOI":"10.1007\/s10586-019-02980-8","volume":"23","author":"T Wang","year":"2020","unstructured":"Wang, T., Manogaran, G., Wang, M.: Framework for social tag recommendation using lion optimization algorithm and collaborative filtering techniques. Cluster Comput. 23, 2009\u20132019 (2020)","journal-title":"Cluster Comput."},{"key":"3369_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-021-03254-y","author":"L Abualigah","year":"2021","unstructured":"Abualigah, L., Dulaimi, A.J.: A novel feature selection method for data mining tasks using hybrid Sine Cosine algorithm and genetic algorithm. Cluster Comput. (2021). https:\/\/doi.org\/10.1007\/s10586-021-03254-y","journal-title":"Cluster Comput."},{"issue":"3","key":"3369_CR20","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s00500-018-3102-4","volume":"23","author":"A Sankalap","year":"2019","unstructured":"Sankalap, A., Singh, S.: Butterfly optimization algorithm: a novel approach for global optimization. Soft. Comput. 23(3), 715\u2013734 (2019)","journal-title":"Soft. Comput."},{"issue":"6","key":"3369_CR21","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.: Parallel mining of association rules. IEEE Trans. Knowl. Data Eng. 8(6), 962\u2013969 (1996)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3369_CR22","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.amc.2017.09.026","volume":"350","author":"G Agapito","year":"2019","unstructured":"Agapito, G., Guzzi, P.H., Cannataro, M.: Parallel mining of association rules from genomics data. Appl. Math. Comput. 350, 434\u2013446 (2019)","journal-title":"Appl. Math. Comput."},{"key":"3369_CR23","doi-asserted-by":"crossref","unstructured":"Chen, M., Gao, X. Li, H. (2009) An efficient parallel FP-Growth algorithm. In\u00a02009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\u00a0(pp. 283\u2013286). IEEE.","DOI":"10.1109\/CYBERC.2009.5342148"},{"issue":"1","key":"3369_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1080\/02533839.2018.1454853","volume":"41","author":"MK Sohrabi","year":"2018","unstructured":"Sohrabi, M.K., Taheri, N.: A haoop-based parallel mining of frequent itemsets using N-Lists. J. Chin. Inst. Eng. 41(1), 229\u2013238 (2018)","journal-title":"J. Chin. Inst. Eng."},{"issue":"6","key":"3369_CR25","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1080\/17517575.2017.1405286","volume":"12","author":"MK Sohrabi","year":"2018","unstructured":"Sohrabi, M.K.: A gossip-based information fusion protocol for distributed frequent itemset mining. Enterp. Inf. Syst. 12(6), 674\u2013694 (2018)","journal-title":"Enterp. Inf. Syst."},{"key":"3369_CR26","doi-asserted-by":"publisher","first-page":"2851","DOI":"10.1007\/s10586-017-1609-6","volume":"22","author":"CH Huang","year":"2019","unstructured":"Huang, C.H., Leu, Y.: Multi-level dataset decomposition for parallel frequent itemset mining on a cluster of personal computers. Cluster Comput. 22, 2851\u20132863 (2019)","journal-title":"Cluster Comput."},{"key":"3369_CR27","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s10586-017-1249-x","volume":"21","author":"S Saleti","year":"2018","unstructured":"Saleti, S., Subramanyam, R.B.V.: A novel bit vector product algorithm for mining frequent itemsets from large datasets using MapReduce framework. Cluster Comput. 21, 1365\u20131380 (2018)","journal-title":"Cluster Comput."},{"key":"3369_CR28","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1007\/s10586-018-1812-0","volume":"21","author":"KW Chon","year":"2018","unstructured":"Chon, K.W., Kim, M.S.: BIGMiner: a fast and scalable distributed frequent pattern miner for big data. Cluster Comput. 21, 1507\u20131520 (2018)","journal-title":"Cluster Comput."},{"key":"3369_CR29","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1109\/CLUSTER.2011.61","volume":"2011","author":"F Zhang","year":"2011","unstructured":"Zhang, F., Zhang, Y., Bakos, J.: \u201cGPApriori: GPU-accelerated frequent itemset mining.\u201d IEEE Int. Conf. Cluster Comput. 2011, 590\u2013594 (2011). https:\/\/doi.org\/10.1109\/CLUSTER.2011.61","journal-title":"IEEE Int. Conf. Cluster Comput."},{"key":"3369_CR30","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ins.2018.01.046","volume":"439\u2013440","author":"K-W Chon","year":"2018","unstructured":"Chon, K.-W., Hwang, S.-H., Kim, M.-S.: GMiner: a fast GPU-based frequent itemset mining method for large-scale data. Inf. Sci. 439\u2013440, 19\u201338 (2018)","journal-title":"Inf. Sci."},{"key":"3369_CR31","doi-asserted-by":"publisher","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.: Exploiting GPU and cluster parallelism in single scan frequent itemset mining. Inf. Sci. 496, 363\u2013377 (2019)","journal-title":"Inf. Sci."},{"key":"3369_CR32","doi-asserted-by":"publisher","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., Cano, A., Fournier-Viger, P., Lin, J.C.-W., Bendjoudi, A.: Exploiting GPU parallelism in improving bees swarm optimization for mining big transactional databases. Inf. Sci. 496, 326\u2013342 (2019)","journal-title":"Inf. Sci."},{"key":"3369_CR33","doi-asserted-by":"publisher","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-Taboujemat, N., Habbas, Z.: GPU-based bees swarm optimization for association rules mining. J Supercomput 71, 1318\u20131344 (2015)","journal-title":"J Supercomput"},{"key":"3369_CR34","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ins.2018.05.031","volume":"459","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Belhadi, A., Fournier-Viger, P., Fujita, H.: Mining diversified association rules in big datasets: a cluster\/GPU\/genetic approach. Inf. Sci. 459, 117\u2013134 (2018)","journal-title":"Inf. Sci."},{"issue":"2","key":"3369_CR35","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10619-018-7218-4","volume":"36","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Djenouri, D., Habbas, Z., Belhadi, A.: How to exploit high performance computing in population-based metaheuristics for solving association rule mining problem. Distrib. Parallel Databases 36(2), 369\u2013397 (2018)","journal-title":"Distrib. Parallel Databases"},{"issue":"8","key":"3369_CR36","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1016\/j.engappai.2013.06.003","volume":"26","author":"KNVD Sarath","year":"2013","unstructured":"Sarath, K.N.V.D., Ravi, V.: Association rule mining using binary particle swarm optimization. Eng. Appl. Artif. Intell. 26(8), 1832\u20131840 (2013)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"8","key":"3369_CR37","doi-asserted-by":"publisher","first-page":"7411","DOI":"10.1016\/j.eswa.2012.01.065","volume":"39","author":"KY Fung","year":"2012","unstructured":"Fung, K.Y., Kwong, C.K., Siu, K.W., Yu, K.M.: A multi-objective genetic algorithm approach to rule mining for affective product design. Expert Syst. Appl. 39(8), 7411\u20137419 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"3369_CR38","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1007\/s10489-016-0806-y","volume":"45","author":"KE Heraguemi","year":"2016","unstructured":"Heraguemi, K.E., Kamel, N., Drias, H.: Multi-swarm bat algorithm for association rule mining using multiple cooperative strategies. Appl. Intell. 45(4), 1021\u20131033 (2016)","journal-title":"Appl. Intell."},{"key":"3369_CR39","doi-asserted-by":"publisher","unstructured":"Agarwal, A., Nanavati, N.: Association rule mining using hybrid GA-PSO for multi-objective optimisation. In 2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC). IEEE, pp. 1\u20137 (2016). https:\/\/doi.org\/10.1109\/ICCIC.2016.7919571","DOI":"10.1109\/ICCIC.2016.7919571"},{"issue":"4","key":"3369_CR40","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1504\/IJBIC.2014.064990","volume":"6","author":"Y Djenouri","year":"2014","unstructured":"Djenouri, Y., Drias, H., Habbas, Z.: Bees swarm optimisation using multiple strategies for association rule mining. Int. J. Bio-Inspired Comput. 6(4), 239\u2013249 (2014)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"3369_CR41","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.ins.2020.02.073","volume":"524","author":"A Telikani","year":"2020","unstructured":"Telikani, A., Gandomi, A.H., Shahbahrami, A.: A survey of evolutionary computation for association rule mining. Inf. Sci. 524, 318\u2013352 (2020)","journal-title":"Inf. Sci."},{"key":"3369_CR42","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.asoc.2018.01.031","volume":"65","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Djenouri, D., Habbas, Z.: Intelligent mapping between GPU and cluster computing for discovering big association rules. Appl. Soft Comput. 65, 387\u2013399 (2018)","journal-title":"Appl. Soft Comput."},{"key":"3369_CR43","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s11227-013-0887-x","volume":"66","author":"F Zhang","year":"2013","unstructured":"Zhang, F., Zhang, Y., Bakos, J.D.: Accelerating frequent itemset mining on graphics processing units. J Supercomput 66, 94\u2013117 (2013)","journal-title":"J Supercomput"},{"key":"3369_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01952-5","author":"K Jurczuk","year":"2021","unstructured":"Jurczuk, K., Czajkowski, M., Kretowski, M.: Multi-GPU approach to global induction of classification trees for large-scale data mining. Appl. Intell. (2021). https:\/\/doi.org\/10.1007\/s10489-020-01952-5","journal-title":"Appl. Intell."},{"key":"3369_CR45","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.eswa.2017.10.025","volume":"93","author":"W Andrzejewski","year":"2018","unstructured":"Andrzejewski, W., Boinski, P.: Efficient spatial co-location pattern mining on multiple GPUs. Expert Syst. Appl. 93, 465\u2013483 (2018)","journal-title":"Expert Syst. Appl."},{"key":"3369_CR46","unstructured":"https:\/\/archive.ics.uci.edu\/ml\/datasets.php,. Accessed July 2020"},{"key":"3369_CR47","unstructured":"http:\/\/fimi.uantwerpen.be\/data. Accessed July 2020"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-021-03369-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-021-03369-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-021-03369-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:25:45Z","timestamp":1699305945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-021-03369-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,3]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["3369"],"URL":"https:\/\/doi.org\/10.1007\/s10586-021-03369-2","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2021,8,3]]},"assertion":[{"value":"11 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}