132 search results - page 19 / 27 » Induction of Oblique Decision Trees |
CORR
2000
Springer
13 years 8 months ago
2000
Springer
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
BMCBI
2011
13 years 3 months ago
2011
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
IJCAI
2007
13 years 10 months ago
2007
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
AIIA
2003
Springer
14 years 8 days ago
2003
Springer
The aim of this paper is to show how abduction can be used in classification tasks when we deal with incomplete data. Some classifiers, even if based on decision tree induction lik...
SAC
2004
ACM
14 years 2 months ago
2004
ACM
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...