Bayesiansk K-means-clustering
Bayesiansk K-means-clustering udvider den klassiske K-means-algoritme ved at placere prior-fordelinger over klyngecentrer og blandingsandele. Dette probabilistiske rammeværk giver usikkerhedsestimater for klyngetildelinger, muliggør principiel modelvalg for antallet af klynger og regulariserer estimering af klyngecentre – især værdifuldt, når data er sparsomme eller højdimensionelle.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- Kulis, B. & Jordan, M. I. (2012). Revisiting k-means: New algorithms via Bayesian nonparametrics. In Proceedings of the 29th International Conference on Machine Learning (ICML), Edinburgh, Scotland, pp. 513–520. link ↗
- Bishop, C. M. (2006). Pattern Recognition and Machine Learning. Springer. Chapter 9 (Mixture models and EM) and Chapter 10 (Approximate Inference). ISBN: 978-0387310732
Sådan citerer du denne side
ScholarGate. (2026, June 3). Bayesian K-means Clustering. ScholarGate. https://scholargate.app/da/statistics/bayesian-k-means-clustering
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Bayesiansk klyngeanalyseStatistik↔ compare
- Bayesiansk hierarkisk klyngedannelse (BHC)Statistik↔ compare
- Bayesiansk mixturemodelleringStatistik↔ compare
- KlyngeanalyseStatistik↔ compare
- Latent Class Analysis (LCA)Statistik↔ compare
- MixturmodelleringStatistik↔ compare
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →