An Evolution Strategies Approach to the Simultaneous Discretization of Numeric Attributes in Data Mining

Download
  1. (PDF, 317 KB)
AuthorSearch for: ; Search for: ; Search for:
TypeArticle
ConferenceProceedings of the World Congress on Evolutionary Computation, December 8-12, 2003., Canberra, Australia
AbstractMany data mining and machine learning algorithms require databases in which objects are described by discrete attributes. However, it is very common that the attributes are in the ratio or interval scales. In order to apply these algorithms, the original attributes must be transformed into the nominal or ordinal scale via discretization. An appropriate transformation is crucial because of the large influence on the results obtained from data mining procedures. This paper presents a hybrid technique for the simultaneous supervised discretization of continuous attributes, based on Evolutionary Algorithms, in particular, Evolution Strategies (ES), which is combined with Rough Set Theory and Information Theory. The purpose is to construct a discretization scheme for all continuous attributes simultaneously (i.e. global) in such a way that class predictability is maximized w.r.t the discrete classes generated for the predictor variables. The ES approach is applied to 17 public data sets and the results are compared with classical discretization methods. ES-based discretization not only outperforms these methods, but leads to much simpler data models and is able to discover irrelevant attributes. These features are not present in classical discretization techniques.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number46536
NPARC number8913707
Export citationExport as RIS
Report a correctionReport a correction
Record identifier2639f4b1-63ad-4f00-92d7-0d7a03d74930
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)