Clustering of Interval-Valued Data Using Adaptive Squared Euclidean Distances
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.
Unable to display preview. Download preview PDF.
- 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