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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Riquelme, J.C., Aguilar-Ruiz, J.S., Toro, M.: Finding representative patterns with ordered projections. Pattern Recognition 36, 1009–1018 (2003)
Ruiz, R., Riquelme, J.C., Aguilar-Ruiz, J.S.: NLC: A Measure Based on Projections. In: Mařík, V., Štěpánková, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 907–916. Springer, Heidelberg (2003)
Aguilar-Ruiz, J.S., Nepomuceno, J.A., Díaz-Díaz, N., Nepomuceno-Chamorro, I.A.: A Measure for Data Set Editing by Ordered Projections. IEA/AIE, pp. 1339–1348 (2006)
Blake, C., Merz, E.K.: UCI repository of machine learning databases (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nepomuceno, I., Nepomuceno, J.A., Ruiz, R., Aguilar–Ruiz, J.S. (2006). Databases Reduction Simultaneously by Ordered Projection. In: Todorovski, L., Lavrač, N., Jantke, K.P. (eds) Discovery Science. DS 2006. Lecture Notes in Computer Science(), vol 4265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893318_38
Download citation
DOI: https://doi.org/10.1007/11893318_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46491-4
Online ISBN: 978-3-540-46493-8
eBook Packages: Computer ScienceComputer Science (R0)