So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Perceptron đa lớp (MLP)× | Hồi quy Logistic× | Rừng ngẫu nhiên× | Mạng nơ-ron hồi quy× | |
|---|---|---|---|---|
| Lĩnh vực≠ | Học máy | Thống kê nghiên cứu | Học máy | Học sâu |
| Họ≠ | Machine learning | Process / pipeline | Machine learning | Machine learning |
| Năm ra đời≠ | 1986 | 1958 | 2001 | 1986–1990 |
| Người khởi xướng≠ | Rumelhart, D. E., Hinton, G. E., & Williams, R. J. | David Roxbee Cox | Breiman, L. | Rumelhart, D. E.; Elman, J. L. |
| Loại≠ | Feedforward neural network (supervised learning) | Method | Ensemble (bagging of decision trees) | Sequential neural network |
| Công trình gốc≠ | Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986). Learning representations by back-propagating errors. Nature, 323, 533–536. DOI ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Elman, J. L. (1990). Finding structure in time. Cognitive Science, 14(2), 179–211. DOI ↗ |
| Tên gọi khác≠ | MLP, feedforward neural network, fully connected neural network, artificial neural network | logit model, binomial logistic regression, LR | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | RNN, Elman network, Jordan network, simple recurrent network |
| Liên quan≠ | 4 | 3 | 4 | 3 |
| Tóm tắt≠ | The Multi-layer Perceptron (MLP) is a feedforward neural network architecture trained by backpropagation, formalised by Rumelhart, Hinton, and Williams in their landmark 1986 Nature paper. Composed of an input layer, one or more hidden layers of neurons with nonlinear activation functions, and an output layer, the MLP can approximate any continuous function to arbitrary accuracy and serves as the conceptual bridge between classical machine learning and modern deep learning. | Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science. | 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. | A Recurrent Neural Network (RNN) is a class of neural network designed to process sequential data by maintaining a hidden state that carries information across time steps. Introduced in its modern form by Rumelhart et al. (1986) and further shaped by Elman (1990), RNNs became the dominant architecture for sequence modelling in NLP, speech, and time-series analysis before the rise of attention-based models. |
| ScholarGateBộ dữ liệu ↗ |
|
|
|
|