Sciweavers

301 search results - page 7 / 61
» On the Optimality of Probability Estimation by Random Decisi...
Sort
View
UAI
2004
13 years 9 months ago
MOB-ESP and other Improvements in Probability Estimation
A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probabi...
Rodney Nielsen
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
13 years 9 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
EGC
2009
Springer
13 years 5 months ago
A Bayes Evaluation Criterion for Decision Trees
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
Nicolas Voisine, Marc Boullé, Carine Hue
ICTAI
2003
IEEE
14 years 1 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
WSC
1997
13 years 9 months ago
Selecting the Best System: A Decision-Theoretic Approach
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
Stephen E. Chick