The Algorithm for Data Mining Frequent Patterns over Sliding Window

Xiao Lei Zhao; Wei Huang

doi:10.4028/www.scientific.net/AMM.513-517.759

Paper Titles

BP Neural Network Learning Algorithm and its Software Implementation
p.738

Usage Control: A Solution to Access Control in a Distributed-Network-Connected Environment
p.742

Data Mining Approaches in Manpower Evaluation
p.750

Study on Distributed Image Database
p.754

The Algorithm for Data Mining Frequent Patterns over Sliding Window
p.759

Implementation of Mechanical Model Dynamic Loading Technology on Three Dimensional Discrete Element Software
p.763

A Quantitative Network Situation Assessment Method Based on Stochastic Model
p.768

A Fine-Grained Access Control Model for Smart Grid
p.772

Design of the Miniature Programmable Logic Controller Based on STM32
p.777

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517The Algorithm for Data Mining Frequent Patterns...

The Algorithm for Data Mining Frequent Patterns over Sliding Window

Abstract:

On the basis of the shortcoming of the existed algorithm, this paper probes into sliding windows pattern and introduces an efficient algorithm for data mining frequent pattern over sliding windows. A PSW-tree pattern is set in the algorithm to store frequent and critical pattern in data mining. On this basis, the paper presents a rapid mining algorithmPSW algorithm. In the experiment IBM data generator is used to produce generated data, which proves the validity and better space efficiency of the algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

759-762

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.759

Citation:

Cite this paper

Online since:

February 2014

Authors:

Xiao Lei Zhao*, Wei Huang

Keywords:

Data Stream, Frequent Mining Pattern, PSW-Tree, Sliding Windows

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Pan Yun-He, WangJin-Long, Xu Cong-Fu. State-of-the-art on Frequent Pattern Mining in Data Streams[J]. Acta Autom atica Sinica, 2007, 32(4): 594-602.

Google Scholar

[2] Giannella C, Han J, Pei J, et al. Mining frequent patterns in data streams at multiple time granularities. In: Data Mining: Next Generation Challenges and Future Directions. 2004. 191～212.

Google Scholar

[3] Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In: Chen W, Naughton JF, Bernstein PA, eds. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. Dallas: ACM Press, 2000. 1～12.

DOI: 10.1145/342009.335372

Google Scholar

[4] Junrui Yang, Yunkai Guo, Nanyan Liu. Fast Mining Maximal Frequent Itemsets Based On Sorted FP-Tree. In: Proceedings of the 7th World Congress on Intelligent Control and Automation. Chongqing, China: IEEE Press, 2008: 5391～5395.

DOI: 10.1109/wcica.2008.4593808

Google Scholar

[5] Chi Y, Wang H, Yu P, Muntz R. MOMENT: maintaining closed frequent itemsets over a stream sliding window. In: Proceedings of the 2004 IEEE International Conference on Data Mining . Brighton, UK: IEEE Computer Society Press, 2004: 59～66.

DOI: 10.1109/icdm.2004.10084

Google Scholar

[6] Manku GS, Motwani R. Approximate frequency counts over data streams. In: Bernstein P, Ioannidis Y, Ramakrishnan R, eds. Proceedings of the 28th International Conference on Very Large Data Bases. Hong Kong: Morgan Kaufmann, 2002. 346~357.

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

Google Scholar

[7] Domingos P, Hulten G, Spencer L. Mining time-changing data streams. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. San Francisco: ACM Press, 2001. 97～106.

DOI: 10.1145/502512.502529

Google Scholar