Mining frequent patterns from dynamic data streams with data load management

Agrawal, 1994, Fast algorithms for mining association rules, 487 Babcock, 2003, Load shedding techniques for data stream systems Chang, 2004, A sliding window method for finding recently frequent itemsets over online data streams, Journal of Information Science and Engineering, 20, 753 Charikar, 2004, Finding frequent items in data streams, Theoretical Computer Science, 312, 3, 10.1016/S0304-3975(03)00400-6 Chi, 2005, Loadstar: a load shedding scheme for classifying data streams, 346 Fang, 1998, Computing iceberg queries efficiently, 299 Frequent Itemset Mining Implementations Repository (FIMI). http://fimi.cs.helsinki.fi/. Jea, 2009, Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach, Expert Systems with Applications, 36, 12323, 10.1016/j.eswa.2009.04.053 Jea, 2010, A load-controllable mining system for frequent-pattern discovery in dynamic data streams, 2466 Leung, 2006, DSTree: a tree structure for the mining of frequent sets from data streams, 928 Linial, 1990, Approximate Inclusion–Exclusion, Combinatorica, 10, 349, 10.1007/BF02128670 Li, 2011, An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams, Expert Systems with Applications, 38, 13386, 10.1016/j.eswa.2011.04.167 Li, 2009, Mining frequent itemsets over data streams using efficient window sliding techniques, Expert Systems with Applications, 36, 1466, 10.1016/j.eswa.2007.11.061 Liu, 1968 Manku, 2002, Approximate frequency counts over data streams, 346 Tanbeer, 2009, Sliding window-based frequent pattern mining over data streams, Information Sciences, 179, 3843, 10.1016/j.ins.2009.07.012 Zhu, 2002, StatStream: statistical monitoring of thousands of data streams in real time, 358