.png){kind=icon}
返回
Adaptive grid-based forest-like clustering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2022.01.089.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an adaptive grid-based clustering algorithm called as AGFC, which uses a forest-like query structure to sequentially discovers multiple arbitrary-shaped clusters from the grid. The main advantage of AGFC is that it can effectively generate a reasonable grid division with a simple startup parameter. This method determines the appropriate grid division width through the minimum gap between the peaks and valleys of the density curve in a specific dimension, which depends on the distribution of the sample, to overcome the subjectivity of manual determination to a certain extent. Furthermore, in the forest-like query structure, it constructs a Aggregation Judgment criterion for high-density cells to find out the possible clusters through the merging of cells. Finally, using the Re clustering process to eliminate very small clusters and further repairing the edge areas of the main clusters. The experimental results show that the proposed method can obtain competitive results under the premise of automatically determining the grid. (C) 2022 Elsevier B.V. All rights reserved.
Keyword:
Clustering
Adaptive-grid
Forest-structure
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
CutESC: Cutting edge spatial clustering technique based on proximity graphsCutESC: 基于邻近图的前沿空间聚类技术.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
分享收藏分享收藏
查看更多内容