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...
Main Authors: | Hasan Aljabbouli, Abdullah Albizri, Antoine Harfouche |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-09-01
|
Series: | Informatics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-9709/7/4/38 |
Similar Items
-
A New Algorithm for Large-Scale Geographically Weighted Regression with K-Nearest Neighbors
by: Xiaoyue Yang, et al.
Published: (2023-07-01) -
An efficient approach based on differential evolution algorithm for data clustering
by: Maryam Hosseini, et al.
Published: (2014-06-01) -
A Systematic review of K-means Algorithm Improvement Research for Data Clustering
by: Elham Yalveh, et al.
Published: (2021-12-01) -
An adaptive K-Means Clustering Algorithm and its Application to Face Recognition
by: N. Rajeswari, et al.
Published: (2010-01-01) -
An Efficient Algorithm for Initializing Centroids in K-means Clustering
by: Dr. Ahmed Hussain Aliwy, et al.
Published: (2016-12-01)