.png){kind=icon}
返回
Generalized black hole clustering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2023.11.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Black Hole Clustering (BHC) algorithm is a density-based partitional clustering method inspired by the Density-based Spatial Clustering of Applications with Noise (DBSCAN). It does not require the number of clusters nor the computation of the pair-wise distance matrix between the data points, making it faster than DBSCAN. Also, it only needs one parameter that is intuitively easier to set than the epsilon parameter of DBSCAN. However, BHC needs the allocation of the so-called black holes that have to be linearly independent, making the algorithm in its current version suitable only for two or three-dimensional data sets. In this paper, we propose a generalized version of the black hole clustering algorithm (GBHC) by introducing a novel black hole allocation procedure for higher-dimensional data spaces. Furthermore, the proposed method is data-independent, so we have to run it once to obtain the black hole positions for all finite-dimensional metric spaces. We performed extensive computational experiments to compare GBHC with DBSCAN. The results show that both algorithms obtain comparable clustering solutions. GBHC, however, outperforms DBSCAN in computational complexity and explainability.
Keyword:
Density-based clustering
Pattern recognition
Data mining
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
A visible light active, carbon–nitrogen–sulfur co-doped TiO2/g-C3N4 Z-scheme heterojunction as an effective photocatalyst to remove dye pollutants.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏Psychological characteristics and biofeedback mitigation in preadolescents with eating disorders
PREAI
分享收藏分享收藏
查看更多内容