Sciweavers

5 search results - page 1 / 1
» Skewing: An Efficient Alternative to Lookahead for Decision ...
Sort
View
IJCAI
2003
13 years 6 months ago
Skewing: An Efficient Alternative to Lookahead for Decision Tree Induction
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
David Page, Soumya Ray
ICML
2004
IEEE
14 years 5 months ago
Sequential skewing: an improved skewing algorithm
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
Soumya Ray, David Page
SGAI
2007
Springer
13 years 10 months ago
Towards a Computationally Efficient Approach to Modular Classification Rule Induction
Induction of classification rules is one of the most important technologies in data mining. Most of the work in this field has concentrated on the Top Down Induction of Decision T...
Frederic T. Stahl, Max Bramer
IFIP12
2008
13 years 6 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
CORR
2000
Springer
120views Education» more  CORR 2000»
13 years 4 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...