On the Use of Genetic Programming for Mining Comprehensible Rules in Subgroup Discovery
- 5 March 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 44 (12) , 2329-2341
Abstract
This paper proposes a novel grammar-guided genetic programming algorithm for subgroup discovery. This algorithm, called comprehensible grammar-based algorithm for subgroup discovery (CGBA-SD), combines the requirements of discovering comprehensible rules with the ability to mine expressive and flexible solutions owing to the use of a context-free grammar. Each rule is represented as a derivation tree that shows a solution described using the language denoted by the grammar. The algorithm includes mechanisms to adapt the diversity of the population by self-adapting the probabilities of recombination and mutation. We compare the approach with existing evolutionary and classic subgroup discovery algorithms. CGBA-SD appears to be a very promising algorithm that discovers comprehensible subgroups and behaves better than other algorithms as measures by complexity, interest, and precision indicate. The results obtained were validated by means of a series of nonparametric tests.Keywords
Funding Information
- Ministry of Science and Technology project (TIN-2011-22408)
- FEDER funds
- Spanish Ministry of Education (AP2010-0041)
This publication has 23 references indexed in Scilit:
- Multiobjective genetic programming for maximizing ROC performanceNeurocomputing, 2014
- Design and behavior study of a grammar-guided genetic programming algorithm for mining association rulesKnowledge and Information Systems, 2011
- Evolutionary fuzzy rule extraction for subgroup discovery in a psychiatric emergency departmentSoft Computing, 2010
- GGGP-based method for modeling time series2010
- Grammar-based Genetic Programming: a surveyGenetic Programming and Evolvable Machines, 2010
- Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of powerInformation Sciences, 2010
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter OptimizationJournal of Heuristics, 2008
- Evolutionary Fuzzy Rule Induction Process for Subgroup Discovery: A Case Study in MarketingIEEE Transactions on Fuzzy Systems, 2007
- JCLEC: a Java framework for evolutionary computationSoft Computing, 2007
- APRIORI-SD: ADAPTING ASSOCIATION RULE LEARNING TO SUBGROUP DISCOVERYApplied Artificial Intelligence, 2006