257 search results - page 12 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
SPIRE
2009
Springer
15 years 4 months ago
2009
Springer
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
IDA
2007
Springer
14 years 9 months ago
2007
Springer
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...
IM
2006
14 years 9 months ago
2006
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
110
click to vote
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
STOC
2002
ACM
15 years 10 months ago
2002
ACM