Next Article in Journal
Deep Learning and Parallel Processing Spatio-Temporal Clustering Unveil New Ionian Distinct Seismic Zone
Previous Article in Journal
Modern Scientific Visualizations on the Web
Open AccessArticle

Tree-Based Algorithm for Stable and Efficient Data Clustering

1
Department of Information Systems, Colorado State University Global, Salida Way, Aurora, CO 80526, USA
2
Department of Information Management & Business Analytics, Montclair State University, Montclair, NJ 07043, USA
3
Department of SEGMI–CEROS, University Paris Nanterre, 92000 Nanterre, France
*
Author to whom correspondence should be addressed.
Received: 31 August 2020 / Revised: 20 September 2020 / Accepted: 22 September 2020 / Published: 27 September 2020
(This article belongs to the Section Machine Learning)
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 structure. The proposed Kd-tree is utilized as a data structure to enhance the choice of initial centers of the clusters and to reduce the number of the nearest neighbor searches required by the algorithm. The developed framework also includes an efficient center insertion technique leading to an incremental operation that overcomes the instability problem of the K-means algorithm. The results of the proposed algorithm were compared with those obtained from the K-means algorithm, K-medoids, and K-means++ in an experiment using six different datasets. The results demonstrated that the proposed algorithm provides superior and more stable clustering solutions. View Full-Text
Keywords: K-means algorithm; data clustering; Kd-tree structure K-means algorithm; data clustering; Kd-tree structure
Show Figures

Figure 1

MDPI and ACS Style

Aljabbouli, H.; Albizri, A.; Harfouche, A. Tree-Based Algorithm for Stable and Efficient Data Clustering. Informatics 2020, 7, 38. https://0-doi-org.brum.beds.ac.uk/10.3390/informatics7040038

AMA Style

Aljabbouli H, Albizri A, Harfouche A. Tree-Based Algorithm for Stable and Efficient Data Clustering. Informatics. 2020; 7(4):38. https://0-doi-org.brum.beds.ac.uk/10.3390/informatics7040038

Chicago/Turabian Style

Aljabbouli, Hasan; Albizri, Abdullah; Harfouche, Antoine. 2020. "Tree-Based Algorithm for Stable and Efficient Data Clustering" Informatics 7, no. 4: 38. https://0-doi-org.brum.beds.ac.uk/10.3390/informatics7040038

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop