An Improved Incremental Queue Association Rules for Mining Mass Text

Article Preview

Abstract:

Association rules is an important data analysis and mining method, and the FP-Growth and the traditional FP-Tree algorithm is used in the full confidence of rules. This paper proposes a incremental queue algorithm models based on association rules, which is the improved FP4W-Growth algorithm. It is proposed and applied to the calculation the association text by the correlation of incremental queue. Its feasibility is validated by experiment. After optimization of the algorithm and model, it can find hidden and useful new information and new pattern. And those rules found in text can be potentially used as the scientific decision-making methods.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 962-965)

Pages:

2687-2690

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] K. Hatonen, Knowledge Discovery from Telecommunication Network Alarm Database. ICDE, pp: 123-131, (1996).

Google Scholar

[2] D. Pan, J. Y. Shen. Similarity Discovery Techniques in Temporal Data Mining, Journal of software, 18(2), pp: 246-258, (2007).

Google Scholar

[3] X. B. Li, J. L. Wu, Y. S. Xue, W. Weng. Research of Improvement and Optimization on Association Rules Mining Algorithm, Journal of Xiamen University(Natural Science), 14(2), pp:71-74, (2005).

Google Scholar

[4] H. Lu, J. Han, I. Feng. Stock movement and n-dimensional inter-transaction association rules, In: Pro of the SIGMOD Workshop on Research Issues on Data Ming and Knowledge Discovery, pp: 322-330, (1998).

Google Scholar

[5] H. Lu, J. Han, I. Feng. J. Beyond, Intra-Transaction Association rules, ACM Transactions on Information Systems, 18(4), pp: 423-454, (2000).

DOI: 10.1145/358108.358114

Google Scholar

[6] A. Tung, H. Lu, J. Han, Breaking the Barrier of Transactions: Mining Inter-Transaction association rules, In: Proc of the Knowledge Discovery and Data Ming, 21(3), pp: 464-471, (1999).

DOI: 10.1145/312129.312258

Google Scholar

[7] L. X. Qin, Z. Z. Shi, Research on Multiple Time Series Inter-transactional Association Analysis, Computer Engineering and Applications, 27(41), pp: 110-117, (2005).

Google Scholar

[8] J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, In: Dunham M, Naughton J, Chen W eds. Proc of 2000 ACM-SIGMOD Int'l Conf on Management of Data(SIGMOD'00), Dallas, TX, New York: ACM Press, pp: 1-12, (2000).

DOI: 10.1145/335191.335372

Google Scholar