Abstract
Two dynamic cluster methods for interval data are presented: the first method furnish a partition of the input data and a corresponding prototype (a vector of intervals) for each class by optimizing an adequacy criterion based on Mahalanobis distances between vectors of intervals and the second is an adaptive version of the first method. In order to show the usefulness of these methods, synthetic and real interval data sets considered. The synthetic interval data sets are obtained from quantitative data sets drawn according to bi-variate normal distributions. The adaptive method outperforms the non-adaptive one concerning the average behaviour of a cluster quality measure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bock, H.H., Diday, E.: Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data. Springer, Berlin (2000)
Chavent, M., Lechevallier, Y.: Dynamical Clustering Algorithm of Interval Data: Optimization of an Adequacy Criterion Based on Hausdorff Distance. In: Sokolowsky, Bock, H.H., Jaguja, A. K. (eds.) Classification, Clustering and Data Analysis (IFCS 2002), pp. 53–59. Springer, Berlin (2002)
Diday, E., Govaert, G.: Classification Automatique avec Distances Adaptatives. R.A.I.R.O. Informatique Computer Science 11(4), 329–349 (1977)
Diday, E., Simon, J.C.: Clustering analysis. In: Fu, K.S. (ed.) Digital Pattern Clasification, pp. 47–94. Springer, Berlin (1976)
Govaert, G.: Classification automatique et distances adaptatives. Thèse de 3ème cycle, Mathématique appliquée, Universit´e Paris VI (1975)
Hubert, L., Arabie, P.: Comparing Partitions. Journal of Classification 2, 193–218 (1985)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31(3), 264–323 (1999)
Milligan, G.W.: Clustering Validation: results and implications for applied analysis. In: Arabie, P., Hubert, L.J., De Soete, G. (eds.) Clustering and Classification, pp. 341–375. Word Scientific, Singapore (1996)
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)
Verde, R., De Carvalho, F.A.T., Lechevallier, Y.: A dynamical clustering algorithm for symbolic data. In: Diday, E., Lechevallier, Y. (eds.) Tutorial on Symbolic Data Analysis (Gfkl 2001), pp. 59–72 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Souza, R.M.C.R., de Carvalho, F.A.T., Tenorio, C.P. (2004). Two Partitional Methods for Interval-Valued Data Using Mahalanobis Distances. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-30498-2_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23806-5
Online ISBN: 978-3-540-30498-2
eBook Packages: Springer Book Archive