Sciweavers

132 search results - page 13 / 27
» Induction of Oblique Decision Trees
Sort
View
KBS
2002
106views more  KBS 2002»
13 years 8 months ago
Hybrid decision tree
In this paper, a hybrid learning approach named HDT is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to d...
Zhi-Hua Zhou, Zhaoqian Chen
IDA
2010
Springer
13 years 10 months ago
Oracle Coached Decision Trees and Lists
This paper introduces a novel method for obtaining increased predictive performance from transparent models in situations where production input vectors are available when building...
Ulf Johansson, Cecilia Sönströd, Tuve L&...
ICML
2006
IEEE
14 years 9 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...
ICIP
2009
IEEE
13 years 6 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 9 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...