Sciweavers

1040 search results - page 80 / 208
» TCAM-conscious Algorithms for Data Streams
Sort
View
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 10 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
IDA
2007
Springer
13 years 10 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando
APWEB
2005
Springer
14 years 3 months ago
An Incremental Subspace Learning Algorithm to Categorize Large Scale Text Data
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...
Jun Yan, QianSheng Cheng, Qiang Yang, Benyu Zhang
ICIP
2009
IEEE
13 years 8 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
ICALP
2007
Springer
14 years 4 months ago
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
Sudipto Guha, Andrew McGregor