Convex approximation of the NP-hard search problem in feature subset selection.

Tofigh Naghibi Sarah Hoffmann Beat Pfister

Published in: ICASSP (2013)

Keyphrases

feature subset selection
np hard
approximation algorithms
search algorithm
approximation ratio
feature selection
search space
selection algorithm
lower bound
special case
feature subset
computational complexity
classification accuracy
estimation of distribution algorithms
polynomial time approximation