Skip to main content

Clustering of Interval-Valued Data Using Adaptive Squared Euclidean Distances

  • Conference paper
Neural Information Processing (ICONIP 2004)

Abstract

This paper presents a clustering method for interval-valued data using a dynamic cluster algorithm with adaptive squared Euclidean distances. This method furnishes a partition and a prototype to each cluster by optimizing an adequacy criterion that measures the fitting between the clusters and their representatives. To compare a class with its representative, the method uses an adaptive version of a squared Euclidean distance to interval-valued data. Experiments with real and artificial interval-valued data sets shows the usefulness of the this method.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

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

    Google Scholar 

  2. De Carvalho, F.A.T., Brito, P., Bock, H.H.: Dynamical Clustering for symbolic quantitative data. In: Workshop in Symbolic Data Analysis, Cracow (2002)

    Google Scholar 

  3. Diday, E., Govaert, G.: Classification Automatique avec Distances Adaptatives. R.A.I.R.O. Informatique Computer Science 11(4), 329–349 (1977)

    MathSciNet  Google Scholar 

  4. Hubert, L., Arabie, P.: Comparing Partitions. Journal of Classification 2, 193–218 (1985)

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Souza, R.M.C.R., de A.T. de Carvalho, F., Silva, F.C.D. (2004). Clustering of Interval-Valued Data Using Adaptive Squared Euclidean Distances. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds) Neural Information Processing. ICONIP 2004. Lecture Notes in Computer Science, vol 3316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30499-9_119

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30499-9_119

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30499-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics