On the Use of Clustering in Possibilistic Decision Tree Induction

  • Authors:
  • Ilyes Jenhani;Salem Benferhat;Zied Elouedi

  • Affiliations:
  • LARODEC, Institut Supérieur de Gestion de Tunis, Tunisia and CRIL, Université d'Artois, Lens, France;CRIL, Université d'Artois, Lens, France;LARODEC, Institut Supérieur de Gestion de Tunis, Tunisia

  • Venue:
  • ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents an extension of a standard decision tree classifier, namely, the C4.5 algorithm. This extension allows the C4.5 algorithm to handle uncertain labeled training data where uncertainty is modeled within the possibility theory framework. The extension mainly concerns the attribute selection measure in which a clustering of possibility distributions of a partition is performed in order to assess the homogeneity of that partition. This paper also provides a comparison with previously proposed possibilistic decision tree approaches.