Sciweavers

5463 search results - page 49 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
215
Voted
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
16 years 1 months ago
Randomized Synopses for Query Assurance on Data Streams
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
Ke Yi, Feifei Li, Marios Hadjieleftheriou, George ...
106
Voted
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 19 days ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
101
Voted
SIGMOD
2004
ACM
157views Database» more  SIGMOD 2004»
16 years 20 days ago
Holistic UDAFs at streaming speeds
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...
Graham Cormode, Theodore Johnson, Flip Korn, S. Mu...
122
Voted
MIR
2005
ACM
129views Multimedia» more  MIR 2005»
15 years 6 months ago
Tracking concept drifting with an online-optimized incremental learning framework
Concept drifting is an important and challenging research issue in the field of machine learning. This paper mainly addresses the issue of semantic concept drifting in time series...
Jun Wu, Dayong Ding, Xian-Sheng Hua, Bo Zhang
105
Voted
ICIP
2009
IEEE
14 years 10 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li