Mining Top-K Frequent Items in a Data Stream with Flexible Sliding Windows thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Mining Top-K Frequent Items in a Data Stream with Flexible Sliding Windows

Published on Oct 01, 20105019 Views

We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the max-frequency of an item is coun

Related categories