Upangaji wa Uenezaji wa Ukaribu
Uenezaji wa ukaribu, ulioanzishwa na Brendan Frey na Delbert Dueck mwaka 2007, ni algorithm ya upangaji ambayo hutambua 'waakilishi' miongoni mwa data kwa kubadilishana jumbe kati ya kila jozi ya vipengele hadi seti thabiti ya makundi itakapotokea. Tofauti na k-means haihitaji idadi ya makundi kuainishwa mapema—idadi hiyo hutokana na data na kigezo cha 'upendeleo'—na hufanya kazi moja kwa moja kutoka kwa ufanano wa jozi, ambao hauhitaji kuwa kipimo.
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
- Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315(5814), 972–976. DOI: 10.1126/science.1136800 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). Affinity Propagation Clustering. ScholarGate. https://scholargate.app/sw/machine-learning/affinity-propagation
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
- Ngeli ya Kiwango cha Juu (Hierarchical Clustering)Ujifunzaji wa Mashine↔ compare
- K-Means ClusteringUjifunzaji wa Mashine↔ compare
- Ukusanyaji wa Kikundi kwa Njia ya Spektra (Spectral Clustering)Ujifunzaji wa Mashine↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →