Stochastic margin-based structure learning of Bayesian network classifiers

详细信息    查看全文

• 作者：Franz Pernkopf ; Michael Wohlmayr
• 关键词：Bayesian network classifier ; Discriminative learning ; Maximum margin learning ; Structure learning
• 刊名：Pattern Recognition
• 出版年：2013
• 出版时间：February, 2013
• 年：2013
• 卷：46
• 期：2
• 页码：464-471
• 全文大小：5784 K

文摘

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.