Sciweavers

32 search results - page 3 / 7
» Calculating the VC-dimension of decision trees
Sort
View
ILP
2003
Springer
14 years 19 days ago
A Multi-relational Decision Tree Learning Algorithm - Implementation and Experiments
We describe an efficient implementation (MRDTL-2) of the Multi-relational decision tree learning (MRDTL) algorithm [23] which in turn was based on a proposal by Knobbe et al. [19] ...
Anna Atramentov, Hector Leiva, Vasant Honavar
DSS
2011
12 years 11 months ago
How much to spend on flexibility? Determining the value of information system flexibility
In the current paper, we outline several approaches to determine the value of information system (IS) flexibility, defined as the extent to which an IS can be modified and upgrade...
Franz Schober, Judith Gebauer
ICMLA
2007
13 years 9 months ago
Machine learned regression for abductive DNA sequencing
We construct machine learned regressors to predict the behaviour of DNA sequencing data from the fluorescent labelled Sanger method. These predictions are used to assess hypothes...
David Thornley, Maxim Zverev, Stavros Petridis
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 7 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
ICPR
2006
IEEE
14 years 8 months ago
Fast Support Vector Machine Classification using linear SVMs
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
Karina Zapien Arreola, Janis Fehr, Hans Burkhardt