Support Vector Machine yenye Regulareshini
Support Vector Machine yenye Regulareshini (Regularized SVM) huipanua SVM ya kawaida kwa kudhibiti kwa uwazi mabadilishano kati ya kuongeza kiwango cha juu cha akiba na makosa ya mafunzo kupitia kigezo cha adhabu cha L1 au L2. Muundo wa akiba laini (soft-margin) ulioanzishwa na Cortes na Vapnik mwaka 1995, wenyewe ni mfumo wenye regulareshini, na baadaye aina za L1-SVM huongeza upungufu wa vipengele, kuwezesha uteuzi wa kiotomatiki wa vigezo katika mipangilio yenye vipimo vingi.
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
- Cortes, C. & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273–297. DOI: 10.1007/BF00994018 ↗
- Zhu, J., Rosset, S., Tibshirani, R. & Hastie, T. (2004). 1-norm support vector machines. Advances in Neural Information Processing Systems (NIPS), 16. link ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Regularized Support Vector Machine (L1/L2-penalized SVM). ScholarGate. https://scholargate.app/sw/machine-learning/regularized-support-vector-machine
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.
- Lasso RegressionUjifunzaji wa Mashine↔ compare
- Uchambuzi wa Ubaguzi wa Laini (LDA)Ujifunzaji wa Mashine↔ compare
- Urejeshaji Linear UliodhibitiwaUjifunzaji wa Mashine↔ compare
- Usajili wa Usawazishaji wa UsawazishajiUjifunzaji wa Mashine↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →