Sciweavers

203 search results - page 10 / 41
» Decision Tree Pruning as a Search in the State Space
Sort
View
SAC
2006
ACM
14 years 1 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
JAIR
2011
134views more  JAIR 2011»
13 years 2 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
ISCAS
2003
IEEE
122views Hardware» more  ISCAS 2003»
14 years 25 days ago
Reducing the number of variable movements in exact BDD minimization
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
Rüdiger Ebendt
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ICMI
2003
Springer
138views Biometrics» more  ICMI 2003»
14 years 23 days ago
Large vocabulary sign language recognition based on hierarchical decision trees
The major difficulty for large vocabulary sign language or gesture recognition lies in the huge search space due to a variety of recognized classes. How to reduce the recognition ...
Gaolin Fang, Wen Gao, Debin Zhao