Abstract
Abstract. Study of this paper is based on finding the threshold value of database change up to which incremental Apriori algorithm performs better. A new incremental Apriori algorithm is also proposed which performs better than the existing algorithm in terms of computation time. The performance of frequent sets generation algorithms for dynamic databases is major problem, since numbers of runs are required to accommodate the database changes. It determines the value of change percentage of original database that decides whether the user can go for re-run the actual algorithm or use the previously computed result and generate the frequent sets in incremental fashion. The purpose of this paper is two folds. First is to avoid the scans of the older database, its corresponding support count effort for newly added records by using intermediate data and results. And second is to solve the efficient updating problem of association rules after a nontrivial number of new records have been added to a database.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Rakesh, A., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. 20th Int’l Conf. Very Large Data Bases (VLDB 1994), Santiago, Chile, pp. 487–499 (1994)
Ratchadaporn, A., Worapoj, K.: Incremental ARM using promising Frequent Itemset:Information. In: Communicatios & Signal Processing,6th Int’l Conf. IEEE, pp. 1–5 (2007)
Sotiris, K., Dimitris, K.: Association Rules Mining: A Recent Overview. GESTS Int’l Transactions on Computer Science and Engg. 32(1), 71–82 (2006)
Ravindra, P., Swami, D.K., Pardarsani, K.R.: Lattice Based Algorithm for incremental mining of Association rules. Int’l Journal of Theoretical and Applied Computer Sciences 1(1), 119–128 (2006)
Sarda, N.L., Srinivas, N.V.: An Adaptive Algorithm for Incremental Mining of Association Rules. In: Proc. Ninth Int’l Workshop on Database and Expert Systems Applications, p. 240 (1998)
Wu, X., Kumar, V., Quinlan, J.R., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G.J., Ng, A., Liu, B., Yu, P.S., Zhou, Z.-H., Steinbach, M., Hand, D.J., Steinberg, D.: Top 10 algorithms for Data Mining. In: IEEE International Conference on Data Mining (ICDM) (December 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharma, N.K., Nagwani, N.K. (2011). Study and Analysis of Incremental Apriori Algorithm. In: Mantri, A., Nandi, S., Kumar, G., Kumar, S. (eds) High Performance Architecture and Grid Computing. HPAGC 2011. Communications in Computer and Information Science, vol 169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22577-2_64
Download citation
DOI: https://doi.org/10.1007/978-3-642-22577-2_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22576-5
Online ISBN: 978-3-642-22577-2
eBook Packages: Computer ScienceComputer Science (R0)