A measure for data set editing by ordered projections

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 experiment s 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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Aguilar-Ruiz, J. S., Nepomuceno, J. A., Díaz-Díaz, N., & Nepomuceno, I. (2006). A measure for data set editing by ordered projections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4031 LNAI, pp. 1339–1348). Springer Verlag. https://doi.org/10.1007/11779568_141

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free