CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Hybrid PSO with Dynamic Inertia Weight and GA Approach for Discovering Classification Rule in Data Mining

by S. M. Uma, K. Rajiv Gandhi, E. Kirubakaran, Dr.E.Kirubakaran
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 40 - Number 17
Year of Publication: 2012
Authors: S. M. Uma, K. Rajiv Gandhi, E. Kirubakaran, Dr.E.Kirubakaran
10.5120/5074-7471

S. M. Uma, K. Rajiv Gandhi, E. Kirubakaran, Dr.E.Kirubakaran . A Hybrid PSO with Dynamic Inertia Weight and GA Approach for Discovering Classification Rule in Data Mining. International Journal of Computer Applications. 40, 17 ( February 2012), 32-37. DOI=10.5120/5074-7471

@article{ 10.5120/5074-7471,
author = { S. M. Uma, K. Rajiv Gandhi, E. Kirubakaran, Dr.E.Kirubakaran },
title = { A Hybrid PSO with Dynamic Inertia Weight and GA Approach for Discovering Classification Rule in Data Mining },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 40 },
number = { 17 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 32-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume40/number17/5074-7471/ },
doi = { 10.5120/5074-7471 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:28:26.127695+05:30
%A S. M. Uma
%A K. Rajiv Gandhi
%A E. Kirubakaran
%A Dr.E.Kirubakaran
%T A Hybrid PSO with Dynamic Inertia Weight and GA Approach for Discovering Classification Rule in Data Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 40
%N 17
%P 32-37
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data Mining is the efficient knowledge discovery form database. It is also form of knowledge discovery essential for solving problem in specific domain like health care, business and other field. The proposed system is based on population based on heuristic search technique, which can used to solve combinatorial optimization problem. Our research focus on studying the hybrid algorithm that result in performance and enhancement in classification rule discovery task. In standard Particle Swarm Optimization (PSO) the non oscillatory route can quickly cause a particle to stagnate and also it may prematurely converge on suboptimal solution that is not even guaranteed to local optimal solution. In this paper we have present novel hybrid algorithm, PSO with Dynamic Inertia Weight and Genetic Algorithm (GA) approach for classification rule. The selection of inertia weight was very important to ensure the convergent behavior of particle In this hybrid algorithm approach incorporates a dynamic inertia weight in order to help the algorithm to find global and overcome the problem convergence to local optima, essentially GA can perform a global search over the entire search space with faster convergence speed. Thus the hybrid algorithm is easily implemented because of use of simple classifier it has, its computational complexity is low, are the special characteristics for the use of this hybrid algorithm.

References
  1. Zhang Haiyang A Short Introduction to Data Mining and Its Applications Aug. 2011 IEEE
  2. Li Min Fu, Senior Member, IEEE and Edward H. Shortliffe The Application of Certainty Factors to Neural Computing for Rule Discovery MAY 2000 in IEEE
  3. J. Han and M. Kamber, Data Mining: Concepts and Techniques. San Francisco: Morgan Kaufmann Publisher, 2006.
  4. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Neural Networks, 1995. Proceedings. IEEE International Conference on, vol. 4 1995, pp. 1942–1948 vol.4.
  5. Particle Swarm Optimization, Wikipedia. http://en.wikipedia.org/wiki/Particle swarm optimization.
  6. Particle Swarm Optimization, http://www.swarmintelligence.org/tutorials.php.
  7. LI Ming*, JI Xue-Ling, LI Wei An Improved Constriction Factor Particle Swarm Optimization Algorithm to Overcome the Local Optimum,
  8. Proceedings of the 30th Chinese Control Conference July 22-24, 2011, Yantai, China.
  9. Tian, Y., R. Zhu and Q. Xue, 2008. Research advances on inertia weight in particle swarm optimization. Comput. Eng. Appl, 44: 39-41.
  10. Moreno-Perez JA, Castro-Gutierrez JP, Martnez-Garca FJ, Melian B, Moreno-Vega JM, Ramos J (2007) Discrete Particle Swarm Optimization for the p-median problem. In: Proceedings of the 7th Metaheuristics International Conference, Montreal, Canada.
  11. M.Clerc, J.Kennedy. The particle swarm-explosion, stability, and convergence in a multidimensional complex space[J]. IEEE Trans. Evolutionary Computation. 2002.6(1):58-73.
  12. Y. Shi and R. Eberhart., “A modified particle swarm optimizer”, In Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on, pages 69–73. IEEE, 2002.
  13. R.C. Eberhart and Y. Shi., “Tracking and optimizing dynamic systems with particle swarms”, In Evolutionary Computation, 2001. Proceedings of the 2001 Congress on, volume 1, pages 94–100 IEEE, 2002.
  14. A.Nikabadi, M.Ebadzadeh , “Particle swarm optimization algorithms with adaptive Inertia Weight : A survey of the state of the art and a Novel method”, IEEE journal of evolutionary computation , 2008.
  15. R.F. Malik, T.A. Rahman, S.Z.M. Hashim, and R. Ngah, “New Particle Swarm Optimizer with Sigmoid Increasing Inertia Weight”, International Journal of Computer Science and Security (IJCSS), 1(2):35, 2007.
  16. J. Xin, G. Chen, and Y. Hai., “A Particle Swarm Optimizer with Multistage Linearly-Decreasing Inertia Weight”, In Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on, volume 1, pages 505–508. IEEE, 2009.
  17. Y. Feng, G.F. Teng, A.X. Wang, and Y.M. Yao., “Chaotic Inertia Weight in article Swarm Optimization”, In Innovative Computing, Information and Control, 2007. ICICIC’07. Second International Conference on, page 475. IEEE, 2008.
  18. K. Kentzoglanakis and M. Poole., “Particle swarm optimization with an oscillating Inertia Weight”, In Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 1749–1750. ACM, 2009.
  19. M.S. Arumugam and MVC Rao., “On the performance of the particle swarm optimization algorithm with various Inertia Weight variants for computing optimal control of a class of hybrid systems”, Discrete Dynamics in Nature and Society, 2006, 2006.
  20. W. Al-Hassan, MB Fayek, and SI Shaheen, “Psosa: An optimized particle swarm technique for solving the urban planning problem”, In Computer Engineering and Systems, The 2006 International Conference on, pages 401–405. IEEE, 2007.
  21. G. Chen, X. Huang, J. Jia, and Z. Min., “Natural exponential Inertia Weight strategy in particle swarm optimization”, In Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on, volume 1, pages 3672–3675. IEEE, 2006.
  22. Y. Gao, X. An, and J. Liu., “A Particle Swarm Optimization Algorithm with Logarithm Decreasing Inertia Weight and Chaos Mutation”, In Computational Intelligence and Security, 2008. CIS’08. International Conference on, volume 1, pages 61–65. IEEE, 2008.
  23. H.R. Li and Y.L. Gao., “Particle Swarm Optimization Algorithm with Exponent Decreasing Inertia Weight and Stochastic Mutation”, In —2009 Second International Conference on Information and Computing Science, pages 66–69. IEEE, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Genitic Algorithm Particle Swarm Optimization Classification

Powered by PhDFocusTM