Negative binomial graphical model with excess zeros

Markov random field or undirected graphical models (GM) are a popular class of GM useful in various fields because they provide an intuitive and interpretable graph expressing the complex relationship between random variables. The zero‐inflated local Poisson graphical model has been proposed as a gr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Statistical analysis and data mining Ročník 14; číslo 5; s. 449 - 465
Hlavní autoři: Park, Beomjin, Choi, Hosik, Park, Changyi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.10.2021
Wiley Subscription Services, Inc
Témata:
Algorithms
Complex variables
count data
Dispersion
Fields (mathematics)
Markov random field
Optimization
over‐dispersion
Polytopes
Random variables
undirected graphical model
zero inflation
ISSN:1932-1864, 1932-1872
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Markov random field or undirected graphical models (GM) are a popular class of GM useful in various fields because they provide an intuitive and interpretable graph expressing the complex relationship between random variables. The zero‐inflated local Poisson graphical model has been proposed as a graphical model for count data with excess zeros. However, as count data are often characterized by over‐dispersion, the local Poisson graphical model may suffer from a poor fit to data. In this paper, we propose a zero‐inflated local negative binomial (NB) graphical model. Due to the dependencies of parameters in our models, a direct optimization of the objective function is difficult. Instead, we devise expectation‐minimization algorithms based on two different parametrizations for the NB distribution. Through a simulation study, we illustrate the effectiveness of our method for learning network structure from over‐dispersed count data with excess zeros. We further apply our method to real data to estimate its network structure.
Bibliografie:Funding information
University of Seoul, 2018 Research Fund
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-1864
1932-1872
DOI:10.1002/sam.11536