Abstract
It is an important part of research content in data mining to discover association rules from large scale database, the main problem of which is frequent itemsets mining. The classical Apriori algorithm is an efficient one for that. Aimed at the performance bottlenecks of multiply scanning the database and generating a large quantity of candidate itemsets in Apriori algorithm, an improved algorithm of mining association rules is presented for the bottleneck problem. Filtering out the transactions unconcerned with mining targets by a presupposed filter, on the one hand, the improved Apriori algorithm can compresses database and reduces scanning times; on another hand, the number of candidate itemsets also decreases with it, so the improvement strategy can greatly improves the whole performance of the algorithm. The application of improved Apriori algorithm in traffic accident data mining also shows that it is very practical and efficient in data mining.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jiawei, H.: Data Mining Concepts and techniques, 2nd edn., pp. 260–265. China Machine Press, Beijing (2006)
Han, J., Pei, J., Yin, Y.: Ming frequent pattern without candidate generation. In: SIGMOD, Dallas, TX, pp. 156–159 (2000)
Sarasere, A., Omiecinsky, E., Navathe, S.: An efficient algorithm for mining association rules in large database. In: 21st Int’. Conf. on Very Large Database(VLDB), Zurich, Switzerland, pp. 250–261 (September 1995)
Brin, S.: Dynamic itemcount and implication rules for market basket analysis. In: SIGMOD, Tucson, AZ, pp. 255–264 (May 1997)
Zhao, Y.H., Liu, J.B.: Association rules mining algorithm with multiple supports based on piecewise function. Computer Engineering and Design 31(21), 4621–4624 (2010) (in Chinese)
He, C.B., Chen, Q.M.: Approach for mining association rules based on rough set. Journal of Computer Applications 30(1), 25–28 (2010) (in Chinese)
Bart, G.: Frequent itemset mining implementations repository [EB/OL] (2006-04-01)., http://fimi.cs.helsinki.fi/data/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, SL. (2012). A New Mining Algorithm of Association Rules and Applications. In: Huang, DS., Gan, Y., Premaratne, P., Han, K. (eds) Bio-Inspired Computing and Applications. ICIC 2011. Lecture Notes in Computer Science(), vol 6840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24553-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-24553-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24552-7
Online ISBN: 978-3-642-24553-4
eBook Packages: Computer ScienceComputer Science (R0)