<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>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 <italic>k<sub>dist</sub></italic> function which computes the distance between each element of a dataset and its <italic>k</italic>th nearest neighbor. Experimental results have been obtained for several different datasets and they confirm a very good performance of the newly proposed method.</p>
</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 kdist function which computes the distance between each element of a dataset and its kth nearest neighbor. Experimental results have been obtained for several different datasets and they confirm a very good performance of the newly proposed method.

A Novel Grid-Based Clustering Algorithm

Department of Intelligent Computer Systems

Faculty of Computer Science and Telecommunications

Journal of Artificial Intelligence and Soft Computing Research

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

{"article-title":"A Novel Grid-Based Clustering Algorithm"}

Data clustering is an important method used to discover naturally occurring structures in datasets. One of the most popular approaches is the grid-based...

A Novel Grid-Based Clustering Algorithm

Published Online: Oct 08, 2021

Page range: 319 - 330

Received: Jan 24, 2021

Accepted: Sep 23, 2021

DOI: https://doi.org/10.2478/jaiscr-2021-0019

Keywords
data mining, grid-based clustering, grid structure

© 2021 Artur Starczewski et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

A Novel Grid-Based Clustering Algorithm

Published Online: Oct 08, 2021

Page range: 319 - 330

Received: Jan 24, 2021

Accepted: Sep 23, 2021

DOI: https://doi.org/10.2478/jaiscr-2021-0019

Keywordsdata mining, grid-based clustering, grid structure

© 2021 Artur Starczewski et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Keywords
data mining, grid-based clustering, grid structure