Oscillating search algorithms for feature selection

Abstract

A new sub-optimal subset search method for feature selection is introduced. As opposed to other subset selection methods the oscillating search is not dependent on pre-specified direction of search (forward or backward). The generality of the oscillating search concept allowed us to define several different algorithms suitable for different purposes. We can specify the need to obtain good results in very short time, or let the algorithm search more thoroughly to obtain near-optimum results. In many cases the oscillating search out-performed all the other tested methods. The oscillating search may be restricted by a preset time-limit, this makes it usable in real-time systems.