Discovery of context-specific Markov blankets

被引：2

作者：

Klein, A ^{[1
]}

Shimony, SE ^{[1
]}

机构：

[1] Ben Gurion Univ Negev, Dept Math, Beer Sheva, Israel

来源：

2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7 | 2004年

关键词：

data alining; Alarkov blankets; Bayesian networks; Bayesian knowledge bases; context specific independence;

D O I：

10.1109/ICSMC.2004.1400942

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The notion of Context-Specific Markov Blankets (CSMB) is a refinement of Markov Blankets (MB). An important property of context specific Markov-Blankets is that in the worst case they need as many parameters as a model using a standard Markov blanket, but frequently considerably fewer. The result is expected to be a much improved probabilistic model of the data in practice. An algorithm for discovery of the CSMB is presented, and empirical results show that it is capable of successfully recovering context specific ("local") structures.

引用

页码：3833 / 3838

页数：6

共 14 条

[1] On learning read-k-satisfy-j DNF [J].

Aizenstein, H ;

Blum, A ;

Khardon, R ;

Kushilevitz, E ;

Pitt, L ;

Roth, D .

SIAM JOURNAL ON COMPUTING, 1998, 27 (06) :1515-1530

[2]

[Anonymous], P 12 C UNC ART INT S

[3] STOCHASTIC RELAXATION, GIBBS DISTRIBUTIONS, AND THE BAYESIAN RESTORATION OF IMAGES [J].

GEMAN, S ;

GEMAN, D .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (06) :721-741

[4]

GOLDSZMIDT M, 1996, P 12 ANN C UNC ART I, P115

[5]

MARGARITIS D, 1999, CMUCS99134

[6]

MASEK WJ, 1979, UNPUB SOME NP COMPLE

[7]

Pearl J., 1989, Probabilistic reasoning in intelligent systems: networks of plausible inference, DOI DOI 10.1016/C2009-0-27609-4

[8] PROBABILISTIC HORN ABDUCTION AND BAYESIAN NETWORKS [J].

POOLE, D .

ARTIFICIAL INTELLIGENCE, 1993, 64 (01) :81-129

[9]

QUINLAN J, 1996, P 12 INT C MACH LEAR, P236

[10]

ROSEN T, 2001, BAR S FDN ART INT

← 1 2 →