ScholarGate
Assistent
Latent structureMultivariate analysis

Bayesiansk K-means-klynging

Bayesiansk K-means-klynging utvider den klassiske K-means-algoritmen ved å plassere priorfordelinger over klyngesentre og blandingsproporsjoner. Dette probabilistiske rammeverket gir usikkerhetsestimater for klyngetildelinger, tillater prinsipiell modellvalg for antall klynger, og regulariserer senterestimering – spesielt verdifullt når data er knappe eller høy-dimensjonale.

Anvend med StatMindSnartVideoSnartDownload slides

Les hele metoden

Kun for medlemmer

Logg inn med en gratis konto for å lese denne delen.

Logg inn

Method map

The neighbourhood of related methods — select a node to explore.

Kilder

  1. 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
  2. Bishop, C. M. (2006). Pattern Recognition and Machine Learning. Springer. Chapter 9 (Mixture models and EM) and Chapter 10 (Approximate Inference). ISBN: 978-0387310732

Slik siterer du denne siden

ScholarGate. (2026, June 3). Bayesian K-means Clustering. ScholarGate. https://scholargate.app/no/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.

Compare side by side
ScholarGateBayesian K-means clustering (Bayesian K-means Clustering). Hentet 2026-06-15 fra https://scholargate.app/no/statistics/bayesian-k-means-clustering · Datasett: https://doi.org/10.5281/zenodo.20539026