Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Árvore de Decisão× | Naive Bayes× | |
|---|---|---|
| Área | Aprendizado de máquina | Aprendizado de máquina |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1984 | 1997 |
| Autor original≠ | Breiman, Friedman, Olshen & Stone | Mitchell, T. M. (textbook treatment) |
| Tipo≠ | Recursive partitioning (if-then rules) | Probabilistic classifier (Bayes' theorem with conditional independence) |
| Fonte seminal≠ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072 |
| Outros nomes | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Naive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes |
| Relacionados≠ | 5 | 4 |
| Resumo≠ | 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. | 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. |
| ScholarGateConjunto de dados ↗ |
|
|