Sciweavers

77 search results - page 5 / 16
» Improving the Representation of Infinite Trees to Deal with ...
Sort
View
ICLP
2010
Springer
13 years 11 months ago
Dedicated Tabling for a Probabilistic Setting
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
Theofrastos Mantadelis, Gerda Janssens
IBPRIA
2011
Springer
12 years 11 months ago
Classifying Melodies Using Tree Grammars
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
José Francisco Bernabeu, Jorge Calera-Rubio...
ICGA
2008
208views Optimization» more  ICGA 2008»
13 years 8 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
IFIP12
2008
13 years 9 months ago
A Study with Class Imbalance and Random Sampling for a Decision Tree Learning System
Sampling methods are a direct approach to tackle the problem of class imbalance. These methods sample a data set in order to alter the class distributions. Usually these methods ar...
Ronaldo C. Prati, Gustavo E. A. P. A. Batista, Mar...
ISDA
2010
IEEE
13 years 5 months ago
Improving statistical parsing by linguistic regularization
Statistically-based parsers for large corpora, in particular the Penn Tree Bank (PTB), typically have not used all the linguistic information encoded in the annotated trees on whic...
Igor Malioutov, Robert C. Berwick