Sciweavers

507 search results - page 4 / 102
» Sizes of Ordered Decision Trees
Sort
View
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
13 years 11 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg
TSMC
2002
135views more  TSMC 2002»
13 years 7 months ago
Fuzzy decision tree, linguistic rules and fuzzy knowledge-based network: generation and evaluation
A fuzzy knowledge-based network is developed based on the linguistic rules extracted from a fuzzy decision tree. A scheme for automatic linguistic discretization of continuous attr...
Sushmita Mitra, Kishori M. Konwar, Sankar K. Pal
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
AAAI
2006
13 years 9 months ago
When a Decision Tree Learner Has Plenty of Time
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
IPL
2002
98views more  IPL 2002»
13 years 7 months ago
Evolutionary induced decision trees for dangerous software modules prediction
We study the possibility of constructing decision trees with evolutionary algorithms in order to increase their predictive accuracy. We present a self-adapting evolutionary algori...
Vili Podgorelec, Peter Kokol