Enhanced K-means re-clustering over dynamic networks

•Introducing a new enhanced K-Means clustering algorithm for dynamic clustering.•Detecting the nodes with the potential of changing their clusters after each change.•Completely local calculations during the dynamic phase.•Self-organizing and error remover system, the clusters and centroids are alway...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems with applications 2019-10, Vol.132, p.126-140
Hauptverfasser:	Fadaei, AmirHosein, Khasteh, Seyed Hossein
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Centroids Clustering Computer simulation Dynamic networks Inserts K-means Market segmentation Mathematical analysis Nodes Re-clustering
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!