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 concept of clustering algorithms. This kind of method is characterized by a fast processing time and it can also discover clusters of arbitrary sha...

Full description

Saved in:
Bibliographic Details
Main Authors: Starczewski, Artur, Scherer, Magdalena M., Ksiek, Wojciech, Dȩbski, Maciej, Wang, Lipo
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/10356/153970
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-153970
record_format dspace
spelling sg-ntu-dr.10356-1539702022-01-17T08:09:57Z A novel grid-based clustering algorithm Starczewski, Artur Scherer, Magdalena M. Ksiek, Wojciech Dȩbski, Maciej Wang, Lipo School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Data Mining Grid-Based Clustering 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. Published version The paper is financed under the program of the Polish Minister of Science and Higher Education under the name ”Regional Initiative of Excellence” in the years 2019-2022; project number 020/RID/2018/19; the amount of financing PLN 12,000,000.00. 2022-01-17T08:09:57Z 2022-01-17T08:09:57Z 2021 Journal Article Starczewski, A., Scherer, M. M., Ksiek, W., Dȩbski, M. & Wang, L. (2021). A novel grid-based clustering algorithm. Journal of Artificial Intelligence and Soft Computing Research, 11(4), 319-330. https://dx.doi.org/10.2478/jaiscr-2021-0019 2083-2567 https://hdl.handle.net/10356/153970 10.2478/jaiscr-2021-0019 2-s2.0-85117716625 4 11 319 330 en Journal of Artificial Intelligence and Soft Computing Research © 2021 Artur Starczewski et al., published by Sciendo This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Data Mining
Grid-Based Clustering
spellingShingle Engineering::Electrical and electronic engineering
Data Mining
Grid-Based Clustering
Starczewski, Artur
Scherer, Magdalena M.
Ksiek, Wojciech
Dȩbski, Maciej
Wang, Lipo
A novel grid-based clustering algorithm
description 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.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Starczewski, Artur
Scherer, Magdalena M.
Ksiek, Wojciech
Dȩbski, Maciej
Wang, Lipo
format Article
author Starczewski, Artur
Scherer, Magdalena M.
Ksiek, Wojciech
Dȩbski, Maciej
Wang, Lipo
author_sort Starczewski, Artur
title A novel grid-based clustering algorithm
title_short A novel grid-based clustering algorithm
title_full A novel grid-based clustering algorithm
title_fullStr A novel grid-based clustering algorithm
title_full_unstemmed A novel grid-based clustering algorithm
title_sort novel grid-based clustering algorithm
publishDate 2022
url https://hdl.handle.net/10356/153970
_version_ 1722355388711436288