Expectation Maximization Clustering
The expectation maximization (EM) based clustering is a probabilistic method to partition data into clusters represented by model parameters. Extensions to the basic EM algorithm include but not limited to the stochastic EM algorithm (SEM), the simulated annealing EM algorithm (SAEM), and the Monte...
Saved in:
| Published in | Encyclopedia of Machine Learning and Data Mining pp. 480 - 482 |
|---|---|
| Main Authors | , |
| Format | Book Chapter |
| Language | English |
| Published |
Boston, MA
Springer US
2017
|
| Online Access | Get full text |
| ISBN | 9781489976857 148997685X |
| DOI | 10.1007/978-1-4899-7687-1_344 |
Cover
| Summary: | The expectation maximization (EM) based clustering is a probabilistic method to partition data into clusters represented by model parameters. Extensions to the basic EM algorithm include but not limited to the stochastic EM algorithm (SEM), the simulated annealing EM algorithm (SAEM), and the Monte Carlo EM algorithm (MCEM). |
|---|---|
| ISBN: | 9781489976857 148997685X |
| DOI: | 10.1007/978-1-4899-7687-1_344 |