Keywords
Classifier (UML)Quadratic classifierArtificial intelligenceBayesian probabilityA priori and a posterioriMathematicsMachine learningComputer scienceMargin classifierQuadratic equationPattern recognition (psychology)Algorithm
Affiliated Institutions
Related Publications
A Simple Relational Classifier
We analyze a Relational Neighbor (RN) classifier, a simple relational\npredictive model that predicts only based on class labels of related neighbors,\nusing no learning and no ...
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively new development. They provide an explanation of the performance of state-of-the-art learning syste...
Boosting the margin: a new explanation for the effectiveness of voting methods
One of the surprising recurring phenomena observed in experiments\nwith boosting is that the test error of the generated classifier usually does\nnot increase as its size become...
Experiments with a new boosting algorithm
In an earlier paper, we introduced a new "boosting" algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learni...
Boosting the margin: A new explanation for the effectiveness of voting methods
One of the surprising recurring phenomena observed in experiments with boosting is that the test error of the generated classifier usually does not increase as its size becomes ...
Publication Info
- Year
- 1997
- Type
- article
- Volume
- 29
- Issue
- 2-3
- Pages
- 103-130
- Citations
- 3013
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
3013
OpenAlex
Cite This
Pedro Domingos,
Michael J. Pazzani
(1997).
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss.
Machine Learning
, 29
(2-3)
, 103-130.
https://doi.org/10.1023/a:1007413511361
Identifiers
- DOI
- 10.1023/a:1007413511361