The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Learning Bayesian network classifiers by maximizing conditional likelihood
Abstract
Bayesian networks are a powerful probabilistic representation, and their use for classification has received considerable attention. However, they tend to perform poorly when learned in the standard way. This is attributable to a mismatch between the objective function used (likelihood or a function thereof) and the goal of classification (maximizing accuracy or conditional likelihood). Unfortunately, the computational cost of optimizing structure and parameters for conditional likelihood is prohibitive. In this paper we show that a simple approximation— choosing structures by maximizing conditional likelihood while setting parameters by maximum likelihood—yields good results. On a large suite of benchmark datasets, this approach produces better class probability estimates than naive Bayes, TAN, and generatively-trained Bayesian networks. 1.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
(1988) · Cited by 16,582
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742 · cited 13×
“In experimental tests, BNC, the resulting classifier, produced better class probability estimates than maximum-likelihood approaches such as naive Bayes and TAN.”
BackgroundMethodInfluentialCausation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2748-9 · Cited by 4,617
A Bayesian method for the induction of probabilistic networks from data
Cooper, G. F., & Herskovits, E. (1992) · Machine Learning · doi:10.1007/bf00994110 · Cited by 4,204
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Self-citation(2001) · Cited by 1,932
Approximating discrete probability distributions with dependence trees
Chow, C., & Liu, C. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054142 · Cited by 1,720
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250 · cited 1×
“For example, we may wish to rank cases by probability of class membership (Provost & Domingos, 2003), or the costs associated with incorrect predictions may be variable and not known precisely at learning time (Provost & Fawcett, 2001).”
BackgroundOn Bias, Variance, 0/1—Loss, and the Curse-of-Dimensionality
Friedman, J. H. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009778005914 · Cited by 1,040
LEARNING BAYESIAN BELIEF NETWORKS: AN APPROACH BASED ON THE MDL PRINCIPLE
Lam, W., & Bacchus, F. (1994) · Computational Intelligence · doi:10.1111/j.1467-8640.1994.tb00166.x · Cited by 758
Tree Induction for Probability-Based Ranking
Provost, F., & Domingos, P. (2003) · Machine Learning · doi:10.1023/a:1024099825458 · Cited by 541
Self-citationEfficient Approximations for the Marginal Likelihood of Bayesian Networks with Hidden Variables
Maxwell Chickering, D., & Heckerman, D. (1997) · Machine Learning · doi:10.1023/a:1007469629108 · Cited by 292
Maximum Entropy Discrimination
Jebara, T. (2004) · Springer eBooks · doi:10.1007/978-1-4419-9011-2_3 · Cited by 252
Keogh, E., & Pazzani, M. J. (1999) · Cited by 204
Discriminative vs informative learning
Rubinstein, Y. D., & Hastie, T. (1997) · Cited by 190
Bayesian networks for knowledge discovery
Heckerman, D. E. (1996) · Knowledge Discovery and Data Mining · Cited by 147
Greiner, R., Su, X., Shen, B., & Zhou, W. J. (2005) · Machine Learning · doi:10.1007/s10994-005-0469-0 · Cited by 137
Greiner, R., & Zhou, W. J. (2002) · doi:10.5555/777092.777121 · Cited by 87
Maximum Conditional Likelihood via Bound Maximization and the CEM Algorithm
Jebara, T., & Pentland, A. (1998) · Cited by 65
Cited by
A Novel Bayes Model: Hidden Naive Bayes
Jiang, L., Zhang, H., & Cai, Z. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.234 · Cited by 358
A Correlation-Based Feature Weighting Filter for Naive Bayes
Jiang, L., Zhang, L., Li, C., & Wu, J. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2836440 · Cited by 268
Discrete Bayesian Network Classifiers: A Survey
Bielza, C., & Larrañaga, P. (2014) · ACM Computing Surveys · doi:10.1145/2576868 · Cited by 248
Al-Shaboti, M., Chen, A., & Welch, I. (2019) · 2019 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/13th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE) · doi:10.1109/trustcom/bigdatase.2019.00111 · Cited by 12
Metadata
- Authors
- Grossman, D., & Domingos, P.
- Venue
- Twenty-first international conference on Machine learning - ICML '04
- Publisher
- ACM Press
- Published
- 2004
- Pages
- 46
- OpenAlex
- W2137587467
- Cited by
- 299
- References
- 27
- FWCI
- 11.93
- 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
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.