Abstract
The artificial neural network (ANN) is one of the most accurate and commonly used machine-learning techniques and can learn even complex data by employing metaheuristic algorithms. Harmony search (HS) is a metaheuristic algorithm that imitates the process by which musicians tune their instruments to achieve perfect harmony. Global-best harmony search(GHS) is an effective variant of the HS algorithm that borrows the concept of gbest (globalbest) from particle-swarm optimization (PSO) to improve the performance of HS. Employing a multi-population technique improves the convergence of the algorithm. The master-slave technique is one of the most powerful multi-population techniques. This paper proposes a cooperative-competitive master-slave multi-population GHS (CC-GHS) to train the ANN. To provide the proposed CC-GHS algorithm with strong abilities in both exploration and exploitation, a competitive master-slave strategy (Com-GHS)is interacted with a cooperative master-slave strategy(Coo-GHS). A probabilistic variable is employed to achieve a good balance between cooperativeness and competitiveness. The method is tested on benchmark classification and time-series prediction problems, and statistical analyses demonstrate the ability of the proposed method. The CC-GHS is also applied to a real-world water-quality prediction problem with promising results.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
