Sciweavers

495 search results - page 21 / 99
» Transfer Learning in Decision Trees
Sort
View
ECML
2004
Springer
14 years 1 months ago
Conditional Independence Trees
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
Harry Zhang, Jiang Su
ICML
2006
IEEE
14 years 8 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
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...
DAGM
2009
Springer
14 years 2 months ago
Learning with Few Examples by Transferring Feature Relevance
The human ability to learn difficult object categories from just a few views is often explained by an extensive use of knowledge from related classes. In this work we study the use...
Erik Rodner, Joachim Denzler
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen