Skip to main content

From Data Mining to Knowledge Mining: An Introduction to Symbolic Data Analysis

  • Chapter
Data Analysis

Abstract

The need to extend standard data analysis methods (exploratory, clustering, factorial analysis, discrimination,…) to more complex data table is increasing in order to get more accurate information and summarize extensive data sets contained in huge databases. We define Symbolic Data Analysis (SDA) as the extension of standard Data Mining to such data tables.

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

Access this chapter

eBook
USD 16.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

  • BANDEMER, H. and NATHER, W. (1992): Fuzzy Data Analysis. Kluwer, Dordrecht.

    Book  Google Scholar 

  • BOCK, H.H. and DIDAY, E. (eds.), (1999): Analysis of Symbolic Data, Exploratory methods for extracting statistical information from complex data. Studies in Classification, Data Analysis and Knowledge Organization, Springer, Heidelberg.

    Google Scholar 

  • BRITO, P. and DIDAY, E. (1991): Pyramidal representation of symbolic objects. In NATO ASI Series, Vol F61, Schader and Gaul (eds.), Springer, Heidelberg.

    Google Scholar 

  • CHAVENT, M. (1998): Analyse de Données symboliques. Une méthode divisive de classification. Phd thesis, Université Paris IX Dauphine.

    Google Scholar 

  • CHAVENT, M. (1998): A monothetic clustering algorithm. Pattern Recognition Letters, 19, 989–996.

    Article  Google Scholar 

  • CHOUAKRIA, A., DIDAY, E., and CAZES, P. (1998): Vertices Principal Components With an Improved Factorial Representation. In: A. Rizzi, M. Vichi, and H.-H. Bock (Eds.): Advances in Data Science and Classification. Springer, Heidelberg, 397–402.

    Chapter  Google Scholar 

  • CIAMPI, A., DIDAY, E., LEBBE, J., PERINEL, E., and VIGNES, R. (1995): Tree-Growing with Probabilistically Imprecise Data In: E. Diday, Y. Lechevallier, and O Opitz (eds.): Ordinal and Symbolic Data Analysis. Springer, Heidelberg, 201–214.

    Google Scholar 

  • DE CARVALHO, F. A. T. (1994): Proximity coefficients between boolean symbolic objects. In: E. Diday, Y. Lechevallier, M. Schader, P. Bertrand, and B. Burtschy (eds.): New Approaches in Classification and Data Analysis. Springer, Heidelberg, 387–394.

    Google Scholar 

  • DIDAY, E. (1988): The symbolic approach in clustering and related methods of data analysis: The basic choices. In IFCS-87, H. H. Bock (ed.). 673–684.

    Google Scholar 

  • DIDAY, E. (1995): Probabilist, possibilist and belief objects for knowledge analysis Annals of Operations Research, 55, 227–276.

    Article  Google Scholar 

  • DIDAY, E. and EMILION, R. (1995): Lattices and Capacities in Analysis of Probabilist Objects. In: E. Diday, Y. Lechevallier, and O Opitz (eds.): Ordinal and Symbolic Data Analysis. Springer, Heidelberg, 13–30.

    Google Scholar 

  • ESPOSITO, F., MALERBA, D., and SEMERARO, G. (1991): Flexible matching of noisy structural descriptions.. In J. Mylopoulos and R. Reiter (eds.): Proc. 12th Joint Conference on Artificial Intelligence. Morgan Kaufman Publishers, San Mateo, 658–664.

    Google Scholar 

  • GOWDA, K.C. and DIDAY, E. (1992): Symbolic clustering using a new similarity measure. IEEE Trans. Syst. Man and Cybernet, 22, 368–378.

    Article  Google Scholar 

  • LAURO, C. and PALUMBO F. (1998): New approaches to Principal Component Analysis of Interval Data. In Proc. NTTS’98, Sorrento.

    Google Scholar 

  • NOIRHOMME-FRAITURE, M. and ROUARD, M. (1998): Representation of Sub- Populations and Correlation with Zoom Star. In Proc. NTTS’98, Sorrento.

    Google Scholar 

  • PERINEL, E. (1996): Segmentation et Analyse de Données Symboliques; Application à des données Probabilistes Imprécis es. PhD thesis, Université Paris Ix Dauphine.

    Google Scholar 

  • RASSON, J.P. and LISSOIR, S. (1998): Symbolic Kernel discriminante analysis. In Proc. NTTS’98, Sorrento.

    Google Scholar 

  • STEPHAN, V. (1998): Construction d’objets symboliques par synthèse des résultats de requêtes SQL. PhD thesis, Université Paris Ix Dauphine.

    Google Scholar 

  • STEPHAN, V., HEBRAIL, G., and LECHEVALLIER, Y. (1997): Improving symbolic descriptions of sets of individuals: the reduction of assertions. In 8th international symposium on Applied Stochastic Models and Data Analysis. Anacapri, 407–412.

    Google Scholar 

  • VERDE, R. and DE CARVALHO, F.A.T. (1998): Dependance rules influence on factorial representation of boolean symbolic objects. In Proc. KESDA’98, Luxembourg.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin · Heidelberg

About this chapter

Cite this chapter

Diday, E., Lechevallier, Y. (2000). From Data Mining to Knowledge Mining: An Introduction to Symbolic Data Analysis. In: Gaul, W., Opitz, O., Schader, M. (eds) Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58250-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58250-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67731-4

  • Online ISBN: 978-3-642-58250-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics