A comparison of several nearest neighbor classifier metrics using tabu search algorithm for the feature selection problem

DOI10.1007/s11590-007-0057-2zbMath1159.90476OpenAlexW2071414404MaRDI QIDQ941020

Magdalene Marinaki, Michael Doumpos, Yannis Marinakis, Constantin Zopounidis, Nikolaos F. Matsatsinis

Publication date: 4 September 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-007-0057-2

zbMATH Keywords

tabu searchfeature selection problemnearest neighbor classification method

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

The block diagram method for designing the particle swarm optimization algorithm

Uses Software

• Tabu search
• ElemStatLearn

Cites Work

• Wrappers for feature subset selection
• Solving feature subset selection problem by a parallel scatter search
• Tabu Search—Part I
• Tabu Search—Part II
• A Branch and Bound Algorithm for Feature Subset Selection
• A note on genetic algorithms for large-scale feature selection
• An Introduction to Tabu Search
• The elements of statistical learning. Data mining, inference, and prediction
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of several nearest neighbor classifier metrics using tabu search algorithm for the feature selection problem