A Multi-Objective Optimization Algorithm for Center-Based Clustering

Center-based clustering is a set of clustering problems that require finding a single element, a center, to represent an entire cluster. The algorithms that solve this type of problems are very efficient for clustering large and high-dimensional datasets. In this paper, we propose a similar heuristi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Electronic notes in theoretical computer science Ročník 349; s. 49 - 67
Hlavní autori: León, Jared, Chullo-Llave, Boris, Enciso-Rodas, Lauro, Soncco-Álvarez, José Luis
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.06.2020
Predmet:
Approximation Algorithms
Center-Based Clustering
EMAX
Multi-Objective Optimization
Social Spider Optimization
Approximation Algorithms
Center-Based Clustering
Social Spider Optimization
Multi-Objective Optimization
EMAX
ISSN:1571-0661, 1571-0661
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Center-based clustering is a set of clustering problems that require finding a single element, a center, to represent an entire cluster. The algorithms that solve this type of problems are very efficient for clustering large and high-dimensional datasets. In this paper, we propose a similar heuristic used in Lloyd's algorithm to approximately solve (EMAX algorithm) a more robust variation of the k-means problem, namely the EMAX problem. Also, a new center-based clustering algorithm (SSO-C) is proposed, which is based on a swarm intelligence technique called Social Spider Optimization. This algorithm minimizes a multi-objective optimization function defined as a weighted combination of the objective functions of the k-means and EMAX problems. Also, an approximation algorithm for the discrete k-center problem is used as a local search strategy for initializing the population. Results of the experiments showed that SSO-C algorithm is suitable for finding maximum best values, however EMAX algorithm is better in finding median and mean values.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2020.02.012