Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Автоэнкодер× | Случайный лес× | Метод опорных векторов (классификация)× | |
|---|---|---|---|
| Область≠ | Глубокое обучение | Машинное обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning | Machine learning |
| Год появления≠ | 2006 | 2001 | 1995 |
| Автор метода≠ | Hinton, G.E. & Salakhutdinov, R.R. | Breiman, L. | Cortes, C. & Vapnik, V. |
| Тип≠ | Neural network (encoder-decoder) | Ensemble (bagging of decision trees) | Maximum-margin classifier (kernel method) |
| Основополагающий источник≠ | Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| Другие названия | Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| Связанные≠ | 4 | 4 | 5 |
| Сводка≠ | An autoencoder is an encoder-decoder neural network, popularised by Hinton and Salakhutdinov in 2006, that compresses data into a low-dimensional latent code and then reconstructs it, enabling dimensionality reduction and anomaly detection. By learning to rebuild its own input through a narrow bottleneck, it discovers a compact representation of the data. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. | 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. |
| ScholarGateНабор данных ↗ |
|
|
|