Skip to main content

A Tree Structured Classifier for Symbolic Class Description

  • Chapter
  • 2311 Accesses

Abstract

We have a class of statistical units from a population, for which the data table may contain symbolic data; that is rather than having a single value for an observed variable, an observed value for the aggregated statistical units we treat here may be multivalued. Our aim is to describe a partition of this class of statistical units by further partitioning it, where each class of the partition is described by a conjunction of characteristic properties. We use a stepwise top-down binary tree method. At each step we select the best variable and its optimal splitting to optimize simultaneously a discrimination criterion given by a prior partition and a homogeneity criterion; we also aim to insure that the descriptions obtained describe the units in the class to describe and not the rest of the population. We present a real example.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BOCK, H.H. and DIDAY, E. (2000): Analysis of Symbolic Data. Springer, Heidelberg.

    Google Scholar 

  • BREIMAN, L., FRIEDMAN, J.H., OLSHEN, R.A., and STONE, C.J. (1984): Classification and Regression Trees. Wadsworth, Belmont, California.

    Google Scholar 

  • CHAVENT, M. (1997): Analyse de Données Symboliques, Une Méthode Divisive de Classification. Thèse de Doctorat, Universite Paris IX Dauphine.

    Google Scholar 

  • DIDAY, E. (2000): Symbolic Data Analysis and the SODAS Project: Purpose, History, and Perspective In: H.H. Bock and E. Diday (Eds.): Analysis of Symbolic Data. Springer, Heidelberg, 1–23.

    Google Scholar 

  • LIMAM, M., DIDAY, E., and WINSBERG, S. (2003): Symbolic class description with interval data. Journal of Symbolic Data Analysis, 1. [available online: http://www.jsda.unina2.it/newjsda/volumes/index.htm.]

    Google Scholar 

  • PÉRINEL, E. (1999): Construire un arbre de discrimination binaire à partir de données imprécises. Revue de Statistique Appliquée, 47, 5–30.

    Google Scholar 

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

    Google Scholar 

  • VRAC, M., LIMAM, M., DIDAY, E., and WINSBERG, S. (2002): Symbolic class description In: K. Jajuga, A. Sokolowski, and H.H. Bock (Eds.): Classification, Clustering, and Data Analysis. Springer, Heidelberg, 329–337.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin · Heidelberg

About this chapter

Cite this chapter

Diday, E., Limam, M.M., Winsberg, S. (2005). A Tree Structured Classifier for Symbolic Class Description. In: Baier, D., Decker, R., Schmidt-Thieme, L. (eds) Data Analysis and Decision Support. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28397-8_3

Download citation

Publish with us

Policies and ethics