Journal
KNOWLEDGE AND INFORMATION SYSTEMS
Volume 32, Issue 1, Pages 53-76Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s10115-011-0419-z
Keywords
Association rules; Genetic programming; Grammar-guided genetic programming; Evolutionary algorithms
Funding
- Regional Government of Andalusia [P08-TIC-3720]
- Ministry of Science and Technology [TIN2008-06681-C06-03]
- FEDER funds
Ask authors/readers for more resources
This paper presents a proposal for the extraction of association rules called G3PARM (Grammar-Guided Genetic Programming for Association Rule Mining) that makes the knowledge extracted more expressive and flexible. This algorithm allows a context-free grammar to be adapted and applied to each specific problem or domain and eliminates the problems raised by discretization. This proposal keeps the best individuals (those that exceed a certain threshold of support and confidence) obtained with the passing of generations in an auxiliary population of fixed size n. G3PARM obtains solutions within specified time limits and does not require the large amounts of memory that the exhaustive search algorithms in the field of association rules do. Our approach is compared to exhaustive search (Apriori and FP-Growth) and genetic (QuantMiner and ARMGA) algorithms for mining association rules and performs an analysis of the mined rules. Finally, a series of experiments serve to contrast the scalability of our algorithm. The proposal obtains a small set of rules with high support and confidence, over 90 and 99% respectively. Moreover, the resulting set of rules closely satisfies all the dataset instances. These results illustrate that our proposal is highly promising for the discovery of association rules in different types of datasets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available