A survey on algorithms for mining frequent itemsets over data streams

@article{citeulike:2971452, abstract = {Abstract\ \ The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of frequent itemsets (FIs). Unlike mining static databases, mining data streams poses many new challenges. In addition to the one-scan nature, the unbounded memory requirement and the high data arrival rate of data streams, the combinatorial explosion of itemsets exacerbates the mining task. The high complexity of the FI mining problem hinders the application of the stream mining techniques. We recognize that a critical review of existing techniques is needed in order to design and develop efficient mining algorithms and data structures that are able to match the processing rate of the mining with the high arrival rate of data streams. Within a unifying set of notations and terminologies, we describe in this paper the efforts and main techniques for mining data streams and present a comprehensive survey of a number of the state-of-the-art algorithms on mining frequent itemsets over data streams. We classify the stream-mining techniques into two categories based on the window model that they adopt in order to provide insights into how and why the techniques are useful. Then, we further analyze the algorithms according to whether they are exact or approximate and, for approximate approaches, whether they are false-positive or false-negative. We also discuss various interesting issues, including the merits and limitations in existing research and substantive areas for future research.}, author = {Cheng, James and Ke, Yiping and Ng, Wilfred }, citeulike-article-id = {2971452}, doi = {10.1007/s10115-007-0092-4}, journal = {Knowledge and Information Systems}, keywords = {data\_stream\_mgt, event\_stream\_processing}, month = {July}, number = {1}, pages = {1--27}, posted-at = {2008-07-08 05:35:10}, priority = {2}, title = {A survey on algorithms for mining frequent itemsets over data streams}, url = {http://dx.doi.org/10.1007/s10115-007-0092-4}, volume = {16}, year = {2008} }

TY - JOUR ID - citeulike:2971452 L3 - citeulike-article-id:2971452 TI - A survey on algorithms for mining frequent itemsets over data streams JF - Knowledge and Information Systems VL - 16 IS - 1 SP - 1 EP - 27 N2 - Abstract  The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of frequent itemsets (FIs). Unlike mining static databases, mining data streams poses many new challenges. In addition to the one-scan nature, the unbounded memory requirement and the high data arrival rate of data streams, the combinatorial explosion of itemsets exacerbates the mining task. The high complexity of the FI mining problem hinders the application of the stream mining techniques. We recognize that a critical review of existing techniques is needed in order to design and develop efficient mining algorithms and data structures that are able to match the processing rate of the mining with the high arrival rate of data streams. Within a unifying set of notations and terminologies, we describe in this paper the efforts and main techniques for mining data streams and present a comprehensive survey of a number of the state-of-the-art algorithms on mining frequent itemsets over data streams. We classify the stream-mining techniques into two categories based on the window model that they adopt in order to provide insights into how and why the techniques are useful. Then, we further analyze the algorithms according to whether they are exact or approximate and, for approximate approaches, whether they are false-positive or false-negative. We also discuss various interesting issues, including the merits and limitations in existing research and substantive areas for future research. KW - data_stream_mgt KW - event_stream_processing AU - Cheng, James AU - Ke, Yiping AU - Ng, Wilfred PY - 2008/07/01/ UR - http://dx.doi.org/10.1007/s10115-007-0092-4 ER -