BAYESIAN GRAPHICAL MODELS FOR DISCRETE-DATA

被引:560
作者
MADIGAN, D [1 ]
YORK, J [1 ]
机构
[1] PACIFIC NW LAB, RICHLAND, WA 99352 USA
关键词
BAYESIAN GRAPHICAL MODELS; DECOMPOSABLE MODELS; DIRECTED ACYCLIC GRAPHS; MARKOV CHAIN MONTE CARLO; MODEL AVERAGING; LOG LINEAR MODELS; CLOSED POPULATION ESTIMATION; DOUBLE SAMPLING;
D O I
10.2307/1403615
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
For more than half a century, data analysts have used graphs to represent statistical models, Pn particular, graphical ''conditional independence'' models have emerged as a useful class of models, Applications of such models to probabilistic expert systems, image analysis, and pedigree analysis have motivated much of this work, and several expository texts are now available. Rather less well known is the development of a Bayesian framework for such models, Expert system applications have motivated this work, where the promise of a model that can update itself as data become available, has generated intense interest from the artificial intelligence community, However, the application to a broader range of data problems has been largely overlooked. The purpose of this article is to show how Bayesian graphical models unify and simplify many standard discrete data problems such as Bayesian log linear modeling with either complete or incomplete data, closed population estimation, and double sampling, Since conventional model selection fails in these applications, we construct posterior distributions for quantities of interest by averaging across models, Specifically we introduce Markov chain Monte Carlo model composition, a Monte Carlo method for Bayesian model averaging.
引用
收藏
页码:215 / 232
页数:18
相关论文
共 43 条
[1]  
Bishop Y., 1975, DISCRETE MULTIVARIAT
[2]  
CARLSEN JC, 1994, UNPUB 2ND INT C MUS
[3]  
CHARNIAK E, 1991, AI MAG, V12, P50
[4]   A BAYESIAN METHOD FOR THE INDUCTION OF PROBABILISTIC NETWORKS FROM DATA [J].
COOPER, GF ;
HERSKOVITS, E .
MACHINE LEARNING, 1992, 9 (04) :309-347
[5]   LINEAR DEPENDENCIES REPRESENTED BY CHAIN GRAPHS [J].
COX, DR ;
WERMUTH, N .
STATISTICAL SCIENCE, 1993, 8 (03) :204-218
[6]  
Dawid A. P., 1992, Statistics and Computing, V2, P25, DOI 10.1007/BF01890546
[7]   HYPER MARKOV LAWS IN THE STATISTICAL-ANALYSIS OF DECOMPOSABLE GRAPHICAL MODELS [J].
DAWID, AP ;
LAURITZEN, SL .
ANNALS OF STATISTICS, 1993, 21 (03) :1272-1317
[8]   COVARIANCE SELECTION [J].
DEMPSTER, AP .
BIOMETRICS, 1972, 28 (01) :157-&
[10]  
EDWARDS D, 1990, J ROY STAT SOC B MET, V52, P3