Publication:
Optimizing linear and quadratic data transformations for classification tasks

dc.affiliation.dptoUC3M. Departamento de Informáticaes
dc.affiliation.grupoinvUC3M. Grupo de Investigación: Computación Evolutiva y Redes Neuronales (EVANNAI)es
dc.contributor.authorValls, José M.
dc.contributor.authorAler, Ricardo
dc.date.accessioned2010-01-25T11:25:02Z
dc.date.accessioned2010-03-22T16:47:09Z
dc.date.available2010-01-25T11:25:02Z
dc.date.available2010-03-22T16:47:09Z
dc.date.issued2009
dc.descriptionProceeding of: Ninth International Conference on Intelligent Systems Design and Applications, 2009. ISDA '09. Nov. 30 2009-Dec. 2, 2009
dc.description.abstractMany 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, we optimize data transformations, which 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. The method has also been extended to a quadratic non-linear transformation. Results show that in general, the transformation methods described here either outperform or match the classifier working on the original data.
dc.description.sponsorshipThis work has been funded by the Spanish Ministry of Science under contract TIN2008-06491-C04-03 (MSTAR project)
dc.description.statusPublicado
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.format.mimetypeapplication/octet-stream
dc.format.mimetypeapplication/octet-stream
dc.format.mimetypeapplication/octet-stream
dc.format.mimetypeapplication/pdf
dc.identifier.bibliographicCitationNinth International Conference on Intelligent Systems Design and Applications, 2009. ISDA'09. pp. 1025 - 1030
dc.identifier.doi10.1109/ISDA.2009.222
dc.identifier.isbn978-0-7695-3872-3
dc.identifier.publicationfirstpage1025
dc.identifier.publicationlastpage1030
dc.identifier.publicationtitleNinth International Conference on Intelligent Systems Design and Applications, 2009. ISDA'09
dc.identifier.urihttps://hdl.handle.net/10016/6604
dc.language.isoeng
dc.publisherIEEE
dc.relation.eventdateNov. 30 2009-Dec. 2, 2009
dc.relation.eventnumber9
dc.relation.eventplacePisa (Italy)
dc.relation.eventtitleInternational Conference on Intelligent Systems Design and Applications, 2009. ISDA '09.
dc.relation.publisherversionhttp://dx.doi.org/10.1109/ISDA.2009.222
dc.rights© IEEE
dc.rights.accessRightsopen access
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject.ecienciaInformática
dc.subject.ofertatecnologicaEvolutionary-based machine learning
dc.subject.otherData transformations
dc.subject.otherGeneral euclidean distances
dc.subject.otherEvolutionary computation
dc.titleOptimizing linear and quadratic data transformations for classification tasks
dc.typeconference paper*
dc.type.reviewPeerReviewed
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
optimizing_ISDA_2009.pdf
Size:
75.4 KB
Format:
Adobe Portable Document Format
Description:
Publisher version