A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem

被引:0
作者
Magdalene Marinaki
Yannis Marinakis
Michael Doumpos
Nikolaos Matsatsinis
Constantin Zopounidis
机构
[1] Technical University of Crete,Industrial Systems Control Laboratory, Department of Production Engineering and Management
[2] Technical University of Crete,Decision Support Systems Laboratory, Department of Production Engineering and Management
[3] Technical University of Crete,Financial Engineering Laboratory, Department of Production Engineering and Management
来源
Optimization Letters | 2008年 / 2卷
关键词
Feature selection problem; Nearest neighbor classification method; Tabu Search;
D O I
暂无
中图分类号
学科分类号
摘要
The feature selection problem is an interesting and important topic which is relevant for a variety of database applications. This paper utilizes the Tabu Search metaheuristic algorithm to implement a feature subset selection procedure while the nearest neighbor classification method is used for the classification task. Tabu Search is a general metaheuristic procedure that is used in order to guide the search to obtain good solutions in complex solution spaces. Several metrics are used in the nearest neighbor classification method, such as the euclidean distance, the Standardized Euclidean distance, the Mahalanobis distance, the City block metric, the Cosine distance and the Correlation distance, in order to identify the most significant metric for the nearest neighbor classifier. The performance of the proposed algorithms is tested using various benchmark datasets from UCI Machine Learning Repository.
引用
收藏
页码:299 / 308
页数:9
相关论文
共 20 条
[1]  
Glover F.(1989)Tabu Search I ORSA J. Computing. 1 190-206
[2]  
Glover F.(1990)Tabu Search II ORSA J. Computing. 2 4-32
[3]  
Jain A.(1997)Feature selection: evaluation, application, and small sample performance IEEE Trans. Patt. Anal. Mach. Intell. 19 153-158
[4]  
Zongker D.(1997)Wrappers for feature subset selection Artif. Intell. 97 273-324
[5]  
Kohavi R.(2006)Solving feature subset selection problem by a parallel scatter search. Euro. J. Oper. Res. 169 477-489
[6]  
John G.(1977)A branch and bound algorithm for feature subset selection IEEE Trans. Comput. 26 917-922
[7]  
Lopez F.G.(1994)Floating search methods in feature selection Patt. Recognit. Lett. 15 1119-1125
[8]  
Torres M.G.(1988)On automatic feature selection Int. J. Patt. Recognit. Artif. Intell. 2 197-220
[9]  
Batista B.M.(1989)A note on genetic algorithms for large-scale feature selection Patt. Recognit. Lett. 10 335-347
[10]  
Perez J.A.M.(undefined)undefined undefined undefined undefined-undefined