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...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Asıl Yazarlar: Hasan Aljabbouli, Abdullah Albizri, Antoine Harfouche
Materyal Türü: Artigo
Dil:Inglês
Baskı/Yayın Bilgisi: MDPI AG 2020-09-01
Seri Bilgileri:Informatics
Konular:
K-means algorithm
data clustering
Kd-tree structure
Online Erişim:https://www.mdpi.com/2227-9709/7/4/38
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Benzer Materyaller