Sciweavers

1248 search results - page 8 / 250
» Decision Tree Grafting
Sort
View
IJCAI
1989
14 years 10 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
CLA
2007
14 years 11 months ago
Inducing Decision Trees via Concept Lattices
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...
Radim Belohlávek, Bernard De Baets, Jan Out...
ICML
2003
IEEE
15 years 10 months ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley
85
Voted
JSYML
2010
95views more  JSYML 2010»
14 years 4 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
SIGKDD
2000
96views more  SIGKDD 2000»
14 years 9 months ago
The MP13 Approach to the KDD'99 Classifier Learning Contest
The MP13 method is best summarized as recognition based on voting decision trees using "pipes" in potential space. Keywords Voting; Decision Tree; Potential Space
Vladimir Miheev, Alexei Vopilov, Ivan Shabalin