Improved Self-Adaptive ACS Algorithm to Determine the Optimal Number of Clusters

Abstract

A fundamental problem in data clustering is how to determine the correct number of clusters. The k-adaptive medoid set ant colony optimization (ACO) clustering (METACOC-K) algorithm is superior in solving clustering problems. However, METACOC-K does not guarantee in finding the best number of clusters. It assumed the number of clusters based on an adaptive parameter strategy that lacks feedback learning. This has restrained the algorithm in producing compact clusters and the optimal number of clusters. In this paper, a self-adaptive ACO clustering (S-ACOC) algorithm is proposed to produce the optimal number of clusters by incorporating a self-adaptive parameter strategy. The S-ACOC algorithm is a centroid-based algorithm that automatically adjusts the number of clusters during the algorithm run. The selection of the number of clusters is based on a construction graph that reflects the influence of a pheromone in algorithm learning. Experiments were conducted on real-world datasets to evaluate the performance of the proposed algorithm. The external evaluation metrics (purity, F-measure, and entropy) were used to compare the results of the proposed algorithm with other swarm clustering algorithms, including a genetic algorithm (GA), particle swarm optimization (PSO), and METACOC-K. Results showed that S-ACOC provides higher purity (50%) and lower entropy (40%) than GA, PSO, and METACOC-K. Experiments were also performed on several predefined clusters, and results demonstrate that the S-ACOC algorithm is superior to GA, PSO, and METACOC-K. Based on the superior performance, S-ACOC can be used to solve clustering problems in various application domains.

Mapping the Provincial Food Security Conditions in Indonesia Using Cluster Ensemble-Based Mixed Data Clustering-Robust Clustering with Links (CEBMDC-ROCK)

“…Cluster analysis is an essential method in statistical data processing to perform data analysis [12]- [14]. Cluster analysis can be used to group objects or data into a group based on their similarity [15], [16].…”

An improved artificial bee colony with perturbation operators in scout bees’ phase for solving vehicle routing problem with time windows

“…Figure 1. An example of VRPTW Metaheuristics algorithms can be divided into local search and population-based techniques [13], [14]. The local search technique manipulates a single solution by exchanging segments of its components to produce better solutions, whereas the population-based technique uses more than one solution.…”

Improved discrete plant propagation algorithm for solving the traveling salesman problem

“…The ability of meta-heuristic algorithms to address optimization problems, such as TSP, relies on two elements: exploitation and exploration. Exploration refers to the research within the search space of unvisited regions, whereas exploitation refers to the search in the existing problem space regions for good solutions [10]- [12]. Single-based algorithms, including variable neighborhood search [13], simulated annealing [14], and guided local search [15], aim to improve a single candidate solution.…”