Sciweavers

274 search results - page 13 / 55
» Learning decision trees from dynamic data streams
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 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
DIS
2006
Springer
13 years 11 months ago
Kalman Filters and Adaptive Windows for Learning in Data Streams
We study the combination of Kalman filter and a recently proposed algorithm for dynamically maintaining a sliding window, for learning from streams of examples. We integrate this i...
Albert Bifet, Ricard Gavaldà
SAC
2004
ACM
14 years 1 months ago
Forest trees for on-line data
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...
João Gama, Pedro Medas, Ricardo Rocha
DEXA
2009
Springer
151views Database» more  DEXA 2009»
14 years 2 months ago
Detecting Projected Outliers in High-Dimensional Data Streams
Abstract. In this paper, we study the problem of projected outlier detection in high dimensional data streams and propose a new technique, called Stream Projected Ouliter deTector ...
Ji Zhang, Qigang Gao, Hai H. Wang, Qing Liu, Kai X...
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