A Measure for Data Set Editing by Ordered Projections
In this paper we study a measure, named weakness of an example, which allows us to establish the importance of an example to find representative patterns for the data set editing problem. Our approach consists in reducing the database size without losing information, using algorithm patterns by ordered projections. The idea is to relax the reduction factor with a new parameter, λ, removing all examples of the database whose weakness verify a condition over this λ. We study how to establish this new parameter. Our experiments have been carried out using all databases from UCI-Repository and they show that is possible a size reduction in complex databases without notoriously increase of the error rate.
KeywordsFeature Selection Voronoi Diagram Continuous Attribute Decision Boundary Nominal Attribute
Unable to display preview. Download preview PDF.
- 1.Aguilar, J.S., Riquelme, J.C., Toro, M.: Data set editing by ordered projection. In: Proceedings of the 14th European Conference on Artificial Intelligence (ECAI 2000), Berlin, Germany, pp. 251–255 (2000)Google Scholar
- 2.Aha, D.W., Kibler, D., Albert, M.K.: Instance-based learning algorithms. Mach. Learning 6, 37–66 (1991)Google Scholar
- 3.Blake, C., Merz, E.K.: UCI repository of machine learning databases (1998)Google Scholar
- 9.Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kauffmann, San Mateo (1993)Google Scholar