MulO-AntMiner: A new ant colony algorithm for the multi-objective classification problem

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

Abstract

This paper presents a new ant-based algorithm for the multi-objective classification problem. The new algorithm called MulO-AntMiner (Multi-Objective Ant-Miner) is an improved version of the Ant-Miner algorithm, the first implementation of the ant colony algorithm for discovering classification rules. The fundamental principles in the proposed algorithm are almost similar to those in original Ant-Miner; even though, in our work there are two or more class attributes to be predicted. As a result, the consequent of a classification rule contains multiple predictions, each prediction involving a different class attribute. We have compared the performance of MulO-AntMiner with two other algorithms namely the C4.5 algorithm and the original Ant-Miner. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Said, N., Hammami, M., & Ghedira, K. (2011). MulO-AntMiner: A new ant colony algorithm for the multi-objective classification problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6783 LNCS, pp. 594–609). https://doi.org/10.1007/978-3-642-21887-3_45

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