Shape and size regularization in expectation maximization and fuzzy clustering

Authors:
Christian Borgelt;Rudolf Kruse
Affiliations:
Otto-von-Guericke-University of Magdeburg, Universitätsplatz 2, D-39106 Magdeburg, Germany;Otto-von-Guericke-University of Magdeburg, Universitätsplatz 2, D-39106 Magdeburg, Germany
Venue:
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Year:
2004

Citing 0
Cited 2

Accelerating fuzzy clustering

Information Sciences: an International Journal
User-driven fuzzy clustering: on the road to semantic classification

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The more sophisticated fuzzy clustering algorithms, like the Gustafson-Kessel algorithm [11] and the fuzzy maximum likelihood estimation (FMLE) algorithm [10] offer the possibility of inducing clusters of ellipsoidal shape and different sizes. The same holds for the EM algorithm for a mixture of Gaussians. However, these additional degrees of freedom often reduce the robustness of the algorithm, thus sometimes rendering their application problematic. In this paper we suggest shape and size regularization methods that handle this problem effectively.