Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification

Aurelien Pelissier
Aurelien Pelissier

SDM, Volume abs/1811.07531, 2019.

Cited by: 3|Views6
EI

Abstract:

Monte Carlo tree search (MCTS) has received considerable interest due to its spectacular success in the difficult problem of computer Go and also proved beneficial in a range of other domains. A major issue that has received little attention in the MCTS literature is the fact that, in most games, different actions can lead to the same sta...More

Code:

Data:

Your rating :
0

 

Tags
Comments