On improving discretization quality by a bagging technique

Authors:
Taimur Qureshi;Djamel A. Zighed
Affiliations:
Laboratory ERIC, University of Lyon 2, Bron Cedex, France;Laboratory ERIC, University of Lyon 2, Bron Cedex, France
Venue:
ICNC'09 Proceedings of the 5th international conference on Natural computation
Year:
2009

Citing 4
Cited 0

Discretization: An Enabling Technique

Data Mining and Knowledge Discovery
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants

Machine Learning
MODL: A Bayes optimal discretization method for continuous attributes

Machine Learning
Improved use of continuous attributes in C4.5

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the real data often comes in a mixed format (discrete or continuous), however many supervised induction algorithms require discrete data. Quality discretization of continuous attributes is an important problem that has effects on accuracy, complexity, variance and understandability of the induction models. Most of the existing discretization methods, partition the attribute range into two or several intervals using a single or a set of cut points. In this paper, we introduce a resampling based bagging technique (using bootstrap) to generate a set of candidate discretization points and thus, improving the discretization quality by providing a better estimation towards the entire population. Thus, the goal of this paper is to observe whether this type of bagging variant can lead to better discretization points.