Abstract
Association rule mining is a technique of data mining that is very widely used to deduce inferences from large databases. Particle swarm optimization is one of the several methods for mining association rules and has its own pitfalls. In this paper, an adaptive particle swarm optimization (APSO) that yields a finer solution by performing a diversified search over the entire search space is presented. The algorithmic parameters such as inertia weight and acceleration coefficients are adjusted dynamically to avoid possible local optima and to improve the convergence speed. The evolutionary state estimation (ESE) approach is adopted to identify the evolutionary states that the particle undergoes for each generation. The parameters are adjusted according to the estimated state in order to provide a better balance between global exploration and local exploitation. Additionally, an elitist learning strategy (ELS) is developed for the best particle to jump out of possible local optima. APSO provides a faster convergence mechanism and avoids premature convergence when compared to normal PSO.
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
References
Indira, K., Kanmani,v., Prashanth, P., Harish, V. Konda Ramcharan Teja, Jeeva, R. Population Based Search Methods in Mining Association Rules, in: 3rd International Conference on Advances in Communication, Network, and Computing—CNC 2012, LNCS, 2012, pp. 255–261
Zhan, Z-H. and Zhang, J. and Li, Y. and Chung, H.S-H, Adaptive particle swarm optimization. IEEE Transactions on Systems Man, and Cybernetics—Part B: Cybernetics, 39 (6), 2009
Zhang, Jiuzhong, Ding, Xueming: A multi-swarm self-adaptive and cooperative particle swarm optimization. Eng. Appl Artif. Intel. 24, 958–967 (2011)
Cattral, R., Oppacher, F., Dwego, D., Rule Acquisition with Genetic Algorithm, Proceedings of the 1999 Congress on Evolutionary Computation, IEEE, 1999
Saggar, M., Agrawal, A.k., Lad, A., “Optimization of Association Rule Mining using Improved Genetic Algorithm”, In: IEEE International Conference on Systems, Man and Cybernetics,4, 2004,pp. 3725–3729
Kuo, R.J., Chao, C.M., Chiu, Y.T.: Application of particle swarm optimization to association rule mining. Appl. Soft. Comput. 11(1), 326–336 (2011)
Azevedo, Paulo J., Jorge, Alipio M.: Comparing rule measures for predictive association rules. Lect. Notes Comput. Sci. 4701, 510–517 (2007)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. Proceeding of the IEEE International Conference on Neural Networks 4, 1942–1948 (1995)
Kennedy, J., Eberhart, R.C. Swarm Intelligence, Morgan Kaufman, 2001
Eberhart, R.C., Shi, Y.: Particle swarm optimization: developments, applications and resources, pp. 81–86. Proceedings of the IEEE Congress on Evolutionary Computation, In (2001)
Merz, C.J., Murphy, P.: UCI Repository of Machine Learning Databases, 1996. http://www.cs.uci.edu/~mlearn/MLRepository.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Indira, K., Kanmani, S., Ashwini, V., Rangalakshmi, B., Divya Mary, P., Sumithra, M. (2014). Mining Association Rules Using Adaptive Particle Swarm Optimization. In: Mohapatra, D.P., Patnaik, S. (eds) Intelligent Computing, Networking, and Informatics. Advances in Intelligent Systems and Computing, vol 243. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1665-0_99
Download citation
DOI: https://doi.org/10.1007/978-81-322-1665-0_99
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1664-3
Online ISBN: 978-81-322-1665-0
eBook Packages: EngineeringEngineering (R0)