Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification.
Aurélien PélissierAtsuyoshi NakamuraKoji TabataPublished in: CoRR (2018)
Keyphrases
- directed acyclic graph
- feature selection
- equivalence class
- monte carlo search
- directed graph
- mutual information
- random variables
- bayesian network structure
- transitive closure
- feature set
- bayesian network structures
- structural learning
- conditional independence
- causal models
- feature selection algorithms
- model selection
- machine learning
- shortest path problem
- equivalence classes
- bayesian networks
- event calculus
- feature space
- probability distribution