334 search results - page 27 / 67 » The Alternating Decision Tree Learning Algorithm |
ACL
2001
14 years 11 months ago
2001
There has been much interest in the recent past concerning the possibilities for automated categorization of named entities. The research presented here describes a method for the...
ICCBR
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
65
Voted
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
Most machine learning algorithms are lazy: they extract from the training set the minimum information needed to predict its labels. Unfortunately, this often leads to models that ...
105
click to vote
PLANX
2007
14 years 11 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...