Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours

DOI10.1007/978-3-540-45062-7_13zbMATH Open1274.68554OpenAlexW2109347881MaRDI QIDQ3550867FDOQ3550867

Authors: Milan Studený 

Publication date: 6 April 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-540-45062-7_13

Recommendations

• Characterization of inclusion neighbourhood in terms of the essential graph
• 10.1162/153244304773936045
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• A characterization of Markov equivalence classes for acyclic digraphs
• A geometric view on learning Bayesian network structures

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cited In (3)

• Characterization of inclusion neighbourhood in terms of the essential graph
• The marginal factorization of Bayesian networks and its application
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS

This page was built for publication: Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours

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