Adaptive Density Subgraph Clustering

聚类分析 计算机科学 人工智能
作者
Hongjie Jia,Yuhao Wu,Qirong Mao,Yang Li,Heping Song
出处
期刊:IEEE Transactions on Computational Social Systems [Institute of Electrical and Electronics Engineers]
卷期号:11 (4): 5468-5482 被引量:18
标识
DOI:10.1109/tcss.2024.3370669
摘要

Density peak clustering (DPC) has garnered growing interest over recent decades due to its capability to identify clusters with diverse shapes and its resilience to the presence of noisy data. Most DPC-based methods exhibit high computational complexity. One approach to mitigate this issue involves utilizing density subgraphs. Nevertheless, the utilization of density subgraphs may impose restrictions on cluster sizes and potentially lead to an excessive number of small clusters. Furthermore, effectively handling these small clusters, whether through merging or separation, to derive accurate results poses a significant challenge, particularly in scenarios where the number of clusters is unknown. To address these challenges, we propose an adaptive density subgraph clustering algorithm (ADSC). ADSC follows a systematic three-step procedure. First, the highdensity regions in the dataset are recognized as density subgraphs based on k-nearest neighbor (KNN) density. Second, the initial clustering is carried out by utilizing an automated mechanism to identify the important density subgraphs and allocate outliers. Last, the obtained initial clustering results are further refined in an adaptive manner using the cluster self-ensemble technique, ultimately yielding the final clustering outcomes. The clustering performance of the proposed ADSC algorithm is evaluated on nineteen benchmark datasets. The experimental results demonstrate that ADSC possesses the ability to automatically determine the optimal number of clusters from intricate density data, all while maintaining high clustering efficiency. Comparative analysis against other well-known density clustering algorithms that require prior knowledge of cluster numbers reveals that ADSC consistently achieves comparable or superior clustering results.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
1秒前
myco的应助被怡然从雪采纳,获得10
1秒前
111完成签到 ,获得积分10
1秒前
JM完成签到,获得积分10
1秒前
zxy的应助被生动万言采纳,获得10
1秒前
AA发布了新的文献求助10
1秒前
ztx完成签到,获得积分10
1秒前
风吹麦浪的应助被雪雪采纳,获得10
2秒前
2秒前
李健的应助被Denmark采纳,获得10
3秒前
Zz发布了新的文献求助10
3秒前
kjdgahdg发布了新的文献求助10
3秒前
pota_o发布了新的文献求助10
4秒前
Burger完成签到 ,获得积分10
4秒前
wdz完成签到 ,获得积分10
4秒前
4秒前
FENG完成签到 ,获得积分10
5秒前
姜菡完成签到 ,获得积分10
5秒前
66完成签到,获得积分10
5秒前
6秒前
General发布了新的文献求助10
6秒前
Luxi发布了新的文献求助10
7秒前
完美焦完成签到,获得积分20
8秒前
zhiyuanli发布了新的文献求助10
10秒前
荼蘼发布了新的文献求助10
10秒前
11秒前
Phil完成签到,获得积分10
12秒前
13秒前
花呗完成签到,获得积分10
15秒前
lala完成签到 ,获得积分10
15秒前
YU完成签到 ,获得积分20
15秒前
北枝发布了新的文献求助10
16秒前
17秒前
Ecokarster完成签到,获得积分10
18秒前
18秒前
彭于晏的应助被Luxi采纳,获得10
19秒前
tyuuoooo完成签到 ,获得积分10
20秒前
yeahhh完成签到,获得积分20
20秒前
li完成签到,获得积分10
20秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
plantTFDB 508
Resource Recovery Handbook 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8175157
求助须知:如何正确求助?哪些是违规求助? 9566975
关于积分的说明 21789458
捐赠科研通 7769647
什么是DOI,文献DOI怎么找? 3431836
关于科研通互助平台的介绍 2556078
邀请新用户注册赠送积分活动 2477241