Pattern Recognition Using Particle Swarm Optimization with Proposed a New Conjugate Gradient Parameter in Unconstrained Optimization

Authors

  • Ban Ahmed Mitras Department of Intelligent Techniques & Operation Research, College of Computer Sciences and Mathematics, University of Mosul
  • Suhaib Abdul Jabbar Department of Computer, University of Mosul Teacher/College of Education for pure science

Keywords:

Particle Swarm Optimization, Pattern recognition, conjugate gradient, conjugancy coefficient, nonlinear programming, nconstrained optimization

Abstract

In this paper, we present modified conjugancy coefficient for the conjugate gradient method. This modification using the extention Dai and Yuan Method to solve non-linear programming problems. The algorithm of particle swarm optimization (PSO) is applied in this work, to coefficients extracted by features extraction techniques. The sufficient descent and the global convergence properties for the proposed algorithm are proved. The numerical results of our finding for the large scale optimization problem are very encouraging comparison with standard methodsThe experimental results showed that PSO can generate excellent recognition results with the minimal set of selected features. Finally, the algorithm PSO based approaches are proposed and the influence of PSO parameters on the performance is evaluated.

 

Published

2016-09-01

Issue

Section

Articles

How to Cite

[1]
“Pattern Recognition Using Particle Swarm Optimization with Proposed a New Conjugate Gradient Parameter in Unconstrained Optimization”, ANJS, vol. 19, no. 3, pp. 138–147, Sep. 2016, Accessed: Apr. 19, 2024. [Online]. Available: https://anjs.edu.iq/index.php/anjs/article/view/219