一种有效挖掘数据流近似频繁项算法.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.18, No.4, April 2007, pp.884−892 DOI: 10.1360/jos180884 Tel/Fax: +86-10 © 2007 by Journal of Software . All rights reserved. ∗ 1+ 1,2 1 1,2 , , , 1( , 150001) 2 ( , 150080) An Efficient Algorithm for Mining Approximate Frequent Item over Data Streams 1+ 1,2 1 1,2 WANG Wei-Ping , LI Jian-Zhong , ZHANG Dong-Dong , GUO Long-Jiang 1(School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China) 2(School of Computer Science and Technology, Heilongjiang University, Harbin 150080, China) + Corresponding author: Phn: +86-451-6415872, E-mail: wpwang@, Wang WP, Li JZ, Zhang DD, Guo LJ. An efficient algorithm for mining approximate frequent item over data streams. , 2007,18(4):884 892. Journal of Software − /1000-9825/18/884.htm Abstract : A frequent item of a data stream is a data point whose occurrence frequency is above a given threshold. Finding frequent item of data stream has wide applications in various fields, such as network traffic monitor, data stream OLAP and data stream mining, etc. In data stream model, the algorithm can only scan the data in one pass and the available memory space is very limited relative to the volume of a data stream, therefore it is usually unable to find all the accurate frequent items of a data stream. This paper proposes a novel algorithm to find ε-approximate