Acyclic Directed Graphs to Represent Conditional Independence Models

DOI10.1007/978-3-642-02906-6_46MaRDI QIDQ3638176zbMATH OpenOpenAlexFDO

Authors Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi

Publication date 2 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02906-6_46

zbMATH Keywords

Perfect mapAcyclic directed graphsConditional independence modelsGraphoid propertiesInferential rules

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• The infinity norm bound for the inverse of nonsingular diagonal dominant matrices
• New upper bounds for the infinity norm of inverse matrices of strictly diagonally dominant \(M\)-matrices
• Estimation on upper bounds for the infinity norms of inverses of strictly diagonally dominant M-matrices
• New upper bounds for \(\|A^{-1}\|_{\infty}\) of strictly diagonally dominant \(M\)-matrices
• Some new upper bounds for the infinity norm of the inverse matrix of a strictly diagonally dominant \(M\)-matrix

Cites work

• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• Conditional independence in a coherent finite setting
• Conditional independence structure and its closure: inferential rules and algorithms
• On chain graph models for description of conditional independence structures
• Semigraphoids and structures of probabilistic conditional independence
• Stochastic independence in a coherent setting

Cited in

(18)

• DAG representation of asymmetric independence models arising in coherent conditional possibility theory
• scientific article; zbMATH DE number 5720989 (Why is no real title available?)
• REPRESENTING CONDITIONAL INDEPENDENCE RELATIONS BY VALUATION NETWORKS
• Comparison of infinity norms of matrix inverses
• Sparse directed acyclic graphs incorporating the covariates
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• Exploiting independencies to compute semigraphoid and graphoid structures
• Acyclic directed graphs representing independence models
• On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
• Signed Directed Acyclic Graphs for Causal Inference
• THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS: A COMPARISON
• An algorithm to find a perfect map for graphoid structures
• A heuristic procedure for finding hidden variables
• Finding P-maps and I-maps to represent conditional independencies
• Matrix representations and independencies in directed acyclic graphs
• Parsimonious graphical dependence models constructed from vines
• Diagonal entries of inverses of diagonally dominant matrices
• scientific article; zbMATH DE number 2088047 (Why is no real title available?)

This page was built for publication: Acyclic Directed Graphs to Represent Conditional Independence Models

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