Bayesian k-Means as a “Maximization-Expectation” Algorithm

DOI10.1162/neco.2008.12-06-421zbMath1178.68425OpenAlexW2023405098WikidataQ42611600 ScholiaQ42611600MaRDI QIDQ3616510

Kenichi Kurihara, Max Welling

Publication date: 25 March 2009

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco.2008.12-06-421

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

Tractable Bayesian density regression via logit stick-breaking priors ⋮ Also for \(k\)-means: more data does not imply better performance ⋮ Information-Maximization Clustering Based on Squared-Loss Mutual Information ⋮ Fast approximation of variational Bayes Dirichlet process mixture using the maximization-maximization algorithm ⋮ Cross-entropy clustering ⋮ \(K\)-means cloning: adaptive spherical \(K\)-means clustering ⋮ MAP approximation to the variational Bayes Gaussian mixture model and application

This page was built for publication: Bayesian k-Means as a “Maximization-Expectation” Algorithm