Sciweavers

34 search results - page 2 / 7
» Predicate Selection for Structural Decision Trees
Sort
View
ILP
2005
Springer
13 years 10 months ago
Generalization Behaviour of Alkemic Decision Trees
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
Kee Siong Ng
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
14 years 6 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
GECCO
2005
Springer
195views Optimization» more  GECCO 2005»
13 years 10 months ago
Evolving fuzzy decision tree structure that adapts in real-time
A fuzzy logic algorithm has been developed that automatically allocates electronic attack (EA) resources distributed over different platforms in real-time. The controller must be ...
James F. Smith III
JAIR
2011
134views more  JAIR 2011»
12 years 11 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...
ICDIM
2007
IEEE
13 years 11 months ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...