Cited by 4,742Bayesian Modeling and Causal InferenceData Mining and Machine Learning ApplicationsText and Document Classification Technologies

Bayesian network classifiers

Open access
Friedman, Nir, Geiger, Dan, Goldszmidt, Moises·1997·Machine Learning

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1023/a:1007465528199

Cites

63 of 63 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The Naïve Bayes classifier, which makes strong assumptions about feature independence, is competitive with state-of-the-art classifiers such as C4.5.

    “Recent work in supervised learning has demonstrated that a surprisingly simple Bayesian classifier called NB, which makes strong assumptions about feature independence, is competitive with state-of-the-art classifiers such as C4.5.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. Bouckaert, R. R. (1994). Properties of Bayesian network learning algorithms. In R. López de Mantarás & D. Poole (Eds.), Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (pp. 102-109).
  2. Friedman, N. & M. Goldszmidt (1996b). Discretization of continuous attributes while learning Bayesian networks. In L. Saitta (Ed.), Proceedings of the Thirteenth International Conference on Machine Learning (pp. 157-165).

Cited by

Sorted by citations

Authors
Friedman, N., Geiger, D., & Goldszmidt, M.
Affiliations
  • University of California, Berkeley (US)
  • Technion – Israel Institute of Technology (IL)
Venue
Machine Learning
Published
1997-11
Volume
29
Issue
2-3
Pages
131-163
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W1817561967
Cited by
4,742
References
63
Citations by year
2026: 91 · 2025: 192 · 2024: 138 · 2023: 179 · 2022: 229 · 2021: 272 · 2020: 303 · 2019: 272 · 2018: 244 · 2017: 255 · 2016: 227 · 2015: 228 · 2014: 218 · 2013: 230 · 2012: 195
FWCI
22.24
Type
journal article
Language
en
Open access
Locations
Machine Learning (publishedVersion)
Funders
National Science Foundation (9503109)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
Keywords
Bayesian network classifiers, naive Bayes, tree augmented naive Bayes, feature independence assumption, classifier induction, supervised classification, C4.5 comparison, feature selection

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review