Tree-Based Algorithm for Stable and Efficient Data Clustering

The K-means algorithm is a well-known and widely used clustering algorithm due to its simplicity and convergence properties. However, one of the drawbacks of the algorithm is its instability. This paper presents improvements to the K-means algorithm using a K-dimensional tree (Kd-tree) data structur...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsmän: Hasan Aljabbouli, Abdullah Albizri, Antoine Harfouche
Materialtyp: Artigo
Språk:Inglês
Publicerad: MDPI AG 2020-09-01
Serie:Informatics
Ämnen:
K-means algorithm
data clustering
Kd-tree structure
Länkar:https://www.mdpi.com/2227-9709/7/4/38
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk