2005 · 107 citations · 15 references
ComputingComputer ScienceMathematicsMachine LearningStatistical ComputingStatistical ModelingClustered Data AnalysisDensity EstimationDocument ClusteringLikelihood EstimationOptimization For Machine LearningUnsupervised LearningAnnealingClusteringFixed-point IterationGaussian Mixture ModelsK-means ClusteringLikelihood MaximizationMixture ModelObjective Function Formulation
The Gaussian mixture model or Gaussian mixture density decomposition(GMDD) use the likelihood function as a measure of fit. We show that just the same algorithm as the GMDD can be derived from a modified objective function of fuzzy c-means (FCM) clustering with the regularizer by K-L information, only when the parameter /spl lambda/ equals 2. Although the fixed-point iteration scheme of FCM is similar to that of the GMDD, the FCM has more flexible structure since the algorithm is based on the objective function method. In a slightly different manner such as installing a deterministic annealing or an addition of Gustafson and Kessel's (1979) constraint, the proposed algorithm is likely to provide more valid clustering results.
15
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
The EM Algorithm and Extensions
Debashis Kushary, Geoffrey J. McLachlan, Thriyambakam Krishnan · Technometrics · 1998 · 5.1K citations
Mixture Densities, Maximum Likelihood and the EM Algorithm
Richard A. Redner, Homer F. Walker · SIAM Review · 1984 · 2.7K citations