Automated classification tree evolution through hybrid metaheuristics

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In present, data processing is an important process in many organizations. Classification trees are used to assign a classification to unknown data and can be also used for data partitioning (data clustering). The classification tree must be able to cope with outliers and have acceptably simple structure. An important advantage is the white-box structure. This paper presents a novel method called ACO-DTree for classification tree generation and their evolution inspired by natural processes. It uses a hybrid metaheuristics combining evolutionary strategies and ant colony optimization. Proposed method benefits from the stochastic process and population approach, which allows the algorithm to evolve more efficiently than the methods alone. The paper also consults the parameter estimation for the method. Tests on real data (UCI and MIT-BIH database) have been performed and evaluated. © 2007 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bursa, M., & Lhotska, L. (2007). Automated classification tree evolution through hybrid metaheuristics. In Advances in Soft Computing (Vol. 44, pp. 191–198). https://doi.org/10.1007/978-3-540-74972-1_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free