ScholarGate
সহকারী

পদ্ধতির তুলনা করুন

নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।

ব্যাখ্যামূলক কে-নিয়ারেস্ট নেইবারস×নেইভ বেইজ×Random Forest×
ক্ষেত্রযন্ত্র শিখনযন্ত্র শিখনযন্ত্র শিখন
পরিবারMachine learningMachine learningMachine learning
উদ্ভবের বছর1967 (KNN); 2010s (explainability extensions)19972001
প্রবর্তকCover, T. & Hart, P. (KNN); XAI extensions by various authorsMitchell, T. M. (textbook treatment)Breiman, L.
ধরনInstance-based learning with explainability layerProbabilistic classifier (Bayes' theorem with conditional independence)Ensemble (bagging of decision trees)
মৌলিক উৎসCover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
অপর নামXKNN, Interpretable KNN, Explainable KNN, Transparent K-Nearest NeighborsNaive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive BayesRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
সম্পর্কিত444
সারসংক্ষেপExplainable K-Nearest Neighbors (XKNN) augments the classic KNN classifier or regressor with structured post-hoc or built-in explanation mechanisms, exposing which retrieved neighbors, which features, and which distance contributions drive each individual prediction — making the model's reasoning transparent and auditable for human decision-makers.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.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateডেটাসেট
  1. v1
  2. 2 উৎস
  3. PUBLISHED
  1. v1
  2. 1 উৎস
  3. PUBLISHED
  1. v1
  2. 2 উৎস
  3. PUBLISHED

অনুসন্ধানে যান স্লাইড ডাউনলোড করুন

ScholarGateপদ্ধতির তুলনা করুন: Explainable K-Nearest Neighbors · Naive Bayes · Random Forest. 2026-06-20 তারিখে সংগৃহীত, উৎস: https://scholargate.app/bn/compare