ScholarGate
Asistents

Salīdzināt metodes

Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.

Skaidrojams Naive Bayes×Koku lēmumu pieņemšana (Decision Tree)×Naive Bayes×
NozareMašīnmācīšanāsMašīnmācīšanāsMašīnmācīšanās
SaimeMachine learningMachine learningMachine learning
Izcelsmes gads1950s (Naive Bayes); 2000s–2010s (explainability focus)19841997
AutorsZhang, H. (explainability framing); Naive Bayes: Good, I. J.Breiman, Friedman, Olshen & StoneMitchell, T. M. (textbook treatment)
TipsProbabilistic generative classifier with intrinsic explainabilityRecursive partitioning (if-then rules)Probabilistic classifier (Bayes' theorem with conditional independence)
PirmavotsRish, 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
Citi nosaukumiXNB, interpretable Naive Bayes, transparent Naive Bayes, explainable probabilistic classifierKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeNaive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes
Saistītās454
KopsavilkumsExplainable 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.
ScholarGateDatu kopa
  1. v1
  2. 2 Avoti
  3. PUBLISHED
  1. v1
  2. 1 Avoti
  3. PUBLISHED
  1. v1
  2. 1 Avoti
  3. PUBLISHED

Doties uz meklēšanu Lejupielādēt slaidus

ScholarGateSalīdzināt metodes: Explainable Naive Bayes · Decision Tree · Naive Bayes. Izgūts 2026-06-20 no https://scholargate.app/lv/compare