Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0972.62001
Geng, Zhi; Wan, Kang; Tao, Feng
Mixed graphical models with missing data and the partial imputation EM algorithm.
(English)
[J] Scand. J. Stat. 27, No.3, 433-444 (2000). ISSN 0303-6898; ISSN 1467-9469/e

The following model is considered. Let $G =(V, E)$ denote a graph, where $E$ is the set of edges, $V$ the set of vertices, and $V$ is partitioned as $V = \Delta \cup \Gamma$ into a dot set $\Delta$ and a circle set $F.$ A dot denotes a discrete variable and a circle denotes a continuous variable. Thus the random variables are $X_V = (X_v)_{v\in V}.$ The absence of an edge between a pair of vertices means that the corresponding variable pair is independent conditionally on the other variables which is the pairwise Markov property with respect to $G.$ The authors use a set of hyperedges to represent an observed data pattern. A normal graph represents a graphical model and a hypergraph represents an observed data pattern.\par In terms of mixed graphs the decomposition of mixed graphical models with incomplete date is discussed. The authors present a partial imputation method which can be used in the EM algorithm and the Gibbs sampler to speed up their convergence. For a given mixed graphical model and an observed data pattern a large graph decomposes into several small ones so that the original likelihood can be factorized into a product of likelihoods with distinct parameters for small graphs. For the case where a graph cannot be decomposed due to its observed data pattern the authors impute missing data partially such that the graph can be decomposed.
[Yu.V.Kozachenko (Ky\" iv)]
MSC 2000:
*62-07 Data analysis (statistics)
05C90 Appl. of graph theory
62-09 Graphical methods in statistics
60E99 Distribution theory in probability theory

Keywords: conditional Gaussian distributions; decompositions; graphical models; missing data; maximum likelihood estimates

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster