Interactive Decision Tree Construction for Interval and Taxonomical Data

  • Authors:
  • François Poulet;Thanh-Nghi Do

  • Affiliations:
  • IRISA-Texmex, Université de Rennes I, Rennes Cedex, France 35042;Equipe InSitu INRIA Futurs, LRI, Bat.490, Université Paris Sud, Orsay Cedex, France 91405

  • Venue:
  • Visual Data Mining
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Visual data-mining strategy lies in tightly coupling the visualizations and analytical processes into one data-mining tool that takes advantage of the assets from multiple sources. This paper presents two graphical interactive decision tree construction algorithms able to deal either with (usual) continuous data or with interval and taxonomical data. They are the extensions of two existing algorithms: CIAD [17] and PBC [3]. Both CIAD and PBC algorithms can be used in an interactive or cooperative mode (with an automatic algorithm to find the best split of the current tree node). We have modified the corresponding help mechanisms to allow them to deal with interval-valued attributes. Some of the results obtained on interval-valued and taxonomical data sets are presented with the methods we have used to create these data sets.