Sciweavers

493 search results - page 19 / 99
» A Multi-relational Decision Tree Learning Algorithm - Implem...
Sort
View
CIS
2004
Springer
14 years 2 months ago
Knowledge Maintenance on Data Streams with Concept Drifting
Concept drifting in data streams often occurs unpredictably at any time. Currently many classification mining algorithms deal with this problem by using an incremental learning ap...
Juggapong Natwichai, Xue Li
COMSIS
2006
156views more  COMSIS 2006»
13 years 8 months ago
A Comparison of the Bagging and the Boosting Methods Using the Decision Trees Classifiers
In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of ...
Kristína Machova, Miroslav Puszta, Frantise...
SAC
2006
ACM
14 years 2 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 29 days ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford