Research breakthrough possible @S-Logix pro@slogix.in

Office Address

  • 2nd Floor, #7a, High School Road, Secretariat Colony Ambattur, Chennai-600053 (Landmark: SRM School) Tamil Nadu, India
  • pro@slogix.in
  • +91- 81240 01111

Social List

Clustering performance comparison of new generation meta-heuristic algorithms - 2017

clustering-performance-comparison-of-new-generation-meta-heuristic-algorithms.jpg

Clustering performance comparison of new generation meta-heuristic algorithms - | S-Logix

Research Area:  Metaheuristic Computing

Abstract:

This article addressed two new generation meta-heuristic algorithms that are introduced to the literature recently. These algorithms, proved their performance by benchmark standard test functions, are implemented to solve clustering problems. One of these algorithms called Ions Motion Optimization and it is established from the motions of ions in nature. The other algorithm is Weighted Superposition Attraction and it is predicated on two fundamental principles, which are “attracted movements of agents” and “superposition”. Both of the algorithms are applied to different benchmark data sets consisted of continuous, categorical and mixed variables, and their performances are compared to Particle Swarm Optimization and Artificial Bee Colony algorithms. To eliminate the infeasible solutions, Debs rule is integrated into the algorithms. The comparison results indicated that both of the algorithms, Ions Motion Optimization and Weighted Superposition Attraction, are competitive solution approaches for clustering problems.

Keywords:  
Cluster analysis
Ions motion algorithm
Weighted superposition attraction algorithm
Particle swarm optimization algorithm
Artificial bee colony algorithm.

Author(s) Name:  Lale ̈Ozbakır , Fatma Turna

Journal name:  Knowledge-Based Systems

Conferrence name:  

Publisher name:  ELSEVIER

DOI:  10.1016/j.knosys.2017.05.023

Volume Information:  Volume 130