arrow
返回

Stochastic margin-based structure learning of Bayesian network classifiers

delete2013-02-01
delete21
delete
OA
AI
F
Franz Pernkopf *
DOI:10.1016/j.patcog.2012.08.007delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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.
Keyword:
Bayesian network classifier
Discriminative learning
Maximum margin learning
Structure learning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

G
Graz University of Technology
学者数:
6.7K
论文数: 6.3K
被引数: 8.5K
引用论文

引用论文

Bayesian network classifiers贝叶斯网络分类器
err1997-01-01
err3.8K
errOAAI
errFriedman, N; Geiger, D; Goldszmidt, M
err分享
err收藏
err分享
err收藏
学者 查看更多内容