We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Accelerating EM clustering to find high-quality solutions.
- Authors
Ordonez, Carlos; Omiecinski, Edward
- Abstract
Clustering is one of the most important techniques used in data mining. This article focuses on the EM clustering algorithm. Two fundamental aspects are studied: achieving faster convergence and finding higher quality clustering solutions. This work introduces several improvements to the EM clustering algorithm, being periodic M steps during initial iterations, reseeding of low-weight clusters and splitting of high-weight clusters the most important. These improvements lead to two important parameters. The first parameter is the number of M steps per iteration and the second one, a weight threshold to reseed low-weight clusters. Experiments show how frequently the M step must be executed and what weight threshold values make EM reach higher quality solutions. In general, the improved EM clustering algorithm finds higher quality solutions than the classical EM algorithm and converges in fewer iterations.
- Subjects
EXPECTATION-maximization algorithms; GAUSSIAN processes; ALGORITHMS; STOCHASTIC convergence; ESTIMATION theory
- Publication
Knowledge & Information Systems, 2005, Vol 7, Issue 2, p135
- ISSN
0219-1377
- Publication type
Article
- DOI
10.1007/s10115-003-0141-6