Online K-means
Online K-means er en streaming-variant af den klassiske K-means-algoritme, der opdaterer klyngecentroider én observation ad gangen — eller i små mini-batches — uden at gemme hele datasættet i hukommelsen. Den er særligt velegnet til store, realtids- eller kontinuerligt ankommende data, hvor batch-genberegning ville være for langsom eller upraktisk.
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
- MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, pp. 281–297. University of California Press. link ↗
- Sculley, D. (2010). Web-scale k-means clustering. In Proceedings of the 19th International Conference on World Wide Web (WWW 2010), pp. 1177–1178. ACM. DOI: 10.1145/1772690.1772862 ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Online K-means Clustering (Sequential / Streaming K-means). ScholarGate. https://scholargate.app/da/machine-learning/online-k-means
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.
- DBSCANMaskinlæring↔ compare
- Hierarkisk grupperingMaskinlæring↔ compare
- K-Means ClusteringMaskinlæring↔ compare
- Self-Organizing Map (Kohonen Map)Maskinlæring↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →