Zapis dokaza metode
BIRCH
BIRCH is a scalable, incremental clustering algorithm introduced by Zhang, Ramakrishnan, and Livny in 1996. It is designed to cluster very large datasets — potentially larger than available memory — in a single pass, by compressing the data into a compact in-memory summary structure called a CF-tree (Clustering Feature tree) before applying any standard clustering procedure.
Izvorni zapis
Citati kopirani doslovno iz izvornog zapisa metode. Ne impliciraju nikakvu provjeru na razini tvrdnje.
Balanced Iterative Reducing and Clustering using Hierarchies
Taksonomski zapis metode · ml-model / machine-learning
- 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
Uređene tvrdnje
Tvrdnje pohranjene u knjigu dokaza, svaka s vlastitom procjenom.
Nema uređenih tvrdnji
Ovaj prikaz ne izmišlja procjenu tvrdnje kada knjiga dokaza nema nijednu.
Povezane metode
Generirano iz grafa metode i prikazano kao strojno predložene relacije — ne implicira se nikakva tvrdnja dokaza.