Characteristic imsets for learning Bayesian network structure

被引:23
作者
Hemmecke, Raymond [2 ]
Lindner, Silvia [2 ]
Studeny, Milan [1 ]
机构
[1] ASCR, Inst Informat Theory & Automat, Prague, Czech Republic
[2] Tech Univ Munich, Zentrum Math, Munich, Germany
关键词
Learning Bayesian network structure; Essential graph; Standard imset; Characteristic imset; LP relaxation of a polytope; MARKOV EQUIVALENCE;
D O I
10.1016/j.ijar.2012.04.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The motivation for the paper is the geometric approach to learning Bayesian network (BN) structure. The basic idea of our approach is to represent every BN structure by a certain uniquely determined vector so that usual scores for learning BN structure become affine functions of the vector representative. The original proposal from Studeny et al. (2010) [26] was to use a special vector having integers as components, called the standard imset, as the representative. In this paper we introduce a new unique vector representative, called the characteristic imset, obtained from the standard imset by an affine transformation. Characteristic imsets are (shown to be) zero-one vectors and have many elegant properties, suitable for intended application of linear/integer programming methods to learning BN structure. They are much closer to the graphical description; we describe a simple transition between the characteristic imset and the essential graph, known as a traditional unique graphical representative of the BN structure. In the end, we relate our proposal to other recent approaches which apply linear programming methods in probabilistic reasoning. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:1336 / 1349
页数:14
相关论文
共 31 条
  • [1] Andersson SA, 1997, ANN STAT, V25, P505
  • [2] Andersson SA, 1997, SCAND J STAT, V24, P81
  • [3] [Anonymous], 2004, Learning Bayesian Networks
  • [4] [Anonymous], 2011, P C UNCERTAINTY ARTI
  • [5] Bouckaert R. R., 1995, THESIS U UTRECHT
  • [6] Bouckaert R, 2010, J MACH LEARN RES, V11, P3453
  • [7] Chickering D. M., 2003, Journal of Machine Learning Research, V3, P507, DOI 10.1162/153244303321897717
  • [8] APPROXIMATING DISCRETE PROBABILITY DISTRIBUTIONS WITH DEPENDENCE TREES
    CHOW, CK
    LIU, CN
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (03) : 462 - +
  • [9] de Campos C, 2009, P 26 INT C MACH LEAR, P113
  • [10] de Campos CP, 2011, J MACH LEARN RES, V12, P663