Decision Trees for Uncertain Data

  • Tsang S
  • Kao B
  • Yip K
 et al. 
  • 1


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Traditional decision tree classifiers work with data whose values are known and precise. We extend such classifiers to handle data with uncertain information, which originates from measurement/quantisation errors, data staleness, multiple repeated measurements, etc. The value uncertaintyis represented by multiple values forming a probability distribution function (pdf). We discover that the accuracy of a decision tree classifier can be much improved if the whole pdf, rather than a simple statistic, is taken into account. We extend classical decision tree building algorithms to handle data tuples with uncertain values. Sinceprocessing pdf’sis computationally more costly, we propose a series of pruning techniques that can greatly improve the efficiency of the construction of decision trees. I.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in


  • Smith Tsang

  • Ben Kao

  • Kevin Y. Yip

  • Wai-Shing S Ho

  • Sau Dan Lee

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free