Graphical models: overview

作者: N. Wermuth , D.R. Cox

DOI: 10.1016/B0-08-043076-7/00440-X

关键词: SequenceChain (algebraic topology)Block (data storage)Markov modelEnhanced Data Rates for GSM EvolutionData analysisVariable (computer science)MathematicsDiscrete mathematicsTheoretical computer scienceGraphical model

摘要: Graphical Markov models provide a method of representing possibly complicated multivariate dependencies in such way that the general qualitative features can be understood, statistical independencies are highlighted, and some properties derived directly. Variables represented by nodes graph. Pairs may joined an edge. Edges directed if one variable is response to other considered as explanatory, but undirected variables on equal footing. Absence edge typically implies independence, conditional, or marginal depending kind The need for number types graph arises because it helpful represent different kinds dependence structures. Of special importance chain graphs which arranged sequence blocks, any block being footing, joint responses past jointly explanatory future considered. Some main systems outlined, recent research results sketched. Suggestions further reading given. As illustrative example, analysis data treatment chronic pain presented.

参考文章(6)
D. R. Cox, Nanny Wermuth, Linear Dependencies Represented by Chain Graphs Statistical Science. ,vol. 8, pp. 204- 218 ,(1993) , 10.1214/SS/1177010887
Milan Studený, Remco R. Bouckaert, On chain graph models for description of conditional independence structures Annals of Statistics. ,vol. 26, pp. 1434- 1495 ,(1998) , 10.1214/AOS/1024691250
J. N. Darroch, S. L. Lauritzen, T. P. Speed, Markov Fields and Log-Linear Interaction Models for Contingency Tables Annals of Statistics. ,vol. 8, pp. 522- 539 ,(1980) , 10.1214/AOS/1176345006
Thomas S. Richardson, Chain graphs and symmetric associations Proceedings of the NATO Advanced Study Institute on Learning in graphical models. pp. 231- 259 ,(1998) , 10.1007/978-94-011-5014-9_9