Sciweavers

28 search results - page 2 / 6
» STAGGER: Periodicity Mining of Data Streams Using Expanding ...
Sort
View
ICDE
2008
IEEE
192views Database» more  ICDE 2008»
14 years 6 months ago
Verifying and Mining Frequent Patterns from Large Windows over Data Streams
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
Barzan Mozafari, Hetal Thakkar, Carlo Zaniolo
PODC
2006
ACM
13 years 10 months ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
13 years 2 months ago
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, St&e...
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 5 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ICMCS
2006
IEEE
137views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Online Mining of Recent Music Query Streams
Mining multimedia data is one of the most important issues in data mining. In this paper, we propose an online one-pass algorithm to mine the set of frequent temporal patterns in ...
Hua-Fu Li, Chin-Chuan Ho, Man-Kwan Shan, Suh-Yin L...