방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이지안 k-최근접 이웃× | 나이브 베이즈× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2002 | 1997 |
| 창시자≠ | Holmes, C. C. & Adams, N. M. | Mitchell, T. M. (textbook treatment) |
| 유형≠ | Probabilistic instance-based classifier | Probabilistic classifier (Bayes' theorem with conditional independence) |
| 원전≠ | Holmes, C. C., & Adams, N. M. (2002). A probabilistic nearest neighbour method for statistical pattern recognition. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 64(2), 295–306. DOI ↗ | Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072 |
| 별칭≠ | Bayesian KNN, BKNN, probabilistic k-nearest neighbors, Bayesian nearest-neighbor classifier | Naive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes |
| 관련≠ | 3 | 4 |
| 요약≠ | Bayesian k-Nearest Neighbors (Bayesian KNN) extends the classical KNN algorithm by placing a prior distribution over the neighborhood size k and combining likelihood evidence from neighbors with that prior to produce calibrated posterior class probabilities. It retains KNN's intuitive instance-based logic while adding principled uncertainty quantification over predictions. | 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데이터셋 ↗ |
|
|