DISCERN: diversity-based selection of centroids for k-estimation and rapid non-stochastic clustering

One of the applications of center-based clustering algorithms such as K-means is partitioning data points into K clusters. In some examples, the feature space relates to the underlying problem we are trying to solve, and sometimes we can obtain a suitable feature space. Nevertheless, while K-means i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of machine learning and cybernetics Jg. 12; H. 3; S. 635 - 649
Hauptverfasser: Hassani, Ali, Iranmanesh, Amir, Eftekhari, Mahdi, Salemi, Abbas
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2021
Springer Nature B.V
Schlagworte:
Algorithms
Artificial Intelligence
Centroids
Clustering
Complex Systems
Computational Intelligence
Control
Data points
Deep learning
Engineering
Machine learning
Mechatronics
Original Article
Pattern Recognition
Robotics
Systems Biology
Deterministic K-means
Clustering
Estimating the number of clusters
Unsupervised learning
K-means initialization
ISSN:1868-8071, 1868-808X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:One of the applications of center-based clustering algorithms such as K-means is partitioning data points into K clusters. In some examples, the feature space relates to the underlying problem we are trying to solve, and sometimes we can obtain a suitable feature space. Nevertheless, while K-means is one of the most efficient offline clustering algorithms, it is not equipped to estimate the number of clusters, which is useful in some practical cases. Other practical methods which do are simply too complex, as they require at least one run of K-means for each possible K . In order to address this issue, we propose a K-means initialization similar to K-means++, which would be able to estimate K based on the feature space while finding suitable initial centroids for K-means in a deterministic manner. Then we compare the proposed method, DISCERN, with a few of the most practical K estimation methods, while also comparing clustering results of K-means when initialized randomly, using K-means++ and using DISCERN. The results show improvement in both the estimation and final clustering performance.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1868-8071
1868-808X
DOI:10.1007/s13042-020-01193-5