Monte-Carlo Tree Search (MCTS) is a heuristic to search in large trees. We employ it for concept learning in argumentation: MCTS pursues the best argumentation meant to account for a possibly inconsistent set of training examples. We provide experimental results of our approach with the search variant Upper Confidence Bounds on Tree (UCT).
Concept Learning by a Monte-Carlo Tree Search of Argumentations
CAIANIELLO, Pasquale;COSTANTINI, STEFANIA;
2014-01-01
Abstract
Monte-Carlo Tree Search (MCTS) is a heuristic to search in large trees. We employ it for concept learning in argumentation: MCTS pursues the best argumentation meant to account for a possibly inconsistent set of training examples. We provide experimental results of our approach with the search variant Upper Confidence Bounds on Tree (UCT).File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
