Classify uncertain data with decision tree

  • Authors:
  • Biao Qin;Yuni Xia;Rakesh Sathyesh;Jiaqi Ge;Sunil Probhakar

  • Affiliations:
  • Indiana University Purdue University Indianapolis;Indiana University Purdue University Indianapolis;Indiana University Purdue University Indianapolis;Indiana University Purdue University Indianapolis;Purdue University West Lafayette

  • Venue:
  • DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This demo presents a decision tree based classification system for uncertain data. Decision tree is a commonly used data classification technique. Tree learning algorithms can generate decision tree models from a training data set. When working on uncertain data or probabilistic data, the learning and prediction algorithms need handle the uncertainty cautiously, or else the decision tree could be unreliable and prediction results may be wrong. In this demo, we will present DTU, a new decision tree based classification and prediction system for uncertain data. This tool uses new measures for constructing, pruning and optimizing decision tree. These new measures are computed considering uncertain data probability distribution functions. Based on the new measures, the optimal splitting attributes and splitting values can be identified and used in the decision tree. We will show in this demo that DTU can process various types of uncertainties and it has satisfactory classification performance even when data is highly uncertain.