Mining frequent items on stream data
Lists
Only you see this
Abstract
A frequent items mining algorithm of stream data(SW-COUNT) was proposed,which used data sampling technique to mine frequent items of data flow under sliding windows.Given an error threshold e,SW-COUNT can detect e-approximate frequent items of a data stream using O(e-1) memory space and the processing time for each data item was O(1).A lot of experiments show that SW-COUNT outperforms other methods in terms of the accuracy,memory requirement,and time and space efficiency.
BibTeX
@article{chen2011mining,
author = {Ling Chen},
title = {{Mining frequent items on stream data}},
journal = {Journal of Computer Applications},
year = {2011},
}Loading related content...