A Novel Grid-Based Clustering Algorithm
Artur Starczewski, Magdalena Scherer, Wojciech Książek, Maciej Dębski, Lipo Wang
Abstract
Abstract Data clustering is an important method used to discover naturally occurring structures in datasets. One of the most popular approaches is the grid-based concept of clustering algorithms. This kind of method is characterized by a fast processing time and it can also discover clusters of arbitrary shapes in datasets. These properties allow these methods to be used in many different applications. Researchers have created many versions of the clustering method using the grid-based approach. However, the key issue is the right choice of the number of grid cells. This paper proposes a novel grid-based algorithm which uses a method for an automatic determining of the number of grid cells. This method is based on the k dist function which computes the distance between each element of a dataset and its k th nearest neighbor. Experimental results have been obtained for several different datasets and they confirm a very good performance of the newly proposed method.