The recording of symbolic interval data has become a common practice with the recent advances in database technologies. This paper presents a fuzzy c-means clustering algorithm for symbolic interval data. This method furnishes a partition of the input data and a corresponding prototype (a vector of intervals) for each class by optimizing an adequacy criterion which is based on a suitable single adaptive Euclidean distance between vectors of intervals. Experiments with real and synthetic symbolic interval data sets showed the usefulness of the proposed method. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
De Carvalho, F. D. A. T. (2006). A fuzzy clustering algorithm for symbolic interval data based on a single adaptive euclidean distance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4234 LNCS-III, pp. 1012–1021). Springer Verlag. https://doi.org/10.1007/11893295_111
Mendeley helps you to discover research relevant for your work.