Módszerek összehasonlítása
Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.
| K-Legközelebbi szomszédok× | Support Vector Machine (Osztályozás)× | |
|---|---|---|
| Tudományterület | Gépi tanulás | Gépi tanulás |
| Módszercsalád | Machine learning | Machine learning |
| Keletkezés éve≠ | 1967 | 1995 |
| Megalkotó≠ | Cover, T.M. & Hart, P.E. | Cortes, C. & Vapnik, V. |
| Típus≠ | Instance-based (non-parametric) learning | Maximum-margin classifier (kernel method) |
| Alapmű≠ | Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| Alternatív nevek | KNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learning | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| Kapcsolódó | 5 | 5 |
| Összefoglaló≠ | K-Nearest Neighbors (KNN), formalized by Cover and Hart in 1967, is a non-parametric, instance-based method that classifies or predicts a new observation by looking at the k closest examples in the training data. For classification it takes a majority vote among those neighbors; for regression it averages their values. | The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data. |
| ScholarGateAdatkészlet ↗ |
|
|