Optimizing Data Transformations for Classification Tasks

Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (GED). In this paper, data transformations are optimized instead. This is equivalent to searching for GEDs, but can be applied to any learning algorithm, even if it does not use distances explicitly. Two optimization techniques have been used: a simple Local Search (LS) and the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). CMA-ES is an advanced evolutionary method for optimization in difficult continuous domains. Both diagonal and complete matrices have been considered. Results show that in general, complete matrices found by CMA-ES either outperform or match both Local Search, and the classifier working on the original untransformed data. Key words: Data transformations, General Euclidean Distances, Evolutionary Computation, Evolutionary-based Machine Learning

• Type: Journal
• Year: 2009
• Where: IDEAL
• Authors: José María Valls, Ricardo Aler
• Keywords: Complete Matrices, Data Transformations, General Euclidean, IDEAL 2009, Intelligent Agents