SciELO - Scientific Electronic Library Online

 
 issue41Design of cast iron square box couplings for sugar cane mills by the method of finite elementsSurvey of clustering techniques for mobile ad hoc networks author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Revista Facultad de Ingeniería Universidad de Antioquia

Print version ISSN 0120-6230On-line version ISSN 2422-2844

Abstract

CABALLERO, Yailé et al. A new algorithm for feature selection based on rough sets theory. Rev.fac.ing.univ. Antioquia [online]. 2007, n.41, pp.132-144. ISSN 0120-6230.

Rough Sets Theory has opened new trends for the development of data analysis techniques. In this theory, the notion of reduct is very significant, but obtaining a reduct in a decision system is an expensive computing process although very important in data analysis and new discoveries. Because of this, it has been necessary to develop different variants to calculate reducts. The present work looks into the utility that offers Rough Sets in feature selection and a new method is presented with the purpose of calculate a good reduct. This new method consists of a greedy algorithm that uses heuristics to work out a good reduct in acceptable times. Experimental results obtained by using different data sets are presented.

Keywords : Feature selection; reduct; rough sets.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License