82 search results - page 3 / 17 » Dynamically maintaining frequent items over a data stream |
ESCAPE
2007
Springer
14 years 6 days ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
MLDM
2008
Springer
13 years 6 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
ADC
2008
Springer
14 years 12 days ago
2008
Springer
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
BTW
2011
Springer
12 years 9 months ago
2011
Springer
Abstract: The rise of the Web 2.0 has made content publishing easier than ever. Yesterday’s passive consumers are now active users who generate and contribute new data to the web...