Sciweavers

3455 search results - page 116 / 691
» Generalized Game Trees
Sort
View
ML
2008
ACM
100views Machine Learning» more  ML 2008»
15 years 4 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
PRICAI
2000
Springer
15 years 8 months ago
The Lumberjack Algorithm for Learning Linked Decision Forests
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
William T. B. Uther, Manuela M. Veloso
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 4 months ago
Upward Point-Set Embeddability
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. W...
Markus Geyer, Michael Kaufmann, Tamara Mchedlidze,...
PAMI
1998
127views more  PAMI 1998»
15 years 4 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
KDD
1999
ACM
152views Data Mining» more  KDD 1999»
15 years 8 months ago
Applying General Bayesian Techniques to Improve TAN Induction
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
Jesús Cerquides