UCD : Upper confidence bound for rooted directed acyclic graphs.
Abdallah SaffidineTristan CazenaveJean MéhatPublished in: Knowl. Based Syst. (2012)
Keyphrases
- directed acyclic graph
- upper confidence bound
- contextual bandit
- equivalence class
- random variables
- conditional independence
- equivalence classes
- structural learning
- causal discovery
- bayesian network structure
- causal models
- directed graph
- undirected graph
- causal reasoning
- independence relations
- machine learning
- wordnet