Skip to main content
Log in

Dynamic clustering for interval data based on L 2 distance

  • Published:
Computational Statistics Aims and scope Submit manuscript

Summary

This paper introduces a partitioning clustering method for objects described by interval data. It follows the dynamic clustering approach and uses and L 2 distance. Particular emphasis is put on the standardization problem where we propose and investigate three standardization techniques for interval-type variables. Moreover, various tools for cluster interpretation are presented and illustrated by simulated and real-case data.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Figure 1:
Figure 2:

Similar content being viewed by others

References

  • Bock, H.-H. (1974), Automatische Klassifikation, Vandenhoeck & Ruprecht, Goettingen, chapter 17.

    MATH  Google Scholar 

  • Bock, H.-H. (2002), Clustering algorithms and Kohonen maps for symbolic data, Journal of the Japanese Society of Computational Statistics, 15, 1–13.

    Article  MathSciNet  Google Scholar 

  • Bock, H.-H. (2006), Visualizing symbolic data by Kohonen maps, in ‘Symbolic Data Analysis and the SODAS Software’. Diday, E. and Noirhomme-Fraiture M. Eds., Wiley (in press).

  • Bock, H.-H. and Diday, E. (2000), Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data, Springer.

  • Celeux, G.; Diday, E.; Govaert, G.; Lechevallier, Y.; Ralambondrainy, H. (1989), Classification Automatique des Données, Bordas, Paris.

    MATH  Google Scholar 

  • Chavent, M. and Lechevallier, Y. (2002), Dynamical Clustering Algorithm of Interval Data: Optimization of an Adequacy Criterion Based on Hausdorff Distance in ‘Classification, Clustering and Data Analysis’. Sokolowski, A. and Bock, H.-H., Eds., Springer, Heidelberg, pp. 53–59.

    Chapter  Google Scholar 

  • De Carvalho, F. A. T. and Souza, R. M. C. R. (1998), New metrics for Constrained Boolean Symbolic Objects in ‘Studies and Research: Proceedings of the Conference on Knowledge Extraction and Symbolic Data Analysis (KESDA’98)’. Office for Official Publications of the European Communities, Luxembourg, pp. 175–187.

    Google Scholar 

  • Diday, E. and Simon, J. J. (1976), Clustering Analysis, in ‘Digital Pattern Recognition’. Fu, K. S. Ed., Springer, Heidelberg, pp. 47–94.

    Chapter  Google Scholar 

  • Diday, E. and Brito, P. (1989), Symbolic Cluster Analysis, in ‘Conceptual and Numerical Analysis of Data’. Opitz, O. Ed., Springer-Verlag, Heidelberg, 45–84.

    Chapter  Google Scholar 

  • Diday, E. and Noirhomme-Fraiture, M. (2006), Symbolic Data Analysis and the SODAS Software, Wiley (in press).

  • El-Sonbaty, Y. and Ismail, M. A. (1998), ‘Fuzzy Clustering for Symbolic Data’, IEEE Transactions on Fuzzy Systems 6, 195–204.

    Article  Google Scholar 

  • Gordon, A. D. (1999), Classification, 2nd edition, Chapman & Hall, Boca Raton (Florida).

    MATH  Google Scholar 

  • Gordon, A. D. (2000), An Iteractive Relocation Algorithm for Classifying Symbolic Data, in ‘Data Analysis: Scientific Modeling and Practical Application’. Gaul, W. et al Eds., Springer-Verlag, Berlin, pp. 17–23.

    Chapter  Google Scholar 

  • Hubert, L. and Arabie, P. (1985), ‘Comparing Partitions’, Journal of Classification 2, 193–218.

    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 (4), 698–708.

    Article  MathSciNet  Google Scholar 

  • Jain, A. K., Murty, M. N. and Flynn, P. J. (1999), ‘Data Clustering: A Review’, ACM Computing Surveys 31 (3), 264–323.

    Article  Google Scholar 

  • Ok-Sakun, Y. (1975), Analyse Factorielle Typologique et Lissage Typologique, Thèse de 3ème cycle, Univ. Paris VI.

  • Ralambondrainy, H. (1995), ‘A conceptual version of the k-means algorithm’, Pattern Recognition Letters 16, 1147–1157.

    Article  Google Scholar 

  • Souza, R. M. C. R. and De Carvalho, F. A. T. (2004), Clustering of interval data based on city-block distances, Pattern Recognition Letters 25 (3), 353–365.

    Article  Google Scholar 

  • Schroeder, A. (1976), ‘Analyse d’un mélange de distributions de probabilité de même type’, Revue de Statistique Appliquée 24 (1), 39–62.

    MathSciNet  Google Scholar 

  • Verde, R., De Carvalho, F. A. T. and Lechevallier, Y. (2001), A Dynamical Clustering Algorithm for symbolic data, in ‘Tutorial on Symbolic Data Analysis’, held during the 25th Annual Conference of the Gesellschaft für Klassifikation, University of Munich, March 13, 2001.

Download references

Acknowledgements

The first author would like to thank CNPq (Brazilian Agency) for its financial support. The second author would like to thank Calouste Gulbenkian Foundation and FCT/MCTES (Portuguese Agency).

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Carvalho, F.d.A.T., Brito, P. & Bock, HH. Dynamic clustering for interval data based on L 2 distance. Computational Statistics 21, 231–250 (2006). https://doi.org/10.1007/s00180-006-0261-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00180-006-0261-z

Keywords

Navigation