The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
An improved Dynamic Search Fireworks Algorithm Optimizes Extreme Learning Machine to Predict Virtual Machine Fault
Abstract
The Dynamic Search Fireworks Algorithm (dynFWA) is an effective algorithm for solving optimization problems. However, dynFWA is easy to fall into local optimal solutions prematurely and it also provides a slow convergence rate. To address these problems, an improved dynFWA (IdynFWA) is proposed in this chapter. In IdynFWA, the population is first initialized based on opposition-based learning. The adaptive mutation is proposed for the core firework (CF) which chooses whether to use Gaussian mutation or Levy mutation for the CF according to the mutation probability. A new selection strategy, namely disruptive selection, is proposed to maintain the diversity of the algorithm. The results show that the proposed algorithm achieves better overall performance on the standard test functions. Meanwhile, IdynFWA is used to optimize the Extreme Learning Machine (ELM), and a virtual machine fault warning model is proposed based on ELM optimized by IdynFWA. The results show that this model can achieve higher accuracy and better stability to some extent.
Related Content
|
P. Chitra, A. Saleem Raja, V. Sivakumar.
© 2024.
24 pages.
|
|
K. Ezhilarasan, K. Somasundaram, T. Kalaiselvi, Praveenkumar Somasundaram, S. Karthigai Selvi, A. Jeevarekha.
© 2024.
36 pages.
|
|
Kande Archana, V. Kamakshi Prasad, M. Ashok.
© 2024.
17 pages.
|
|
Ritesh Kumar Jain, Kamal Kant Hiran.
© 2024.
23 pages.
|
|
U. Vignesh, R. Elakya.
© 2024.
13 pages.
|
|
S. Karthigai Selvi, R. Siva Shankar, K. Ezhilarasan.
© 2024.
16 pages.
|
|
Vemasani Varshini, Maheswari Raja, Sharath Kumar Jagannathan.
© 2024.
20 pages.
|
|
|