.png){kind=icon}
返回
A NOVEL GRID-BASED CLUSTERING ALGORITHM
.png){kind=icon}
OA
AI
DOI：10.2478/jaiscr-2021-0019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 kth nearest neighbor. Experimental results have been obtained for several different datasets and they confirm a very good performance of the newly proposed method.
Keyword:
data mining
grid-based clustering
grid structure
期刊
IF:
2.4
论文数:
170
被引数:
459
机构
引用论文
.png){kind=icon}
Optical sensors based on III-nitride photodetectors for flame sensing and combustion monitoring
PREAI
分享收藏分享收藏
查看更多内容