In this paper we address the problem of multi-objective attribute selection in data mining. We propose a multi-objective genetic algorithm (GA) based on the wrapper approach to discover the best subset of attributes for a given classification algorithm, namely C4.5, a well-known decision-tree algorithm. The two objectives to be minimized are the error rate and the size of the tree produced by C4.5. The proposed GA is a multi-objective method in the sense that it discovers a set of non-dominated solutions (attribute subsets), according to the concept of Pareto dominance. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Pappa, G. L., Freitas, A. A., & Kaestner, C. A. A. (2002). Attribute selection with a multi-objective genetic algorithm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2507, 280–290. https://doi.org/10.1007/3-540-36127-8_27
Mendeley helps you to discover research relevant for your work.