Mean Shift
Mean Shift ni algoriti isiyo ya kiparameta, inayorudia-rudia kutafuta kilele inayobainisha makundi kama vilele vya utendakazi wa msongamano wa uwezekano ulio chini yake. Hapo awali ilianzishwa na Fukunaga na Hostetler (1975) kwa ajili ya kukadiria mteremko katika utambuzi wa ruwaza, ilipanuliwa na kuenezwa sana na Comaniciu na Meer (2002) kwa uchambuzi thabiti wa nafasi ya vipengele na ugawaji wa picha. Tofauti na k-means, Mean Shift haihitaji ubainishaji wa awali wa idadi ya makundi, ikitoa muundo wa makundi kabisa kutokana na msongamano wa data.
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
- Fukunaga, K. & Hostetler, L. D. (1975). The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Transactions on Information Theory, 21(1), 32–40. DOI: 10.1109/TIT.1975.1055330 ↗
- Comaniciu, D. & Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5), 603–619. DOI: 10.1109/34.1000236 ↗
- Hastie, T., Tibshirani, R. & Friedman, J. (2009). The Elements of Statistical Learning (2nd ed., Ch. 14). Springer. ISBN: 978-0-387-84858-7
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Mean Shift Clustering and Mode-Seeking Algorithm. ScholarGate. https://scholargate.app/sw/machine-learning/mean-shift
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
- Uainishaji wa K-meansUjifunzaji 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 →