A measure for data set editing by ordered projections

Authors:
Jesús S. Aguilar-Ruiz;Juan A. Nepomuceno;Norberto Díaz-Díaz;Isabel Nepomuceno
Affiliations:
Bioinformatics Group of Seville, Pablo de Olavide University and University of Seville, Spain;Bioinformatics Group of Seville, Pablo de Olavide University and University of Seville, Spain;Bioinformatics Group of Seville, Pablo de Olavide University and University of Seville, Spain;Bioinformatics Group of Seville, Pablo de Olavide University and University of Seville, Spain
Venue:
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Year:
2006

Citing 3
Cited 2

Instance-Based Learning Algorithms

Machine Learning
C4.5: programs for machine learning

C4.5: programs for machine learning
Improved heterogeneous distance functions

Journal of Artificial Intelligence Research

Prototype selection based on sequential search

Intelligent Data Analysis
Databases reduction simultaneously by ordered projection

DS'06 Proceedings of the 9th international conference on Discovery Science

Quantified Score

Hi-index	0.00

Visualization

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 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.