关联规则挖掘算法的研究-计算机软件与理论专业论文.docxVIP

Subject : Research on the Mining Algorithms of Association Rule Specialty : Computer Application Technology Name : He Hongde (Signature) Instructor : Yang Junrui (Signature) ABSTRACT Data mining is the process of abstracting unaware, potential and useful information and knowledge from plentiful, incomplete, noisy, fuzzy and stochastic data result of practical application. Association rules mining is an important branch of research in the field of data mining. It researchs and finds mainly the interesting relationship among attributes in those data result of practical application. By reading the documents at home and abroad, some association rules mining algorithms were researched.In this paper, the research is focused on the following two points. Firstly, a new algorithm, named Distributed Mining Global Maximum Frequent Pattern (DMGMFP), for mining distributed global maximal frequent patterns from databases was proposed. DMGMFP had the local mining phase and the global mining phase. During the local mining phase, first DMGMFP created respectively the tree named Improved Frequent Pattern tree (IFP-tree) on each node and used figure sequence to store frequent patterns, then it discovered the local maximal frequent patterns after scanning the local databases. During the global mining phase, DMGMFP used to share with all nodes in the local maximal frequent patterns and broadcasted patterns information for sets communication, so that the global maximal frequent patterns was mined. DMGMFP was implemented and evaluated its performance for various cases. It demonstrated better performance than other algorithms. The experimental results showed that the proposed algorithm was efficient. Secondly, considering the timeliness of data stream, we propose an algorithm of data stream frequent closed pattern mining, named Mining Frequent Closed Pattern Algorithm (MFCPA-stream), which combined both the transaction sliding window and the time decaying model. By dynamically con