Mining for Complex Models Comprising Feature Selection and Classification

Abstract

AbstractDifferent classification tasks require different learning schemes to be satisfactorily solved. Most real-world datasets can be modeled only by complex structures resulting from deep data exploration with a number of different classification and data transformation methods. The search through the space of complex structures must be augmented with reliable validation strategies. All these techniques were necessary to build accurate models for the five high-dimensional datasets of the NIPS 2003 Feature Selection Challenge. Several feature selection algorithms (e.g. based on variance, correlation coefficient, decision trees) and several classification schemes (e.g. nearest neighbors, Normalized RBF, Support Vector Machines) were used to build complex models which transform the data and then classify. Committees of feature selection models and ensemble classifiers were also very helpful to construct models of high generalization abilities.KeywordsSupport Vector MachineFeature SelectionLinear KernelFeature Selection AlgorithmFeature RankingThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.