Sciweavers

Share
ICPR
2004
IEEE

A Rival Penalized EM Algorithm towards Maximizing Weighted Likelihood for Density Mixture Clustering with Automatic Model Select

9 years 6 months ago
A Rival Penalized EM Algorithm towards Maximizing Weighted Likelihood for Density Mixture Clustering with Automatic Model Select
How to determine the number of clusters is an intractable problem in clustering analysis. In this paper, we propose a new learning paradigm named Maximum Weighted Likelihood (MwL), in which the weights are designable. Accordingly, we develop a novel Rival Penalized Expectation-Maximization (RPEM) algorithm, whose intrinsic rival penalization mechanism enables the redundant densities in the mixture to be gradually faded out during the learning. Hence, the RPEM can automatically select an appropriate number of densities in density mixture clustering. The experiments have shown the promising results.
Yiu-ming Cheung
Added 09 Nov 2009
Updated 09 Nov 2009
Type Conference
Year 2004
Where ICPR
Authors Yiu-ming Cheung
Comments (0)
books