Remainder subset awareness for feature subset selection
Document typeConference report
PublisherThomson Editores Spain
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
Feature subset selection has become more and more a common topic of research. This popularity is partly due to the growth in the number of features and application domains. The family of algorithms known as plus-l-minus-r and its immediate derivatives (like forward selection) are very popular and often the only viable alternative when used in wrapper mode. In consequence, it is of the greatest importance to take the most of every evaluation of the inducer, which is normally the more costly part. In this paper, a technique is proposed that takes into account the inducer evaluation both in the current subset and in the remainder subset (its complementary set) and is applicable to any sequential subset selection algorithm at a reasonable overhead in cost. Its feasibility is demonstrated on a series of benchmark data sets.
CitationPrat, G.; Belanche, L. Remainder subset awareness for feature subset selection. A: Taller de Mineria de Datos y Aprendizaje. "Actas del IV Taller de Minería de Datos y Aprendizaje, TAMIDA 2007". Thomson Editores Spain, 2007, p. 31-38.