The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Building Block Approach to Genetic Programming for Rule Discovery
|
|
Author(s): Andries P. Engelbrecht (University of Pretoria, South Africa), L. Schoeman (University of Pretoria, South Africa)and Sonja Rouwhorst (Vrije Universiteit Amsterdam, The Netherlands)
Copyright: 2002
Pages: 17
Source title:
Data Mining: A Heuristic Approach
Source Author(s)/Editor(s): Hussein A. Abbass (University of New South Wales, Australia), Ruhul Sarker (University of New South Wales, Australia)and Charles S. Newton (University of New South Wales, Australia)
DOI: 10.4018/978-1-930708-25-9.ch009
Purchase
|
Abstract
Genetic programming has recently been used successfully to extract knowledge in the form of IF-THEN rules. For these genetic programming approaches to knowledge extraction from data, individuals represent decision trees. The main objective of the evolutionary process is therefore to evolve the best decision tree, or classifier, to describe the data. Rules are then extracted, after convergence, from the best individual. The current genetic programming approaches to evolve decision trees are computationally complex, since individuals are initialized to complete decision trees. This chapter discusses a new approach to genetic programming for rule extraction, namely the building block approach. This approach starts with individuals consisting of only one building block, and adds new building blocks during the evolutionary process when the simplicity of the individuals cannot account for the complexity in the underlying data. Experimental results are presented and compared with that of C4.5 and CN2. The chapter shows that the building block approach achieves very good accuracies compared to that of C4.5 and CN2. It is also shown that the building block approach extracts substantially less rules.
Related Content
|
.
© 2023.
34 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
18 pages.
|
|
.
© 2023.
24 pages.
|
|
.
© 2023.
32 pages.
|
|
.
© 2023.
21 pages.
|
|
|