Skip to main content
SpringerLink
Log in

An Iterative Relocation Algorithm for Classifying Symbolic Data

  • Chapter
Data Analysis

Abstract

The paper presents an iterative relocation algorithm that seeks to partition the descriptions of Boolean symbolic objects into classes so as to minimize the sum of the description potentials of the classes.

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

Access this chapter

Log in via an institution
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

  • BOCK, H. H. and DIDAY, E. (Eds.) (2000): Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data. Springer-Verlag, Berlin.

    Google Scholar 

  • CHAVENT, M. (2000): Criterion-Based Divisive Clustering for Symbolic Data. In: H. H. Bock and E. Diday (Eds.): Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data. Springer-Verlag, Berlin, 299–311.

    Google Scholar 

  • DASKIN, M. S. (1995): Network and Discrete Location Models, Algorithms, and Applications. Wiley, New York.

    Book  Google Scholar 

  • DE CARVALHAO, 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-Verlag,. Berlin, 387–394.

    Google Scholar 

  • DE CARVALHAO, F. A. T. (1998): Extension Based Proximities Between Constrained Boolean Symbolic Objects. In: C. Hayashi, N. Ohsumi, K. Yajima, Y. Tanaka, H.-H. Bock and Y. Baba (Eds.): Data Science, Classification, and Related Methods. Springer-Verlag, Tokyo, 370–378.

    Google Scholar 

  • DIDAY, E. (2000): Symbolic Data Analysis and the SODAS Project: Purpose, History, Perspective. In: H. H. Bock and E. Diday (Eds.): Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data. Springer-Verlag, Berlin, 1–23.

    Google Scholar 

  • EL-SONBATY, Y. and ISMAIL, M. A. (1998): Fuzzy Clustering for Symbolic Data. IEEE Transactions on Fuzzy Systems, 6, 195–204.

    Article  Google Scholar 

  • ERLENKOTTER, D. (1978): A Dual-Based Procedure for Uncapacitated Facility Location. Operations Research, 26, 992–1009.

    Article  Google Scholar 

  • GOWDA, K. C. and DIDAY, E. (1991): Symbolic Clustering Using a New Dissimilarity Measure. Pattern Recognition, 24, 567–578.

    Article  Google Scholar 

  • GOWDA, K. C. and DIDAY, E. (1994): Symbolic Clustering Algorithms Using Similarity and Dissimilarity Measures. In: E. Diday, Y. Lechevallier, M. Schader, P. Bertrand and B. Burtschy (Eds.): New Approaches in Classification and Data Analysis. Springer-Verlag, Berlin, 414–422.

    Google Scholar 

  • GOWDA, K. C. and RAVI, T. V. (1996): Genetic Algorithms for Symbolic Clustering. Sâdhand, 21, 465–475.

    Google Scholar 

  • HANJOUL, P. and PEETERS. D. (1985): A Comparison of Two Dual-Based Procedures for Solving the p-Median Problem. European Journal of Operational Research, 20, 387–396.

    Article  Google Scholar 

  • HO, T. B., DIDAY, E. and GETTLER-SUMMA, M. (1988): Generating Rules for Expert Systems from Observations. Pattern Recognition Letters, 7, 265–271.

    Article  Google Scholar 

  • ICHINO, M. and YAGUCHI, H. (1994): Generalized Minkowski Metrics for Mixed Feature-Type Data Analysis. IEEE Transactions on Systems, Man, and Cybernetics, 24, 698–708.

    Article  Google Scholar 

  • KAUFMAN, L. and ROUSSEEUW, P. J. (1990): Finding Groups In Data: An Introduction to Cluster Analysis. Wiley, New York.

    Book  Google Scholar 

  • RALAMBONDRAINY, H. (1995): A Conceptual Version of the k-Means Algorithm. Pattern Recognition Letters, 16, 1147–1157.

    Article  Google Scholar 

  • TONG, T. T. H. and HO, T. B. (1991): A Method for Generating Rules from Examples and its Application. In: E. Diday and Y. Lechevallier (Eds.): Symbolic-Numeric Data Analysis and Learning. Nova Science, New York, 493–504.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, University of St Andrews, North Haugh, St Andrews, KY16 9SS, Scotland

    Allan D. Gordon

Authors
  1. Allan D. Gordon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Entscheidungstheorie und Unternehmensforschung, Universität Karlsruhe (TH), Kaiserstraße 12, D-76128, Karlsruhe, Germany

    Wolfgang Gaul

  2. Lehrstuhl für Mathematische Methoden der Wirtschaftswissenschaften, Universität Augsburg, Universitätsstraße 16, D-86135, Augsburg, Germany

    Otto Opitz

  3. Lehrstuhl für Wirtschaftsinformatik III, Universität Mannheim, Schloß, D-68131, Mannheim, Germany

    Martin Schader

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin · Heidelberg

About this chapter

Cite this chapter

Gordon, A.D. (2000). An Iterative Relocation Algorithm for Classifying Symbolic Data. 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_2

Download citation

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

  • 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

Search

Navigation