Title
Databases reduction simultaneously by ordered projection
Date Issued
01 January 2006
Access level
open access
Resource Type
conference paper
Author(s)
Nepomuceno I.
Nepomuceno J.A.
Ruiz R.
Universidad de Sevilla
Publisher(s)
Springer Verlag
Abstract
In this paper, a new algorithm Database Reduction Simultaneously by Ordered Projections (RESOP) is introduced. This algorithm reduces databases in two directions: editing examples and feature selection simultaneously. Ordered projections techniques have been used to design RESOP taking advantage of symmetrical ideas for two different task. Experimental results have been made with UCI Repository databases and the performance for the latter application of classification techniques has been satisfactory. © Springer-Verlag Berlin Heidelberg 2006.
Start page
337
End page
341
Volume
4265 LNAI
Language
English
OCDE Knowledge area
Ciencias de la computación Ingeniería de sistemas y comunicaciones
Scopus EID
2-s2.0-33750728068
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN of the container
03029743
ISBN of the container
9783540464914
Conference
9th International Conference on Discovery Science, DS 2006
Sources of information: Directorio de Producción Científica Scopus