Sciweavers

140 search results - page 18 / 28
» Learning Relational Concepts with Decision Trees
Sort
View
EMNLP
2004
13 years 9 months ago
A Boosting Algorithm for Classification of Semi-Structured Text
The focus of research in text classification has expanded from simple topic identification to more challenging tasks such as opinion/modality identification. Unfortunately, the la...
Taku Kudo, Yuji Matsumoto
IDA
2007
Springer
14 years 1 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
PAMI
2000
113views more  PAMI 2000»
13 years 7 months ago
Hierarchical Discriminant Regression
This paper presents a new technique which incrementally builds a hierarchical discriminant regression (IHDR) tree for generation of motion based robot reactions. The robot learned...
Wey-Shiuan Hwang, Juyang Weng
IJCAI
1989
13 years 8 months ago
Noise-Tolerant Instance-Based Learning Algorithms
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
David W. Aha, Dennis F. Kibler
CIMCA
2008
IEEE
14 years 2 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis