Anytime Algorithm for Feature Selection

Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally intensive, a trade-off between the quality of the selected subset and the computation time is required. In this paper, we are presenting a novel, anytime algorithm for feature selection, which gradually improves the quality of results by increasing the computation time. The algorithm is interruptible, i.e., it can be stopped at any time and provide a partial subset of selected features. The quality of results is monitored by a new measure: fuzzy information gain. The algorithm performance is evaluated on several benchmark datasets.

• Type: Conference
• Year: 2000
• Where: RSCTC
• Authors: Mark Last, Abraham Kandel, Oded Maimon, Eugene Eberbach
• Keywords: Algorithm, Computation Time, Feature Selection, Fuzzy Logic, RSCTC 2000