mlsanityData to 14 Oct 2026

An improved clustering-based multi-swarm PSO using local diversification and topology information

arXiv 2511.17571 ↗First posted 14 Nov 2025cs.NE cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Multi-swarm particle optimisation algorithms are gaining popularity due to their ability to locate multiple optimum points concurrently. In this family of algorithms, clustering-based multi-swarm algorithms are among the most effective techniques that join the closest particles together to form independent niche swarms that exploit potential promising regions. However, most clustering-based multi-swarms are Euclidean distance-based and only inquire about the potential of one peak within a cluster and thus can lose multiple peaks due to poor resolution. In a bid to improve the peak detection ratio, the current study proposes two enhancements. First, a preliminary local search across initial particles is proposed to ensure that each local region is sufficiently scouted prior to particle collaboration. Secondly, an investigative clustering approach that performs concavity analysis is proposed to evaluate the potential for several sub-niches within a single cluster. An improved clustering-based multi-swarm PSO (TImPSO) has resulted from these enhancements and has been tested against three competing algorithms in the same family using the IEEE CEC2013 niching datasets, resulting in an improved peak ratio for almost all the test functions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 33 references that are in the map. First posted on arXiv 14 Nov 2025.

Builds on

1 of 33 references.

References · 1

  1. 2025Estimating the Optimal Number of Clusters in Categorical Data Clustering by Silhouette Coefficientcited by 6

Built on by

Not cited yet.