ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Επεξηγήσιμος Αφελής Bayes×Δέντρο Αποφάσεων×
ΠεδίοΜηχανική ΜάθησηΜηχανική Μάθηση
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης1950s (Naive Bayes); 2000s–2010s (explainability focus)1984
ΔημιουργόςZhang, H. (explainability framing); Naive Bayes: Good, I. J.Breiman, Friedman, Olshen & Stone
ΤύποςProbabilistic generative classifier with intrinsic explainabilityRecursive partitioning (if-then rules)
Θεμελιώδης πηγή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 ↗
Εναλλακτικές ονομασίεςXNB, interpretable Naive Bayes, transparent Naive Bayes, explainable probabilistic classifierKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
Συναφείς45
Σύνοψη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.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 1 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Explainable Naive Bayes · Decision Tree. Ανακτήθηκε στις 2026-06-18 από https://scholargate.app/el/compare