Sciweavers

1209 search results - page 71 / 242
» Semi-Supervised Learning with Trees
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 6 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
IDA
2005
Springer
14 years 1 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer
CG
2006
Springer
13 years 10 months ago
Feature Construction for Reinforcement Learning in Hearts
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
Nathan R. Sturtevant, Adam M. White
DIS
2001
Springer
14 years 17 days ago
Functional Trees
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
Joao Gama
BMCBI
2010
109views more  BMCBI 2010»
13 years 8 months ago
Predicting gene function using hierarchical multi-label decision tree ensembles
Background: S. cerevisiae, A. thaliana and M. musculus are well-studied organisms in biology and the sequencing of their genomes was completed many years ago. It is still a challe...
Leander Schietgat, Celine Vens, Jan Struyf, Hendri...