Sciweavers

272 search results - page 15 / 55
» Lazy tree splitting
Sort
View
WLP
2007
Springer
14 years 1 months ago
The Kiel Curry System KiCS
This paper presents the Kiel Curry System (KiCS) for the lazy functional logic language Curry. Its main features beyond other Curry implementations are: flexible search control by...
Bernd Brassel, Frank Huch
IJCAI
1989
13 years 8 months ago
Generating Better Decision Trees
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...
Steven W. Norton
APPML
2005
55views more  APPML 2005»
13 years 7 months ago
Recovering a phylogenetic tree using pairwise closure operations
A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is ...
Katharina T. Huber, Vincent Moulton, Charles Sempl...
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 7 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
ICML
2004
IEEE
14 years 8 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch