Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Объяснимый наивный Байес× | Дерево решений× | Наивный Байес× | |
|---|---|---|---|
| Область | Машинное обучение | Машинное обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning | Machine learning |
| Год появления≠ | 1950s (Naive Bayes); 2000s–2010s (explainability focus) | 1984 | 1997 |
| Автор метода≠ | Zhang, H. (explainability framing); Naive Bayes: Good, I. J. | Breiman, Friedman, Olshen & Stone | Mitchell, T. M. (textbook treatment) |
| Тип≠ | Probabilistic generative classifier with intrinsic explainability | Recursive partitioning (if-then rules) | Probabilistic classifier (Bayes' theorem with conditional independence) |
| Основополагающий источник≠ | Rish, I. (2001). An empirical study of the naive Bayes classifier. In IJCAI Workshop on Empirical Methods in AI (pp. 41–46). link ↗ | 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 |
| Другие названия≠ | XNB, interpretable Naive Bayes, transparent Naive Bayes, explainable probabilistic classifier | 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 |
| Связанные≠ | 4 | 5 | 4 |
| Сводка≠ | Explainable Naive Bayes extends the classic probabilistic Naive Bayes classifier with transparent, human-readable explanations of its predictions. By surfacing class priors, per-feature likelihoods, and log-odds contributions, it offers the interpretability demanded in high-stakes domains such as medicine, law, and education without sacrificing the simplicity and speed that make Naive Bayes a reliable baseline. | 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. |
| ScholarGateНабор данных ↗ |
|
|
|