In this paper, we would like to propose a new method for constructing decision trees based on Ant Colony Optimization (ACO). The ACO is a metaheuristic inspired by the behavior of real ants, where they search for optimal solutions by considering both local heuristic and previous knowledge, observed by pheromone changes, Good results of the ant colony algorithms for solving combinatorial optimization problems suggest an appropriate effectiveness of the approach also in the task of constructing decision trees. In order to improve the accuracy of decision trees we propose an Ant Colony algorithm for constructing Decision Trees (ACDT). A heuristic function used in a new algorithm is based on the splitting rule of the CART algorithm (Classification and Regression Trees). The proposed algorithm is evaluated on a number of well-known benchmark data sets from the UCI Machine Learning repository. What deserves particular attention is the fact that empirical results clearly show that ACDT performs very good while comparing to other techniques.
展开▼
