Structural learning about directed acyclic graphs from multiple databases
From MaRDI portal
Publication:1938242
DOI10.1155/2012/579543zbMath1256.68089WikidataQ58695591 ScholiaQ58695591MaRDI QIDQ1938242
Publication date: 4 February 2013
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/579543
68Q32: Computational learning theory
68P15: Database theory
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Causation, prediction, and search
- Probabilities of causation: Bounds and identification
- Ancestral graph Markov models.
- Decomposition of structural learning about directed acyclic graphs
- Mixed Graphical Models with Missing Data and the Partial Imputation EM Algorithm
- On the Desirability of Acyclic Database Schemes
- Embeddings of Homogeneous Spaces in Prime Characteristics