方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 朴素贝叶斯 (Naive Bayes) 是一种快速的概率分类器,它应用贝叶斯定理,同时假设特征在给定类别时是条件独立的× | 逻辑回归× | 支持向量机(分类)× | |
|---|---|---|---|
| 领域≠ | 机器学习 | 研究统计学 | 机器学习 |
| 方法族≠ | Machine learning | Process / pipeline | Machine learning |
| 起源年份≠ | 1997 | 1958 | 1995 |
| 提出者≠ | Mitchell, T. M. (textbook treatment) | David Roxbee Cox | Cortes, C. & Vapnik, V. |
| 类型≠ | Probabilistic classifier (Bayes' theorem with conditional independence) | Method | Maximum-margin classifier (kernel method) |
| 开创性文献≠ | Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072 | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| 别名≠ | Naive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes | logit model, binomial logistic regression, LR | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| 相关≠ | 4 | 3 | 5 |
| 摘要≠ | 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. | Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science. | The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data. |
| ScholarGate数据集 ↗ |
|
|
|