Sciweavers

Share
GECCO
2006
Springer

A new version of the ant-miner algorithm discovering unordered rule sets

10 years 2 months ago
A new version of the ant-miner algorithm discovering unordered rule sets
The Ant-Miner algorithm, first proposed by Parpinelli and colleagues, applies an ant colony optimization heuristic to the classification task of data mining to discover an ordered list of classification rules. In this paper we present a new version of the Ant-Miner algorithm, which we call Unordered Rule Set Ant-Miner, that produces an unordered set of classification rules. The proposed version was evaluated against the original Ant-Miner algorithm in six public-domain datasets and was found to produce comparable results in terms of predictive accuracy. However, the proposed version has the advantage of discovering more modular rules, i.e., rules that can be interpreted independently from other rules
James Smaldon, Alex Alves Freitas
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2006
Where GECCO
Authors James Smaldon, Alex Alves Freitas
Comments (0)
books