Sciweavers

274 search results - page 27 / 55
» Learning decision trees from dynamic data streams
Sort
View
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 7 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
ISIPTA
1999
IEEE
139views Mathematics» more  ISIPTA 1999»
13 years 12 months ago
Rational Decision Making With Imprecise Probabilities
Decision criteria based on an imprecise probability representation of uncertainty have been criticized, from the normative point of view, on the grounds that they make the decisio...
Jean-Yves Jaffray
KDD
2010
ACM
257views Data Mining» more  KDD 2010»
13 years 11 months ago
Multi-task learning for boosting with application to web search ranking
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
Olivier Chapelle, Pannagadatta K. Shivaswamy, Srin...
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 8 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
CIKM
2010
Springer
13 years 6 months ago
Partial drift detection using a rule induction framework
The major challenge in mining data streams is the issue of concept drift, the tendency of the underlying data generation process to change over time. In this paper, we propose a g...
Damon Sotoudeh, Aijun An