BIRCH — Balansirano iterativno smanjivanje i klasterovanje pomoću hijerarhija
BIRCH je skalabilni, inkrementalni algoritam klasterovanja koji su uveli Zhang, Ramakrishnan i Livny 1996. godine. Dizajniran je za klasterovanje veoma velikih skupova podataka — potencijalno većih od dostupne memorije — u jednom prolazu, kompresijom podataka u kompaktnu strukturu sažetka u memoriji pod nazivom CF-drvo (Clustering Feature tree), pre primene bilo kog standardnog postupka klasterovanja.
Pročitajte celu metodu
Prijavite se besplatnim nalogom da biste pročitali ovaj odeljak.
Method map
The neighbourhood of related methods — select a node to explore.
Izvori
- Zhang, T., Ramakrishnan, R., & Livny, M. (1996). BIRCH: An efficient data clustering method for very large databases. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 25(2), 103–114. DOI: 10.1145/233269.233324 ↗
- Han, J., Kamber, M., & Pei, J. (2011). Data Mining: Concepts and Techniques (3rd ed., Ch. 10). Morgan Kaufmann. ISBN: 978-0-12-381479-1
Kako citirati ovu stranicu
ScholarGate. (2026, June 3). Balanced Iterative Reducing and Clustering using Hierarchies. ScholarGate. https://scholargate.app/sr/machine-learning/birch
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.
- DBSCANMašinsko učenje↔ compare
- K-means algoritam klasterovanjaMašinsko učenje↔ compare
Uočili ste grešku na ovoj stranici? Prijavite je ili predložite ispravku →