Shape and Size Regularization in Expectation Maximization and Fuzzy Clustering
| Type of publication: | Inproceedings |
| Citation: | Borgelt_and_Kruse_2004b |
| Booktitle: | Proc.\ 8th European Conf.\ on Principles and Practice of Knowledge Discovery in Databases (PKDD 2004, Pisa, Italy) |
| Volume: | 3202/2004 |
| Year: | 2004 |
| Pages: | 52--62 |
| Publisher: | Springer-Verlag |
| Address: | Heidelberg, Germany |
| URL: | http://borgelt.net/papers/pkdd... |
| DOI: | 10.1007/b100704 |
| 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. |
| Keywords: | |
| Authors | |
| Added by: | [ADM] |
| Total mark: | 0 |
|
Attachments
|
|
|
|
|
Notes
|
|
|
|
|
|
Topics
|
|
|
|
