Discretization of Continuous Attributes

Fabrice Muhlenbach (1) , Ricco Rakotomalala (2)

1 LHC - Laboratoire Hubert Curien
2 ERIC - Equipe de Recherche en Ingénierie des Connaissances

In the data mining field, many learning methods -like association rules, Bayesian networks, induction rules (Grzymala-Busse & Stefanowski, 2001)- can handle only discrete attributes. Therefore, before the machine learning process, it is necessary to re-encode each continuous attribute in a discrete attribute constituted by a set of intervals, for example the age attribute can be transformed in two discrete values representing two intervals: less than 18 (a minor) and 18 and more (of age). This process, known as discretization, is an essential task of the data preprocessing, not only because some learning methods do not handle continuous attributes, but also for other important reasons: the data transformed in a set of intervals are more cognitively relevant for a human interpretation (Liu, Hussain, Tan & Dash, 2002); the computation process goes faster with a reduced level of data, particularly when some attributes are suppressed from the representation space of the learning problem if it is impossible to find a relevant cut (Mittal & Cheong, 2002); the discretization can provide non-linear relations -e.g., the infants and the elderly people are more sensitive to illness.

Mots clés: data mining; data warehousing; fouille de donnnées; entrepôt de données

Domaines: Apprentissage [cs.LG]

Fabrice Muhlenbach, Ricco Rakotomalala. Discretization of Continuous Attributes. John Wang. Encyclopedia of Data Warehousing and Mining, Idea Group Reference, pp.397-402, 2005. ⟨hal-00383757v2⟩