203 search results - page 8 / 41 » Decision Tree Pruning as a Search in the State Space |
DATAMINE
1999
13 years 7 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
AI
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...