.png){kind=icon}
Return
Using evolutionary algorithms as instance selection for data reduction in KDD: An experimental study
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2003.819265.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Evolutionary algorithms are adaptive, methods based on natural evolution that may be used for search and optimization. As data reduction in knowledge discovery in databases (KDDs) can be viewed as a search problem, it could be solved using evolutionary algorithms (EAs). In this paper, we have carried out an empirical study of the performance of four representative EA models in which we have taken into account two different instance selection perspectives, the prototype selection and the training set selection for data reduction in KDD. This paper includes a comparison between these algorithms and other nonevolutionary instance selection algorithms. The results show that the evolutionary instance selection algorithms consistently outperform the nonevolutionary ones, the main advantages being: better instance reduction rates, higher classification accuracy, and models that are easier to interpret.
Keywords:
data mining (DM)
data reduction
evolutionary algorithms (EAs)
instance selection
knowledge discovery
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSave
View more