ACM Home Page
Please provide us with feedback. Feedback
A new version of the ant-miner algorithm discovering unordered rule sets
Full text PdfPdf (307 KB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 8th annual conference on Genetic and evolutionary computation table of contents
Seattle, Washington, USA
SESSION: Ant colony optimization and swarm intelligence: papers table of contents
Pages: 43 - 50  
Year of Publication: 2006
ISBN:1-59593-186-4
Authors
James Smaldon  University of Kent, Canterbury, UK
Alex A. Freitas  University of Kent, Canterbury, UK
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 112,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1143997.1144004
What is a DOI?

ABSTRACT

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 - unlike the rules in an ordered list, where the interpretation of a rule requires knowledge of the previous rules in the list. Hence, the proposed version facilitates the interpretation of discovered knowledge, an important point in data mining.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Dorigo, A. Colorni and V. Maniezzo, "The Ant System: optimization by a colony of cooperating agents," IEEE Transactions on Systems, Man, and Cybernetics-Part B, vol. 26, no. 1, pp. 29--41, 1996.
 
2
 
3
M. P. Oakes, "Ant Colony Optimisation for Stylometry: The Fedaralist Papers." International Conference on Recent Advances in Soft Computing, November 2004.
 
4
Ziqiang Wang, Boqin Feng, Classification Rule Mining with an Improved Ant Colony Algorithm, Lecture Notes in Computer Science, Volume 3339, Jan 2004, pp. 357--367.
 
5
R. S. Parpinelli, H. S. Lopes, and A. A. Freitas. Data mining with an ant colony optimization algorithm. IEEE Transactions on Evolutionary Computing 6(4), 2002, pp. 321--332.
 
6
 
7
I. H. Witten and E. Frank. Data Mining: practical machine learning tools and techniques. 2nd Edition. Morgan Kaufmann, 2005.
 
8
R. S. Parpinelli, H. S. Lopes and A. A. Freitas. An Ant Colony Algorithm for Classification Rule Discovery. In: H. A. Abbass, R. A. Sarker, C. S. Newton. (Eds.) Data Mining: a Heuristic Approach, pp. 191--208. London: Idea Group Publishing, 2002.
 
9

Collaborative Colleagues:
James Smaldon: colleagues
Alex A. Freitas: colleagues