Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Наївний Байєс× | Дерево рішень× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1997 | 1984 |
| Автор методу≠ | Mitchell, T. M. (textbook treatment) | Breiman, Friedman, Olshen & Stone |
| Тип≠ | Probabilistic classifier (Bayes' theorem with conditional independence) | Recursive partitioning (if-then rules) |
| Основоположне джерело≠ | Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072 | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| Інші назви | Naive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| Пов'язані≠ | 4 | 5 |
| Підсумок≠ | Naive Bayes is a fast probabilistic classifier that applies Bayes' theorem while assuming that the features are conditionally independent given the class — a method given its standard machine-learning treatment in Tom Mitchell's 1997 textbook Machine Learning. Despite this simplifying ('naive') assumption, it is quick to train and often surprisingly accurate. | A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf. |
| ScholarGateНабір даних ↗ |
|
|