Skip to main content

On the Use of Clustering in Possibilistic Decision Tree Induction

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5590))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben Amor, N., Benferhat, S., Elouedi, Z.: Qualitative classification and evaluation in possibilistic decision trees. In: FUZZ-IEEE 2004, pp. 653–657 (2004)

    Google Scholar 

  2. Blockeel, H., Page, D., Srinivasan, A.: Multi-instance tree learning. In: Proceedings of the 22nd international conference on Machine learning, Bonn, Germany, pp. 57–64 (2005)

    Google Scholar 

  3. Borgelt, C., Gebhardt, J., Kruse, R.: Concepts for Probabilistic and Possibilistic Induction of Decision Trees on Real World Data. In: EUFIT 1996, pp. 1556–1560 (1996)

    Google Scholar 

  4. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and regression trees. Wadsworth & Brooks, Monterey (1984)

    MATH  Google Scholar 

  5. Dasarathy, B.V.: Nearest Neighbour(NN) norms: NN pattern classification techniques. IEEE Computer sociaty Press, Los Alamitos (1991)

    Google Scholar 

  6. Dubois, D., Prade, H.: Possibility theory. An approach to computerized processing of uncertainty. Plenum Press, New York (1988)

    MATH  Google Scholar 

  7. Hüllermeier, E.: Possibilistic Induction in decision tree learning. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) ECML 2002. LNCS, vol. 2430, pp. 173–184. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Hüllermeier, E., Beringer, J.: Learning from Ambiguously Labeled Examples. In: Intelligent Data Analysis, pp. 168–179 (2005)

    Google Scholar 

  9. Friedman, J.H., Kohavi, R., Yun, Y.: Lazy decision trees. In: Proceedings of the 13th National Conference on Artificial Intelligence, pp. 717–724 (1996)

    Google Scholar 

  10. Jenhani, I., Elouedi, Z., Ben Amor, N., Mellouli, K.: Qualitative inference in possibilistic option decision trees. In: Godo, L. (ed.) ECSQARU 2005. LNCS, vol. 3571, pp. 944–955. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Jenhani, I., Ben Amor, N., Elouedi, Z., Benferhat, S., Mellouli, K.: Information Affinity: a new similarity measure for possibilistic uncertain information. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS, vol. 4724, pp. 840–852. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Jenhani, I., Ben Amor, N., Elouedi, Z.: Decision Trees as Possibilistic Classifiers. International Journal of Approximate Reasoning 48(3), 784–807 (2008)

    Article  MATH  Google Scholar 

  13. Jenhani, I., Ben Amor, N., Benferhat, S., Elouedi, Z.: SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach. In: Hartmann, S., Kern-Isberner, G. (eds.) FoIKS 2008. LNCS, vol. 4932, pp. 348–364. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Jenhani, I., Benferhat, S., Elouedi, Z.: Properties Analysis of Inconsistency-based Possibilistic Similarity Measures. In: Proceedings of IPMU 2008, pp. 173–180 (2008)

    Google Scholar 

  15. Jenhani, I., Benferhat, S., Elouedi, Z.: Learning and evaluating possibilistic decision trees using information affinity. International Journal of Computer Systems Science and Engineering 4(3), 206–112 (2008)

    Google Scholar 

  16. Jensen, F.V.: Introduction to Bayesian networks. UCL Press (1996)

    Google Scholar 

  17. Johnson, S.C.: Hierarchical Clustering Schemes. Psychometrika 2, 241–254 (1967)

    Article  Google Scholar 

  18. Kruse, R., Gebhardt, J., Klawonn, F.: Foundations of Fuzzy Systems. John Wiley and Sons, Chichester (1994)

    MATH  Google Scholar 

  19. Moulin, H.: Axioms for cooperative decision-making. Cambridge Univ. Press, Cambridge (1988)

    Book  MATH  Google Scholar 

  20. Murphy, P.M., Aha, D.W.: UCI repository of machine learning databases (1996)

    Google Scholar 

  21. Quinlan, J.R.: Induction of decision trees. Machine Learning 1, 81–106 (1986)

    Google Scholar 

  22. Quinlan, J.R.: C4.5: Programs for machine learning. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  23. Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets ans Systems 1, 3–28 (1978)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jenhani, I., Benferhat, S., Elouedi, Z. (2009). On the Use of Clustering in Possibilistic Decision Tree Induction. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02906-6_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02905-9

  • Online ISBN: 978-3-642-02906-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics