An Efficient Ant Colony Instance Selection Algorithm for KNN Classification

Abstract

The extraordinary progress in the computer sciences field has made Nearest Neighbor techniques, once considered impractical from a standpoint of computation (Dasarathy et al., 2003), became feasible for real-world applications. In order to build an efficient nearest neighbor classifier two principal objectives have to be reached: 1) achieve a high accuracy rate; and 2) minimize the set of instances to make the classifier scalable even with large datasets. These objectives are not independent. This work addresses the issue of minimizing the computational resource requirements of the KNN technique, while preserving high classification accuracy. This paper investigates a new Instance Selection method based on Ant Colonies Optimization principles, called Ant Instance Selection (Ant-IS) algorithm. The authors have proposed in a previous work (Miloud-Aouidate & Baba-Ali, 2012a) to use Ant Colony Optimization for preprocessing data for Instance Selection. However to the best of the authors’ knowledge, Ant Metaheuristic has not been used in the past for directly addressing Instance Selection problem. The results of the conducted experiments on several well known data sets are presented and compared to those obtained using a number of well known algorithms, and most known classification techniques. The results provide evidence that: (1) Ant-IS is competitive with the well-known kNN algorithms; (2) The condensed sets computed by Ant-IS offers also better classification accuracy then those obtained by the compared algorithms.

An Improved Ant-IS Algorithm for Intrusion Detection

“…It thus allows create this set and especially to determine the number of instances included on it. To choose instances to be included in L we selected as query function, the previously studied algorithm Ant-IS (Miloud-Aouidate and Baba-Ali, 2013), where at each invocation of the query function, all ants make a step and the best instance is selected.…”