Learning Bayesian network classifiers by maximizing conditional likelihood
By Daniel Grossman, Pedro M. Domingos. International Conference on Machine Learning, 2004
341 citations recorded by the source corpus.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/ead0146aead8ad40b033137278e04c8cbda7de05
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Luc De Raedt
- Kristian Kersting
- Zhihua Cai
- Niels Landwehr
- Mark W. Schmidt
- glenn. fung
- Rómer Rosales
- Vasant G Honavar
Citations in the corpus
- Structure learning in random fields for heart motion abnormality detection (2008, background): “[9] (D ,D ,N) Greedy DAG Search [10] (D ,D ,N) Exhaustive search [26] (D ,U/D,N) Submod-supermod opt.”
- Discriminatively trained Markov model for sequence classification (2005, background): “Grossman and Domingos [10] have described an approach for learning parameters that maximize conditional likelihood function in Bayesian Networks instead of the likelihood function.”
- A Novel Bayes Model: Hidden Naive Bayes (2009, methodology): “For class probability estimation, conditional log likelihood (CLL) has been recently used to evaluate the quality of class probability estimation yielded by a classifier [8].”
- nFOIL: Integrating Naïve Bayes and FOIL (2005, background): “A similar problem also arises in Bayesian Network structure learning (Grossman & Domingos 2004).”