Abstract
This paper presents an evolutionary algorithm using G3P (Grammar Guided Genetic Programming) for mining association rules in different real-world databases. This algorithm, called G3PARM, uses an auxiliary population made up of its best individuals that will then act as parents for the next generation. The individuals are defined through a context-free grammar and it allows us to obtain datatype-generic and valid individuals. We compare our approach to Apriori and FP-Growth algorithms and demonstrate that our proposal obtains rules with better support, confidence and coverage of the dataset instances. Finally, a preliminary study is also introduced to compare the scalability of our algorithm. Our experimental studies illustrate that this approach is highly promising for discovering association rules in databases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994, Proceedings of 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile, September 1994, pp. 487–499 (1994)
Borgelt, C.: Efficient implementations of Apriori and Eclat. In: FIMI 2003, 1st Workshop on Frequent Itemset Mining Implementations, Melbourne, Florida, USA (December 2003)
Coenen, F., Goulbourne, G., Leng, P.: Tree structures for mining association rules. Data Mining and Knowledge Discovery 8(1), 25–51 (2003)
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, New York (2003)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 1–12 (2000)
Papè, N.F., Alcalá-Fdez, J., Bonarini, A., Herrera, F.: Evolutionary extraction of association rules: A preliminary study on their effectiveness. In: Corchado, E., Wu, X., Oja, E., Herrero, Á., Baruque, B. (eds.) HAIS 2009. LNCS, vol. 5572, pp. 646–653. Springer, Heidelberg (2009)
Tsymbal, A., Pechenizkiy, M., Cunningham, P.: Sequential genetic search for ensemble feature selection. In: Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), Edinburgh, Scotland, August 2005, pp. 877–882 (2005)
Wei, Z., Hongzhi, L., Na, Z.: Research on the fp growth algorithm about association rule mining. In: ICFCC 2009, International Conference on Future Computer and Communication, Kuala Lumpur, Malaysia, April 2009, pp. 572–576 (2009)
Yang, G., Shimada, K., Mabu, S., Hirasawa, K.: A nonlinear model to rank association rules based on semantic similarity and genetic network programming, vol. 4, pp. 248–256. Institute of Electrical Engineers of Japan (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luna, J.M., Romero, J.R., Ventura, S. (2010). Analysis of the Effectiveness of G3PARM Algorithm. In: Corchado, E., Graña Romay, M., Manhaes Savio, A. (eds) Hybrid Artificial Intelligence Systems. HAIS 2010. Lecture Notes in Computer Science(), vol 6077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13803-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-13803-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13802-7
Online ISBN: 978-3-642-13803-4
eBook Packages: Computer ScienceComputer Science (R0)