BIRCH — Usanifu wa Kupunguza na Kuunganisha kwa Misingi ya Mihimili Iliyoimarishwa
BIRCH ni algorithmu ya kuunganisha inayoweza kuongezeka, inayoongezeka iliyoanzishwa na Zhang, Ramakrishnan, na Livny mwaka 1996. Imeundwa kuunganisha seti kubwa sana za data — zinazoweza kuwa kubwa kuliko kumbukumbu inayopatikana — katika pasi moja, kwa kukandamiza data kuwa muundo mfupi wa muhtasari wa ndani ya kumbukumbu unaoitwa mti wa CF (mti wa Kipengele cha Kuunganisha) kabla ya kutumia utaratibu wowote wa kawaida wa kuunganisha.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- 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
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Balanced Iterative Reducing and Clustering using Hierarchies. ScholarGate. https://scholargate.app/sw/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.
- DBSCANUjifunzaji wa Mashine↔ compare
- Uainishaji wa K-meansUjifunzaji wa Mashine↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →