Discriminative parameter learning for Bayesian networks
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Bayesian network classifiers have been widely used for classification problems. Given a fixed Bayesian network structure, parameters learning can take two different approaches: generative and discriminative learning. While generative parameter learning is more efficient, discriminative parameter learning is more effective. In this paper, we propose a simple, efficient, and effective discriminative parameter learning method, called Discriminative Frequency Estimate (DFE), which learns parameters by discriminatively computing frequencies from data. Empirical studies show that the DFE algorithm integrates the advantages of both generative and discriminative learning: it performs as well as the state-of-the-art discriminative parameter learning method ELR in accuracy, but is significantly more efficient.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
Cited by
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750
“• Discriminative multinomial naive Bayes [30]: a simple Bayesian classifier with discriminative parameter learning for text categorization.”
OpenEAR — Introducing the munich open-source emotion and affect recognition toolkit
Eyben, F., Wollmer, M., & Schuller, B. (2009) · 2009 3rd International Conference on Affective Computing and Intelligent Interaction and Workshops · doi:10.1109/acii.2009.5349350 · Cited by 418
“We further plan to implement Discriminant Multinomial Naive Bayes [12] and Long Short-Term Memory Recurrent Neural Networks [5].”
MethodDeep feature weighting for naive Bayes and its application to text classification
Jiang, L., Li, C., Wang, S., & Zhang, L. (2016) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2016.02.002 · Cited by 327
Discrete Bayesian Network Classifiers: A Survey
Bielza, C., & Larrañaga, P. (2014) · ACM Computing Surveys · doi:10.1145/2576868 · Cited by 248
“Going through all the training data, the update at iteration t 1 consists of summing, for each instance x , the difference between the true posterior probability | t ( t + 1) ijk ( t ) ( c t approach was proposed in Su et al. [2008] and named frequency estimate (DFE).”
MethodA new algorithm for reducing the workload of experts in performing systematic reviews
Matwin, S., Kouznetsov, A., Inkpen, D., Frunza, O., & O'Blenis, P. (2010) · Journal of the American Medical Informatics Association · doi:10.1136/jamia.2010.004325 · Cited by 100
“15 Moreover, SVM parameters require understanding of the SVM algorithm d for example, the choice of the kernel or the setting of the slack parameters coef fi cient d whereas the parameters of Bayesian classi fi ers are based on the properties of the data d for example, the importance of individual…”
BackgroundMethodSelf-citation
Metadata
- Authors
- Su, J., Zhang, H., Ling, C. X., & Matwin, S.
- Venue
- Proceedings of the 25th international conference on Machine learning - ICML '08
- Publisher
- ACM Press
- Published
- 2008
- Pages
- 1016-1023
- OpenAlex
- W2121360488
- Cited by
- 115
- References
- 1
- FWCI
- 6.45
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Discriminative parameter learning for Bayesian networks. https://app.cochat.ai/papers/10.1145/1390156.1390284
- The paper
- Su, J., Zhang, H., Ling, C. X., & Matwin, S. (2008). Discriminative parameter learning for Bayesian networks. Proceedings of the 25th international conference on Machine learning - ICML '08. https://doi.org/10.1145/1390156.1390284
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.