Dissertation > Excellent graduate degree dissertation topics show
Research of Incremental Updating Algorithm for Association Rules
Author: ZuoXiangKe
Tutor: XingYongKang
School: Chongqing University
Course: Computer Software and Theory
Keywords: Association rules Apriori algorithm frequent itemset incremental updating
CLC: TP311.13
Type: Master's thesis
Year: 2009
Downloads: 134
Quote: 2
Read: Download Dissertation
Abstract
|
In the practical application of association rules mining, the mined data always increases, decreases and revises. In order to obtain the expected association rules, users usually adjust the thresholds of minimum support and minimum confidence. The traditional method to deal with this kind of problem is to compute it again with the revised data and threshold, which can not make use of the former computation. As an important problem of association rules mining, the incremental updating of association rules focuses on how to obtain the ideal association rules from making use of the former computation when the original database or the relevant threshold changes. The efficiency of mining process will be greatly improved if the algorithm of association rules can fully makes use of the former computation, instead of applying the new algorithm to the whole transaction database. It is especially important for the large-scale database to update the data dynamically instead of mining from the updated database again and again. The incremental updating algorithm can update data step by step, which can revise and enhance the data which has been provided,and it is a promising goal to various database mining. There are wide applications for the research of incremental updating algorithm of association rules.This study is to deal with incremental updating algorithm for association rules. What we will do is:①To review the algorithm for association rules mining, which is based on the relevant literature and former studies. It focuses on the basic classic association rules mining algorithm and analyzes their positive and negative point; To analyze the search strategy in the algorithm of frequent itemset and summarize the various updating and optimizing strategy of the classic algorithm.②It provides a brief introduction to the NewQAIS algorithm and its application. We have a comparison to Apriori algorithm.③To analyze NewQAIS algorithm’s weak point, pointing out improved optimize strategy. Then we provide an improved algorithm of NewQAIS---OFIUA (Ordered Forst Incremental Updating Algorithm).OFIUA algorithm greatly improves the efficiency of computation by introducing the concept of matrix that can transform the transaction to 0-1 matrix by scanning, and compute the support data of itemset by the inner product of vector. To analyze the constitutive feature of the itemset in NewQAIS algorithm, point out its weak point in generative itemset, and introduce the data structure of ordered forest. The ordered tree in ordered forest is independent, which can improve the speed to generate the candidate itemsets in apriori–gen of apriori algorithm. This improved algorithm can be applied not only to update of association rules which is caused by increase of transaction in transaction database, but also to the update of association rules which is caused by the change of the supporting degree with the same transaction database.
|
Related Dissertations
- The Conservation of Xingcheng Ancient City,TU984.114
- The Study of Incremental Democratic Research in the Perspective of Socialist Harmonious Society,D621
- Research on Clustering Algorithm Based on Genetic Algorithm and Rough Set Theory,TP18
- Research on Traceability and Incremental Consistency of the MDA Model Transformation,TP311.5
- The Establishment of Grid Platform on Agricultural Supply Chain System,S126
- Based on data mining research tax audit case selection,F812.42
- Small photovoltaic grid-connected inverter design and simulation,TM464
- The Application of the Mining of Association Rules in Analysis of Traffic Accidents,U491.31
- The Application of Association Rules Algorithm in Higher Vocational Colleges’ Endorsement of Impoverished Students,G717
- Web Usage Mining and the Research of Personalized Recommendation,TP311.13
- Data Mining of Application in the School Management and Training Students,TP311.13
- Study on Applications of Soft Sensor in Chloromethane Recovery,TQ222.214
- Research of Fault Diagnosis Method of Analog Circuit Based on Improved Support Vector Machines,TN710
- The Research on Moving Object Detection and Tracking Based on Traffic Surveillance Video,TP391.41
- The Research and Implementation of Background Modeling and Updating Algorithm Based on Mixture Gaussian Model,TP391.41
- Algorithm Research on Video-based Vehicle Detection, Tracking and Recognition for Intelligent Transportation,TP391.41
- Research of Closed Frequent Itemsets Mining Algorithm in Data Steams,TP311.13
- The Application Research of Association Rules Parallel Algorithm Analysis Based on FP-Growth,TP311.13
- Research on Privacy Protection Based on Association Rule Algorithm,TP309
- Simulation of Multiple-step Incremental Roll-bending Forming of Large-scale Sheet Metal with U Shape,TG386
- The Research of the Management Strategy in Old Structure’s Function Updating in Hangzhou,TU984.114
CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Computer software > Program design,software engineering > Programming > Database theory and systems
© 2012 www.DissertationTopic.Net Mobile
|