Sciweavers

301 search results - page 12 / 61
» On the Optimality of Probability Estimation by Random Decisi...
Sort
View
PAMI
2007
166views more  PAMI 2007»
13 years 7 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 8 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
13 years 11 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 7 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
UAI
2008
13 years 9 months ago
A Game-Theoretic Analysis of Updating Sets of Probabilities
We consider how an agent should update her uncertainty when it is represented by a set P of probability distributions and the agent observes that a random variable X takes on valu...
Peter Grünwald, Joseph Y. Halpern