An Efficient Frequent Patterns Mining Algorithm over Data Streams Based on FPD-Graph

Abstract:

The design of synopses structure is an important issue of frequent patterns mining over data stream. A data stream synopses structure FPD-Graph which is based on directed graph is proposed in this paper. The FPD-Graph contains list head node FPDG-Head and list node FPDG-Node. The operations of FPD-Graph consist of insert operation and deletion operation. A frequent pattern mining algorithm DGFPM based on sliding window over data stream is proposed in this paper. The IBM synthesizes data generation which output customers shopping a data are adopted as experiment data. The DGFPM algorithm not only has high precision for mining frequent patterns, but also has low processing time.

• Periodical: Advanced Materials Research (Volumes 433-440)
• Pages: 4457-4462
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.433-440.4457
• Online since: January 2012
• Authors: Jun Shan Tan, Zhu Fang Kuang, Guo Gui Yang
• Keywords: Data Mining (DM), Data Streams, Directed Graph, Frequent Patterns, Sliding Window

References

[1] Babcock AK, Babu S, Datar M. Model and issues in data stream systems[C]. In: Popa L, ed. Proc. of the 21st ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems. Madison: ACM, 2002. 1−16.

DOI: 10.1145/543613.543615

[2] Manku G S, Motwani R. Approximate frequency counts over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases. Hong Kong, China: Morgan Kanfmann, 2002. 346-357.

DOI: 10.1016/b978-155860869-6/50038-x

[3] Arasu A, Manku G S. Approximate counts and quantiles over sliding windows. In: Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. Paris, France: ACM, 2004. 286-296.

DOI: 10.1145/1055558.1055598

[4] Giannella C, Han J, Pei J, Yan X, Yu PS. Mining frequent patterns in data streams at multiple time granularities. In: Data Mining: Next Generation Challenges and Future Directions. 2004. 191−212.

[5] Leung CKS, Khan QI. DStree: A tree structure for the mining of frequent sets from data streams. In: Clifton CW, Zhong N, Liu JM, Wah BW, Wu XD, eds. Proc. of the 6th Int'l Conf. on Data Mining. Hong Kong: IEEE Press, 2006. 928−932.

DOI: 10.1109/icdm.2006.62

[6] LI Guo-Hui, CHEN Hui. Mining the Frequent Patterns in an Arbitrary Sliding Window over Online Data Streams[J]. Journal of Software, 2008, 19(10): 2585−2596.

DOI: 10.3724/sp.j.1001.2008.02585

[7] WU Feng, ZHONG Yan, WU Quan-Yuan. Mining Frequent Patterns over Data Stream under the Time Decaying Model[J]. ACTA AUTOMATICA SINICA , 2010, 36(5): 674-684.

DOI: 10.3724/sp.j.1004.2010.00674

[8] Yang Bei, Huang KouKuang. Mining Top-K Significant Itemsets in Landmark Windows over Data Streams[J]. Journal of Computer Research and Development, 2010, 47(3): 463-473.

[9] http: /www. almaden. ibm. com/cs/projects/iis/hdb/Projects/data_mining/datasets/syndata. html#instructions[CP/OL].