Sciweavers

98 search results - page 12 / 20
» Branching on Attribute Values in Decision Tree Generation
Sort
View
FOCS
2010
IEEE
14 years 7 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
15 years 1 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 1 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
78
Voted
ICPR
2000
IEEE
15 years 10 months ago
Snakes and Spiders
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
Brendan McCane
70
Voted
AAAI
2006
14 years 11 months ago
Cost-Sensitive Test Strategies
In medical diagnosis doctors must often determine what medical tests (e.g., X-ray, blood tests) should be ordered for a patient to minimize the total cost of medical tests and mis...
Shengli Sheng, Charles X. Ling, Ailing Ni, Shichao...