Business Commons^™

Tree-Based Algorithm For Stable And Efficient Data Clustering, Hasan Aljabbouli, Abdullah Albizri, Antoine Harfouche

Department of Information Management and Business Analytics Faculty Scholarship and Creative Works

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 …