Graphical and algebraic representatives of conditional independence models

MaRDI QIDQ3595870zbMATH OpenFDO

Authors Jiří Vomlel, Milan Studený

Publication date 28 August 2007

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• On stochastic conditional independence: The problems of characterization and description
• scientific article; zbMATH DE number 2150792
• On chain graph models for description of conditional independence structures
• DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts¹
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS

Cited in

(12)

• Towards standard imsets for maximal ancestral graphs
• A conditional independence algorithm for learning undirected graphical models
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• On stochastic conditional independence: The problems of characterization and description
• A reconstruction algorithm for the essential graph
• Graphical models
• The characteristic imset polytope of Bayesian networks with ordered nodes
• Standard imsets for undirected and chain graphical models
• Algorithmic barriers to representing conditional independence
• An empirical comparison of popular structure learning algorithms with a view to gene network inference
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts¹

This page was built for publication: Graphical and algebraic representatives of conditional independence models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595870)