DocumentCode
2236540
Title
Efficient Algorithms with Time Fading Model for Mining Frequent Items over Data Stream
Author
Tu, Li ; Chen, Ling ; Zhang, Shan
Author_Institution
Dept. of Comput. Sci., Nanjing Univ. of Aeronaut. & Astronaut., Nanjing, China
fYear
2009
fDate
24-25 April 2009
Firstpage
403
Lastpage
408
Abstract
Efficient algorithms with time fading model for mining frequent items over data stream are presented. Our algorithm FC2 can detectepsiv-approximate frequent items of a data stream using O(epsiv-1) memory space and the processing time for each data item is O(1). Experimental results on several artificial data sets and real data sets show that our methods have high precision, require less memory and consume less computation time than other similar methods.
Keywords
approximation theory; computational complexity; data mining; O(epsiv-1) memory space; data stream; time fading model; Aerospace industry; Computer industry; Computer science; Counting circuits; Data mining; Fading; Frequency; Mining industry; Sampling methods; Software algorithms; data mining; data stream; frequent items; time fading model;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial and Information Systems, 2009. IIS '09. International Conference on
Conference_Location
Haikou
Print_ISBN
978-0-7695-3618-7
Type
conf
DOI
10.1109/IIS.2009.48
Filename
5116383
Link To Document