82 search results - page 5 / 17 » Lookahead-based algorithms for anytime induction of decision... |
KDD
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
The Markov Blanket of a target variable is the minimum conditioning set of variables that makes the target independent of all other variables. Markov Blankets inform feature selec...
NLP
2000
13 years 11 months ago
2000
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
PAKDD
2001
ACM
14 years 4 days ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...