Uwekaji K-Means Ulioimarishwa
Uwekaji K-Means Ulioimarishwa unapanua uwekaji wa kawaida wa k-means kwa kuongeza muda wa adhabu — kwa kawaida kizuizi cha L1 (aina ya lasso) au L2 — kwenye kigezo cha lengo. Hii inazuia suluhisho za makundi zinazoharibika na, katika lahaja iliyojaa iliyoletwa na Witten na Tibshirani (2010), huchagua vipengele vinavyoendesha utengano wa makundi, na kuifanya kuwa muhimu sana katika mipangilio yenye vipimo vingi ambapo vipengele vingi havihusiani.
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
- Witten, D. M., & Tibshirani, R. (2010). A framework for feature selection in clustering. Journal of the American Statistical Association, 105(490), 713–726. DOI: 10.1198/jasa.2010.tm09415 ↗
- K-means clustering. Wikipedia. link ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Regularized K-Means Clustering. ScholarGate. https://scholargate.app/sw/machine-learning/regularized-k-means
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.
- Uainishaji wa K-meansUjifunzaji wa Mashine↔ compare
- Muundo wa Gaussian Mixture UlioimarishwaUjifunzaji wa Mashine↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →