1. Multiclass Feature Selection With Kernel Gram-Matrix-Based Criteria
- Author
-
Mathieu Ramona, Gael Richard, Bertrand David, Signal, Statistique et Apprentissage (S2A), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Traitement du Signal et des Images (TSI), Centre National de la Recherche Scientifique (CNRS)-Télécom ParisTech, and HAL, TelecomParis
- Subjects
Graph kernel ,Support Vector Machine ,[INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing ,Computer Networks and Communications ,SVM ,0211 other engineering and technologies ,Feature selection ,02 engineering and technology ,Machine learning ,computer.software_genre ,Pattern Recognition, Automated ,[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing ,Artificial Intelligence ,String kernel ,Polynomial kernel ,0202 electrical engineering, electronic engineering, information engineering ,Mathematics ,021103 operations research ,business.industry ,Numerical Analysis, Computer-Assisted ,Computer Science Applications ,Kernel method ,Kernel embedding of distributions ,Radial basis function kernel ,020201 artificial intelligence & image processing ,Neural Networks, Computer ,Artificial intelligence ,Data mining ,Tree kernel ,business ,computer ,Algorithms ,Software - Abstract
International audience; Feature selection has been an important issue in recent decades to determine the most relevant features according to a given classification problem. Numerous methods have emerged that take into account support vector machines (SVMs) in the selection process. Such approaches are powerful but often complex and costly. In this paper, we propose new feature selection methods based on two criteria designed for the optimization of SVM: kernel target alignment and kernel class separability. We demonstrate how these two measures, when fully expressed, can build efficient and simple methods, easily applicable to multiclass problems and iteratively computable with minimal memory requirements. An extensive experimental study is conducted both on artificial and real-world datasets to compare the proposed methods to state-of-the-art feature selection algorithms. The results demonstrate the relevance of the proposed methods both in terms of performance and computational cost.
- Published
- 2012