Return
Stochastic margin-based structure learning of Bayesian network classifiers
DOI:10.1016/j.patcog.2012.08.007.png)
Abstract
En 中文
The margin criterion for parameter learning in graphical models gained significant impact over the last years. We use the maximum margin score for discriminatively optimizing the structure of Bayesian network classifiers. Furthermore, greedy hill-climbing and simulated annealing search heuristics are applied to determine the classifier structures. In the experiments, we demonstrate the advantages of maximum margin optimized Bayesian network structures in terms of classification performance compared to traditionally used discriminative structure learning methods. Stochastic simulated annealing requires less score evaluations than greedy heuristics. Additionally, we compare generative and discriminative parameter learning on both generatively and discriminatively structured Bayesian network classifiers. Margin-optimized Bayesian network classifiers achieve similar classification performance as support vector machines. Moreover, missing feature values during classification can be handled by discriminatively optimized Bayesian network classifiers, a case where purely discriminative classifiers usually require mechanisms to complete unknown feature values in the data first. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Bayesian network classifier
Discriminative learning
Maximum margin learning
Structure learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers
MACHINE LEARNING
IF2.9
Distribution of Cd, Pb and Cu between dissolved fraction, inorganic particulate and phytoplankton in seawater of Terra Nova Bay (Ross Sea, Antarctica) during austral summer 2011–12
Chemosphere
IF0

