Sciweavers

70 search results - page 9 / 14
» The Problem of Missing Values in Decision Tree Grafting
Sort
View
ICAART
2010
INSTICC
14 years 4 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
FOCS
2005
IEEE
14 years 1 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
MCS
2009
Springer
14 years 5 days ago
Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...
Amir Ahmad, Gavin Brown
AIME
2009
Springer
13 years 11 months ago
The Role of Biomedical Dataset in Classification
In this paper, we investigate the role of a biomedical dataset on the classification accuracy of an algorithm. We quantify the complexity of a biomedical dataset using five complex...
Ajay Kumar Tanwani, Muddassar Farooq
RTA
2010
Springer
13 years 11 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk