Bayesian k-Means as a "maximization-expectation" algorithm
We introduce a new class of "maximization-expectation" (ME) algorithms where we maximize over hidden variables but marginalize over random parameters. This reverses the roles of expectation and maximization in the classical expectation-maximization algorithm. In the context of clustering,...
Saved in:
| Published in: | Neural computation Vol. 21; no. 4; p. 1145 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
01.04.2009
|
| Subjects: | |
| ISSN: | 0899-7667 |
| Online Access: | Get more information |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!