RT Journal Article
T1 Evolving linear transformations with a rotation-angles/scaling representation
A1 Echeverría, Alejandro
A1 Valls, José M.
A1 Aler, Ricardo
AB Similarity between patterns is commonly used in many distance-based classification algorithms like KNN or RBF. Generalized Euclidean Distances (GED) can be optimized in order to improve the classification success rate in distance-based algorithms. This idea can be extended to any classification algorithm, because it can be shown that a GEDs is equivalent to a linear transformations of the dataset. In this paper, the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is applied to the optimization of linear transformations represented as matrices. The method has been tested on several domains and results show that the classification success rate can be improved for some of them. However, in some domains, diagonal matrices get higher accuracies than full square ones. In order to solve this problem, we propose in the second part of the paper to represent linear transformations by means of rotation angles and scaling factors, based on the Singular Value Decomposition theorem (SVD). This new representation solves the problems found in the former part.
PB Elsevier
SN 0957-4174
YR 2012
FD 2012-02-15
LK https://hdl.handle.net/10016/15314
UL https://hdl.handle.net/10016/15314
LA eng
NO This article has been financed by the Spanish founded researchMCINN project MSTAR:UC3M, Ref:TIN2008-06491-C04-03, and byproject A3::UAM, Ref:TIN2007-66862-C02–02.
DS e-Archivo
RD 27 jul. 2024