Sciweavers

1661 search results - page 19 / 333
» Decision Tree Fields
Sort
View
112
Voted
AAAI
1990
15 years 3 months ago
What Should Be Minimized in a Decision Tree?
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
Usama M. Fayyad, Keki B. Irani
UAI
2004
15 years 3 months ago
From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
Firas Hamze, Nando de Freitas
106
Voted
FOCS
2005
IEEE
15 years 7 months ago
Safraless Decision Procedures
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
Orna Kupferman, Moshe Y. Vardi
133
Voted
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
15 years 8 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard
ICTAI
1999
IEEE
15 years 6 months ago
Controlled Flux Results in Stable Decision Trees
This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillat...
Dimitrios Kalles, Athanassios Papagelis