Premium
Adaptive affinity propagation algorithm based on new strategy of dynamic damping factor and preference
Author(s) -
Hu Jiusong,
Liu Hongli,
Yan Zhi
Publication year - 2019
Publication title -
ieej transactions on electrical and electronic engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 30
eISSN - 1931-4981
pISSN - 1931-4973
DOI - 10.1002/tee.22792
Subject(s) - preference , convergence (economics) , scope (computer science) , algorithm , computer science , oscillation (cell signaling) , damping factor , factor (programming language) , mathematical optimization , control theory (sociology) , mathematics , engineering , artificial intelligence , voltage , statistics , control (management) , biology , electrical engineering , economics , genetics , programming language , economic growth , input impedance
The affinity propagation algorithm has been extensively applied in various fields. However, it is still faces two severe challenges in actual applications: one is that the algorithm may be nonconvergent; and the other is that the convergence speed is low. Aiming at solving these two problems, an adaptive affinity propagation algorithm based on a new strategy of dynamic damping factor and preference is proposed in this paper. On one hand, the dynamic damping factor changes the factor value according to the check state of oscillation to eliminate and escape from the oscillation. On the other hand, dynamic preference adjusts the value of the preference based on the bisection and memory tuple to reduce the search scope of the target preferences continuously. Simulation results show that the proposed algorithms can solve the potential nonconvergence problem effectively and reduce the time consumed significantly. © 2018 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.