A Modified MinMax k-Means Algorithm Based on PSO

The MinMax k -means algorithm is widely used to tackle the effect of bad initialization by minimizing the maximum intraclustering errors. Two parameters, including the exponent parameter and memory parameter, are involved in the executive process. Since different parameters have different clustering...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational Intelligence and Neuroscience Jg. 2016; H. 2016; S. 928 - 940-077
Hauptverfasser: Wang, Xiao-Yan, Bai, Yanping
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cairo, Egypt Hindawi Limiteds 2016
Hindawi Publishing Corporation
John Wiley & Sons, Inc
Schlagworte:
Algorithms
Clustering
Colleges & universities
Datasets
Errors
Experiments
Exponents
Intelligence
Mathematical optimization
Mathematical research
Parameter modification
Parameters
ISSN:1687-5265, 1687-5273
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The MinMax k -means algorithm is widely used to tackle the effect of bad initialization by minimizing the maximum intraclustering errors. Two parameters, including the exponent parameter and memory parameter, are involved in the executive process. Since different parameters have different clustering errors, it is crucial to choose appropriate parameters. In the original algorithm, a practical framework is given. Such framework extends the MinMax k -means to automatically adapt the exponent parameter to the data set. It has been believed that if the maximum exponent parameter has been set, then the programme can reach the lowest intraclustering errors. However, our experiments show that this is not always correct. In this paper, we modified the MinMax k -means algorithm by PSO to determine the proper values of parameters which can subject the algorithm to attain the lowest clustering errors. The proposed clustering method is tested on some favorite data sets in several different initial situations and is compared to the k -means algorithm and the original MinMax k -means algorithm. The experimental results indicate that our proposed algorithm can reach the lowest clustering errors automatically.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
Academic Editor: Stefano Squartini
ISSN:1687-5265
1687-5273
DOI:10.1155/2016/4606384