Dynamic Fast Database Mining Algorithm Based on Association Rules

Abstract

In order to resolve the problems of real-time data mining, a dynamic fast mining algorithm is proposed in this paper based on association rules. The algorithm do not need to scan the original database again, and overcome the weaknesses of Apriori Algorithm, which is the most representative mining approach using association rules, such as time-consuming, no online digging, and so on. The algorithm meets the demand of online and progressive mining. With the properties of multilayer processing simultaneously and updating promptly, as well as the definition of sensitivity parameter, the algorithm can be used to mine useful real-time information for the decision makers.