scientific article; zbMATH DE number 2150792
From MaRDI portal
Publication:4663408
research expositioncharacterization and structure theoryprobability theory on algebraic and topological structures
Characterization and structure theory for multivariate probability distributions; copulas (62H05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Probability theory on algebraic and topological structures (60B99) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Artificial intelligence (68T99)
Recommendations
- On stochastic conditional independence: The problems of characterization and description
- Graphical and algebraic representatives of conditional independence models
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1
- scientific article; zbMATH DE number 1568691
- Logical and algorithmic properties of conditional independence and graphical models
- STRUCTURAL SEMIGRAPHOIDS1
- Exploiting independencies to compute semigraphoid and graphoid structures
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Logical and algorithmic properties of stable conditional independence
Cited in
(only showing first 100 items - show all)- Total positivity in exponential families with application to binary variables
- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
- scientific article; zbMATH DE number 2088048 (Why is no real title available?)
- Time-like Graphical Models
- Generative assignment flows for representing and learning joint distributions of discrete data
- Linear criterion for testing the extremity of an exact game based on its finest min-representation
- scientific article; zbMATH DE number 176091 (Why is no real title available?)
- Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
- Using multiobjective optimization to map the entropy region
- Towards standard imsets for maximal ancestral graphs
- A short note on decomposition and composition of knowledge
- On the finite and general implication problems of independence atoms and keys
- Inversion of Bayesian networks
- Unifying Markov properties for graphical models
- Towards scalable and data efficient learning of Markov boundaries
- Generalized Permutohedra from Probabilistic Graphical Models
- Core-based criterion for extreme supermodular functions
- Faithfulness and learning hypergraphs from discrete distributions
- On patterns of conditional independences and covariance signs among binary variables
- Graphical and algebraic representatives of conditional independence models
- Two operations of merging and splitting components in a chain graph
- Causal learning with Occam's razor
- Graphoid properties of concepts of independence for sets of probabilities
- Bayesian networks and knowledge structures in cognitive assessment: remarks on basic comparable aspects
- A geometric view on learning Bayesian network structures
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Algebraic structures in statistical methodology. Abstracts from the workshop held December 4--10, 2022
- On open questions in the geometric approach to structural learning Bayesian nets
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- Faithfulness of probability distributions and graphs
- Acyclic directed graphs representing independence models
- Complexity measurement of fundamental pseudo-independent models
- Logical and algorithmic properties of conditional independence and graphical models
- Logical and algorithmic properties of stable conditional independence
- scientific article; zbMATH DE number 4084634 (Why is no real title available?)
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- On stochastic conditional independence: The problems of characterization and description
- Conditional independence structure and its closure: inferential rules and algorithms
- Marginalization and conditioning for LWF chain graphs
- The geometry of gaussoids
- Greedy Causal Discovery Is Geometric
- An algorithm to find a perfect map for graphoid structures
- Inference of structures of models of probabilistic dependences from statistical data
- Conditional independence, conditional mixing and conditional association
- Conditional independence structures examined via minors
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- A reconstruction algorithm for the essential graph
- Chain graph models of multivariate regression type for categorical data
- Computation of conditional independence using cain polynomials
- A universal algebraic approach for conditional independence
- Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
- Contribution of František Matúš to the research on conditional independence.
- Characterisation of conditional independence structures for polymatroids using vanishing sets.
- Selfadhesivity in Gaussian conditional independence structures
- Asymmetric decomposability and persegram representation in coherent conditional probability theory
- PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND1
- Three Counter-Examples on Semi-Graphoids
- Finding P-maps and I-maps to represent conditional independencies
- Faithfulness in chain graphs: the discrete case
- Theory of principal partitions revisited
- Learning marginal AMP chain graphs under faithfulness revisited
- Weak equivalence of local independence graphs
- Conditional independence and chain event graphs
- Matrix representations and independencies in directed acyclic graphs
- On conditional independence and log-convexity
- Rejoinder on: Sequences of regressions and their independences
- Compositional models in valuation-based systems
- Gaussian covariance faithful Markov trees
- Generalized rules of probabilistic independence
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- Efficient algorithms for maximal matroid degenerations and irreducible decompositions of circuit varieties
- Causal effect identification in acyclic directed mixed graphs and gated models
- STRUCTURAL SEMIGRAPHOIDS1
- The binomial ideal of the intersection axiom for conditional probabilities
- Graphoids and natural conditional functions
- Polyhedral aspects of score equivalence in Bayesian network structure learning
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Decomposition of two classes of structural models
- Mind change optimal learning of Bayes net structure from dependency and independency data
- Multiple testing and error control in Gaussian graphical model selection
- Algebraic aspects of Bayesian modeling in psychology
- Likelihood-based tests for a class of misspecified finite mixture models for ordinal categorical data
- Sequences of regressions and their independences
- Hopf Monoids and Generalized Permutahedra
- Imposing Independence Constraints in the CP Model
- scientific article; zbMATH DE number 6325225 (Why is no real title available?)
- Causal structure learning: a combinatorial perspective
- Self-adhesivity in lattices of abstract conditional independence models
- The characteristic imset polytope of Bayesian networks with ordered nodes
- Standard imsets for undirected and chain graphical models
- Structural Markov graph laws for Bayesian model uncertainty
- On Gaussian conditional independence structures
- Every LWF and AMP chain graph originates from a set of causal models
- Foundations of compositional models: structural properties
- Towards using the chordal graph polytope in learning decomposable models
- Foundations of compositional model theory
- A note on faithfulness and total positivity
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Representing independence models with elementary triplets
- A computational algebraic-geometry method for conditional-independence inference
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4663408)