IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Time and Frequency Analysis of Particle Swarm Trajectories for Cognitive Machines

Time and Frequency Analysis of Particle Swarm Trajectories for Cognitive Machines
View Sample PDF
Author(s): Dario Schor (University of Manitoba, Canada)and Witold Kinsner (University of Manitoba, Canada)
Copyright: 2013
Pages: 26
Source title: Cognitive Informatics for Revealing Human Cognition: Knowledge Manipulations in Natural Intelligence
Source Author(s)/Editor(s): Yingxu Wang (University of Calgary, Canada)
DOI: 10.4018/978-1-4666-2476-4.ch018

Purchase

View Time and Frequency Analysis of Particle Swarm Trajectories for Cognitive Machines on the publisher's website for pricing and purchasing information.

Abstract

This paper examines the inherited persistent behavior of particle swarm optimization and its implications to cognitive machines. The performance of the algorithm is studied through an average particle’s trajectory through the parameter space of the Sphere and Rastrigin function. The trajectories are decomposed into position and velocity along each dimension optimized. A threshold is defined to separate the transient period, where the particle is moving towards a solution using information about the position of its best neighbors, from the steady state reached when the particles explore the local area surrounding the solution to the system. Using a combination of time and frequency domain techniques, the inherited long-term dependencies that drive the algorithm are discerned. Experimental results show the particles balance exploration of the parameter space with the correlated goal oriented trajectory driven by their social interactions. The information learned from this analysis can be used to extract complexity measures to classify the behavior and control of particle swarm optimization, and make proper decisions on what to do next. This novel analysis of a particle trajectory in the time and frequency domains presents clear advantages of particle swarm optimization and inherent properties that make this optimization algorithm a suitable choice for use in cognitive machines.

Related Content

Hemalatha J. J., Bala Subramanian Chokkalingam, Vivek V., Sekar Mohan. © 2023. 14 pages.
R. Muthuselvi, G. Nirmala. © 2023. 12 pages.
Jerritta Selvaraj, Arun Sahayadhas. © 2023. 16 pages.
Vidhya R., Sandhia G. K., Jansi K. R., Nagadevi S., Jeya R.. © 2023. 8 pages.
Shanthalakshmi Revathy J., Uma Maheswari N., Sasikala S.. © 2023. 13 pages.
Uma N. Dulhare, Shaik Rasool. © 2023. 29 pages.
R. Nareshkumar, G. Suseela, K. Nimala, G. Niranjana. © 2023. 22 pages.
Body Bottom