Parpinelli, Rafael S., Lopes, Heitor S., Freitas, Alex A. (2002) Data Mining with an Ant Colony Optimization Algorithm. IEEE Transactions on Evolutionary Computation, 6 (4). pp. 321-332. ISSN 1089-778X. (doi:10.1109/TEVC.2002.802452) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13753)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1109/TEVC.2002.802452 |
Abstract
The paper proposes an algorithm for data mining called Ant-Miner (ant-colony-based data miner). The goal of Ant-Miner is to extract classification rules from data. The algorithm is inspired by both research on the behavior of real ant colonies and some data mining concepts as well as principles. We compare the performance of Ant-Miner with CN2, a well-known data mining algorithm for classification, in six public domain data sets. The results provide evidence that: 1) Ant-Miner is competitive with CN2 with respect to predictive accuracy, and 2) the rule lists discovered by Ant-Miner are considerably simpler (smaller) than those discovered by CN2
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1109/TEVC.2002.802452 |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 24 Nov 2008 17:59 UTC |
Last Modified: | 05 Nov 2024 09:47 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/13753 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):