Classification rule discovery with ant colony optimization algorithm

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

Abstract

Ant Colony Algorithms has been successfully applied to solve combinatorial optimization problems. Subsequently applications on Data Mining (DM) appeared, more specifically aiming to solve classification problems. The Ant-Miner [3] algorithm is a good example of a solution to this problem. This algorithm is better than C4.5 [7] and CN2 [8]. This paper presents a new algorithm which applies an innovative modeling of the foraging behavior of ants [4] to the Ant-Miner. As a result of this adaptation, four different versions of the Ant-Miner algorithm were generated, tested and compared to the original version using seven public domain data sets. One of the versions produced comparatively superior results in terms of predictive accuracy in different system configurations. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Hodnefjell, S., & Costa, I. (2012). Classification rule discovery with ant colony optimization algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7435 LNCS, pp. 678–687). Springer Verlag. https://doi.org/10.1007/978-3-642-32639-4_81

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