Binary system particle swarm optimization (BSPSO) algorithm-based chaotic time series prediction method
A chaotic time series, particle swarm optimization technology, applied in the field of digital signal processing
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0045] A chaotic time series prediction method based on binary particle swarm optimization algorithm, such as figure 1 As shown, the steps are as follows:
[0046] 1) Particle swarm initialization: initialize the position and velocity of the particles, and set the size of the particle swarm;
[0047] Take the number of particle swarms as 30-50, and set the total number of iterations as T; using the BPSO algorithm, the algorithm can be expressed by the following formula:
[0048] v ij (t+1)=wv ij (t)+c 1 r 1j (t)[p best (t)-x ij (t)]+c 2 r 2 (t)[g best (t)-x ij (t)],
[0049] x ij (t+1)=x ij (t)+v ij (t+1). (1)
[0050] Where t is the number of iterations of the particle swarm, x ij (t) represents the position of the i-th particle in the t-th iteration, v ij (t) stands for x ij (t) the probability of taking a value of 1, j represents the dimension of the particle position, c 1 and c 2 are constants, usually take the value of 2, r 1 and r 2 is a random numb...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com