Feature Selection Using Tabu Search with Learning Memory: Learning Tabu Search
نویسندگان
چکیده
Feature selection in classification can be modeled as a combinatorial optimization problem. One of the main particularities of this problem is the large amount of time that may be needed to evaluate the quality of a subset of features. In this paper, we propose to solve this problem with a tabu search algorithm integrating a learning mechanism. To do so, we adapt to the feature selection problem, a learning tabu search algorithm originally designed for a railway network problem in which the evaluation of a solution is time-consuming. Experiments are conducted and show the benefit of using a learning mechanism to solve hard instances of the literature.
منابع مشابه
Comparison of particle swarm optimization and tabu search algorithms for portfolio selection problem
Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...
متن کاملCreating diverse nearest-neighbour ensembles using simultaneous metaheuristic feature selection
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good results with this technique is the choice of distance function, and correspondingly which features to consider when computing distances between samples. In recent years there has been an increasing interest in creating ens...
متن کاملA Novel Discrete Artificial Bee Colony Algorithm for Rough Set-based Feature Selection
Feature selection plays an important role in the fields of pattern recognition, data mining and machine learning. Rough set method is one of effective methods for feature selection, which can preserve the meaning of the features. Presently ant colony optimization (ACO) has been successfully applied to rough set-based feature selection, however, it has the limitations of many control parameters,...
متن کاملHybrid extreme point tabu search
We develop a new hybrid tabu search method for optimizing a continuous diieren-tiable function over the extreme points of a polyhedron. The method combines extreme point tabu search with traditional descent algorithms based on linear programming. The tabu search algorithm utilizes both recency-based and frequency-based memory and oscillates between local improvement and diversiication phases. T...
متن کامل