Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Багатошаровий перцептрон (БШП)× | Випадковий ліс× | |
|---|---|---|
| Галузь≠ | Глибоке навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1986 | 2001 |
| Автор методу≠ | Rumelhart, D. E.; Hinton, G. E.; Williams, R. J. | Breiman, L. |
| Тип≠ | Supervised feedforward neural network | Ensemble (bagging of decision trees) |
| Основоположне джерело≠ | Rumelhart, D. E., Hinton, G. E. & Williams, R. J. (1986). Learning representations by back-propagating errors. Nature, 323, 533–536. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Інші назви≠ | MLP, feedforward neural network, fully connected neural network, vanilla neural network | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Пов'язані | 4 | 4 |
| Підсумок≠ | A Multilayer Perceptron is a classic fully connected feedforward neural network trained with the backpropagation algorithm, as formalised by Rumelhart, Hinton & Williams in their landmark 1986 Nature paper. Composed of an input layer, one or more hidden layers of neurons, and an output layer, the MLP learns nonlinear mappings from input features to target outputs and serves as the foundational building block of modern deep learning. | 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. |
| ScholarGateНабір даних ↗ |
|
|