SwePub - sökning: id:"swepub:oai:DiVA.org:kth-16...

Numrering	Referens	Omslagsbild	Hitta
1.	Pensar, Johan, et al. (författare) Labeled directed acyclic graphs : a generalization of context-specific independence in directed graphical models 2015 Ingår i: Data mining and knowledge discovery. - : Springer Science and Business Media LLC. - 1384-5810 .- 1573-756X. ; 29:2, s. 503-533 Tidskriftsartikel (refereegranskat)abstract We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for allowing local structures in the conditional probability distribution of a node, such that unrestricted label sets determine which edges can be deleted from the underlying directed acyclic graph (DAG) for a given context. Several properties of these models are derived, including a generalization of the concept of Markov equivalence classes. Efficient Bayesian learning of LDAGs is enabled by introducing an LDAG-based factorization of the Dirichlet prior for the model parameters, such that the marginal likelihood can be calculated analytically. In addition, we develop a novel prior distribution for the model structures that can appropriately penalize a model for its labeling complexity. A non-reversible Markov chain Monte Carlo algorithm combined with a greedy hill climbing approach is used for illustrating the useful properties of LDAG models for both real and synthetic data sets.

Pensar, Johan, et al. (författare)
Labeled directed acyclic graphs : a generalization of context-specific independence in directed graphical models
2015
Ingår i: Data mining and knowledge discovery. - : Springer Science and Business Media LLC. - 1384-5810 .- 1573-756X. ; 29:2, s. 503-533
Tidskriftsartikel (refereegranskat)abstract
- We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for allowing local structures in the conditional probability distribution of a node, such that unrestricted label sets determine which edges can be deleted from the underlying directed acyclic graph (DAG) for a given context. Several properties of these models are derived, including a generalization of the concept of Markov equivalence classes. Efficient Bayesian learning of LDAGs is enabled by introducing an LDAG-based factorization of the Dirichlet prior for the model parameters, such that the marginal likelihood can be calculated analytically. In addition, we develop a novel prior distribution for the model structures that can appropriately penalize a model for its labeling complexity. A non-reversible Markov chain Monte Carlo algorithm combined with a greedy hill climbing approach is used for illustrating the useful properties of LDAG models for both real and synthetic data sets.

Träfflista för sökning "id:"swepub:oai:DiVA.org:kth-161600" "