Sciweavers

1283 search results - page 30 / 257
» Learning Voting Trees
Sort
View
CAI
2007
Springer
14 years 1 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 8 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ICML
2006
IEEE
14 years 8 months ago
Kernelizing the output of tree-based methods
We extend tree-based methods to the prediction of structured outputs using a kernelization of the algorithm that allows one to grow trees as soon as a kernel can be defined on the...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
TSP
2010
13 years 2 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
AAAI
1998
13 years 9 months ago
Tree Based Discretization for Continuous State Space Reinforcement Learning
Reinforcement learning is an effective technique for learning action policies in discrete stochastic environments, but its efficiency can decay exponentially with the size of the ...
William T. B. Uther, Manuela M. Veloso