An Algorithm for Mining Frequent Items on Data Stream Using Fading Factor
暂无分享,去创建一个
Ling Chen | Shan Zhang | Li Tu | Ling Chen | Li Tu | Shan Zhang
[1] Jennifer Widom,et al. Models and issues in data stream systems , 2002, PODS.
[2] Gurmeet Singh Manku,et al. Approximate counts and quantiles over sliding windows , 2004, PODS.
[3] Lap-Kei Lee,et al. A simpler and more efficient deterministic scheme for finding frequent items over sliding windows , 2006, PODS '06.
[4] Richard M. Karp,et al. A simple algorithm for finding frequent elements in streams and bags , 2003, TODS.
[5] Erik D. Demaine,et al. Frequency Estimation of Internet Packet Streams with Limited Space , 2002, ESA.
[6] Erik D. Demaine,et al. Finding frequent items in sliding windows with multinomially-distributed item frequencies , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..
[7] Rajeev Motwani,et al. Approximate Frequency Counts over Data Streams , 2012, VLDB.
[8] Jayadev Misra,et al. Finding Repeated Elements , 1982, Sci. Comput. Program..
[9] Erik D. Demaine,et al. Identifying frequent items in sliding windows over on-line packet streams , 2003, IMC '03.
[10] Yong Guan,et al. Frequency Estimation over Sliding Windows , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[11] Philippe Flajolet,et al. Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..
[12] Kyu-Young Whang,et al. A linear-time probabilistic counting algorithm for database applications , 1990, TODS.
[13] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[14] Yossi Matias,et al. New sampling-based summary statistics for improving approximate query answers , 1998, SIGMOD '98.
[15] Hongyan Liu,et al. Error-Adaptive and Time-Aware Maintenance of Frequency Counts over Data Streams , 2006, WAIM.