Parameter-Free Algorithm for Mining Rare Association Rules
Keywords:
Genetic Programming, Association Rules, Free Parameters, Data MiningAbstract
This paper exhibits a Parameter-Free grammar guided genetic programming algorithm for mining rare association rules. This algorithm utilizes a context-free grammar to represent individuals, encoding the solutions in a tree-shape conformant to the grammar, so they are more expressive and flexible. The algorithm here introduced has the advantages of utilizing evolutionary algorithms for mining rare association rules, and it also additionally takes care of the issue of tuning the tremendous number of parameters required by these algorithms. The principle highlight of this algorithm is the small number of parameters required, providing the possibility of discovering rare association rules in an easy way for non-expert users. We compare our approach to existing evolutionary and exhaustive search algorithms, obtaining important results and overcoming the drawbacks of both exhaustive search and evolutionary algorithms. The experimental stage reveals that this approach discovers infrequent and reliable rules without a parameter tuning
References
[1] R. Agrawal and R. Srikant, “Fast algorithms for mining association rules in large databases,” in Proceedings of the 20th International Conference on Very Large Data Bases, ser. VLDB ’94. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1994, pp. 487–499.
[2] C. Romero, J. M. Luna, J. R. Romero, and S. Ventura, “Rmtool: A framework for discovering and evaluating association rules,” Advances in Engineering Software, vol. 42, no. 8, pp. 566–576,2 011.
[3] X. Yan, C. Zhang, and S. Zhang, “Armga: Identifying interesting association rules with genetic algorithms,” Applied Artificial Intelligence, vol. 1 9, no. 7, pp. 677–689,2005.
[4] R. McKay, N. Hoai, P. Whigham, Y. Shan, and M. ONeill, “Grammar-based genetic programming: a survey,” Genetic Programming and Evolvable Machines, vol. 11, pp. 365–396, 2010.
[5] J. M. Luna, J. R. Romero, and S. Ventura, “Design and behavior study of a grammar-guided genetic programming algorithm for mining association rules”, Knowledge and Information Systems, vol. 32, no. 1, pp. 53–76, 2012.
[6] J. M. Luna · J. R. Romero · S. Ventura “ On the adaptability of G3PARM to the extraction of rare association rules”, Knowledge and Information Systems, vol,38, pp 391-418, 2014.
[7] J. Han, J. Pei, Y. Yin, and R. Mao, “Mining frequent patterns without candidate generation: A frequent-pattern tree approach,” Data Mining and Knowledge Discovery, vol.8, pp. 53–87,2004.
[8] T.Scheffer, “Finding association rules that trade support optimally against confidence,” in 5th European Conference on Principles of Data Mining and Knowledge Discovery. Springer, 2001, pp. 424– 435.
[9] A. Salleb-Aouissi, C. Vrain, and C. Nortet, “Quantminer: A genetic algorithm for mining quantitative association rules,” in Proceedings of the 20th International Joint Conference on Artificial Intelligence, ser. IJCAI ’97, Hyberadad, India, 2007, pp. 1035–1040.
[10] Koh YS, Rountree N (2005) Finding sporadic rules using aprioriinverse. Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), 3518:97–106
[11] [11] Szathmary L, Napoli A,Valtchev P(2007)Towards rare itemset mining.In:Proceedings of the 19th IEEE international conference on tools with artificial intelligence, ICTAI ’07, Patras, Greece, pp 305–312.
[12] Szathmary L, Valtchev P, Napoli A (2010) Generating rare association rules using the minimal rare itemsets family. Int J Softw Inf 4(3):219–238.
[13] P. Tan and V. Kumar, “Interestingness measures for association patterns: A perspective,” in Workshop on Postprocessing in Machine Learning and Data Mining, ser. KDD ’00, New York, USA, 2000, pp. 293–313.
[14] S. Ventura, C. Romero, A. Zafra, J. A. Delgado, and C. Herv´as, “Jclec: A java framework for evolutionary computation,” Soft Computing, vol. 12, no. 4, pp. 381–392, 2008
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
