Disclosure Model of Capital Accounting Information Based on Immune Particle Swarm Optimization Algorithm

2021 ◽  
Vol 7 (6) ◽  
pp. 6332-6347
Author(s):  
Yu Ni

The effectiveness of capital market and the allocation of social resources depend on the disclosure of capital accounting information. In order to analyze the tendency of capital accounting information disclosure, this paper proposes a disclosure model of capital accounting information based on immune particle swarm algorithm. There are many factors that affect the tendency of capital accounting information disclosure. We should give priority to corporate governance level and financial status level to construct the impact index system of capital accounting information disclosure. The capital accounting information disclosure model was constructed to establish the functional relationship between each factor variable and disclosure tendency. Particle concentration was maintained through immune memory and self-regulation mechanism to ensure the diversity of the population, which avoids the traditional shortcomings of particle swarm optimization algorithm. Finally, the parameter estimation of capital accounting information disclosure model were completed. The results show that there are four factors affecting the disclosure tendency of capital accounting information, including ownership structure, leverage, growth and audit opinion. The accuracy of the model used in this paper is up to 75%.

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Lei Wang ◽  
Yongqiang Liu

The strengths and weaknesses of correlation algorithm, simulated annealing algorithm, and particle swarm optimization algorithm are studied in this paper. A hybrid optimization algorithm is proposed by drawing upon the three algorithms, and the specific application processes are given. To extract the current fundamental signal, the correlation algorithm is used. To identify the motor dynamic parameter, the filtered stator current signal is simulated using simulated annealing particle swarm algorithm. The simulated annealing particle swarm optimization algorithm effectively incorporates the global optimization ability of simulated annealing algorithm with the fast convergence of particle swarm optimization by comparing the identification results of asynchronous motor with constant torque load and step load.


2013 ◽  
Vol 475-476 ◽  
pp. 956-959 ◽  
Author(s):  
Hao Teng ◽  
Shu Hui Liu ◽  
Yue Hui Chen

In the model of flexible neural tree (FNT), parameters are usually optimized by particle swarm optimization algorithm (PSO). Because PSO has many shortcomings such as being easily trapped in local optimal solution and so on, an improved algorithm based on quantum-behaved particle swarm optimization (QPSO) is presented. It is combined with the factor of speed, gather and disturbance, so as to be used to optimize the parameters of FNT. This paper applies the improved quantum particle swarm optimization algorithm to the neural tree, and compares it with the standard particle swarm algorithm in the optimization of FNT. The result shows that the proposed algorithm is with a better expression, thus improves the performance of the FNT.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Bingsheng Chen ◽  
Huijie Chen ◽  
Mengshan Li

Feature selection can classify the data with irrelevant features and improve the accuracy of data classification in pattern classification. At present, back propagation (BP) neural network and particle swarm optimization algorithm can be well combined with feature selection. On this basis, this paper adds interference factors to BP neural network and particle swarm optimization algorithm to improve the accuracy and practicability of feature selection. This paper summarizes the basic methods and requirements for feature selection and combines the benefits of global optimization with the feedback mechanism of BP neural networks to feature based on backpropagation and particle swarm optimization (BP-PSO). Firstly, a chaotic model is introduced to increase the diversity of particles in the initial process of particle swarm optimization, and an adaptive factor is introduced to enhance the global search ability of the algorithm. Then, the number of features is optimized to reduce the number of features on the basis of ensuring the accuracy of feature selection. Finally, different data sets are introduced to test the accuracy of feature selection, and the evaluation mechanisms of encapsulation mode and filtering mode are used to verify the practicability of the model. The results show that the average accuracy of BP-PSO is 8.65% higher than the suboptimal NDFs model in different data sets, and the performance of BP-PSO is 2.31% to 18.62% higher than the benchmark method in all data sets. It shows that BP-PSO can select more distinguishing feature subsets, which verifies the accuracy and practicability of this model.


2010 ◽  
Vol 97-101 ◽  
pp. 3353-3356
Author(s):  
Wei Chen ◽  
Xian Hong Han ◽  
Xiong Hui Zhou ◽  
Xue Wei Ge

As a new plastic process technique, Gas-assisted injection molding has many advantages comparing to the traditional injection molding. Meanwhile, Optimization of Gas-assisted injection molding is more complex since many additional parameters have been introduced to the process. In this paper, a hybrid optimization approach based on metamodeling and particle swarm optimization algorithm is proposed and applied for Gas-assisted injection molding. Moreover, the validation of the approach will be illustrated through the optimization process of a real panel.


2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Jinchao Li ◽  
Jinying Li ◽  
Dongxiao Niu ◽  
Yunna Wu

A parallel adaptive particle swarm optimization algorithm (PAPSO) is proposed for economic/environmental power dispatch, which can overcome the premature characteristic, the slow-speed convergence in the late evolutionary phase, and lacking good direction in particles’ evolutionary process. A search population is randomly divided into several subpopulations. Then for each subpopulation, the optimal solution is searched synchronously using the proposed method, and thus parallel computing is realized. To avoid converging to a local optimum, a crossover operator is introduced to exchange the information among the subpopulations and the diversity of population is sustained simultaneously. Simulation results show that the proposed algorithm can effectively solve the economic/environmental operation problem of hydropower generating units. Performance comparisons show that the solution from the proposed method is better than those from the conventional particle swarm algorithm and other optimization algorithms.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Weitian Lin ◽  
Zhigang Lian ◽  
Xingsheng Gu ◽  
Bin Jiao

Particle swarm optimization algorithm (PSOA) is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA), and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA). Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Kangge Zou ◽  
Yanmin Liu ◽  
Shihua Wang ◽  
Nana Li ◽  
Yaowei Wu

When faced with complex optimization problems with multiple objectives and multiple variables, many multiobjective particle swarm algorithms are prone to premature convergence. To enhance the convergence and diversity of the multiobjective particle swarm algorithm, a multiobjective particle swarm optimization algorithm based on the grid technique and multistrategy (GTMSMOPSO) is proposed. The algorithm randomly uses one of two different evaluation index strategies (convergence evaluation index and distribution evaluation index) combined with the grid technique to enhance the diversity and convergence of the population and improve the probability of particles flying to the real Pareto front. A combination of grid technology and a mixed evaluation index strategy is used to maintain the external archive to avoid removing particles with better convergence based only on particle density, which leads to population degradation and affects the particle exploitation ability. At the same time, a variation operation is proposed to avoid rapid degradation of the population, which enhances the particle search capability. The simulation results show that the proposed algorithm has better convergence and distribution than CMOPSO, NSGAII, MOEAD, MOPSOCD, and NMPSO.


2021 ◽  
Vol 2138 (1) ◽  
pp. 012008
Author(s):  
Cun Li ◽  
Ding Yuan ◽  
Gaige Liang ◽  
Lu Liu ◽  
Xuedong Jiang

Abstract With the increasingly complex structure of the transmission system, the impact of power outage caused by faults in the power grid is becoming greater and greater. The power grid shall cut off the maintenance of line equipment to ensure the power supply safety of the system. During the outage maintenance period, how to achieve safe maintenance and low-cost impact is the main content of outage control. Aiming at the problem of outage maintenance, a particle swarm optimization algorithm with the goal of minimum impact, economic optimization and shortest maintenance time is proposed. The game theory is used to select the optimal solution from the solutions of particle swarm optimization algorithm to solve the multi-objective function, so as to improve and ensure the population diversity, realize the efficiency and economy of outage maintenance, and meet the needs of outage plan of large power grid. The effectiveness of the proposed algorithm is further verified by comparing multi class baseline experiments.


Sign in / Sign up

Export Citation Format

Share Document