GB-DBSCAN: A fast granular-ball based DBSCAN clustering algorithm

数据库扫描 聚类分析 计算机科学 球(数学) 模式识别(心理学) 算法 人工智能 数据挖掘 数学 相关聚类 CURE数据聚类算法 几何学
作者
Dongdong Cheng,Cheng Zhang,Ya Li,Shuyin Xia,Guoyin Wang,Jinlong Huang,Sulan Zhang,Jiang Xie
出处
期刊:Information Sciences [Elsevier BV]
卷期号:674: 120731-120731 被引量:65
标识
DOI:10.1016/j.ins.2024.120731
摘要

Density-Based Spatial Clustering of Applications with Noise (DBSCAN) identifies high-density connected areas as clusters, so that it has advantages in discovering arbitrary-shaped clusters. However, it has difficulty in adjusting parameters and since it needs to scan all data points in turn, its time complexity is O(n2). Granular-ball (GB) is a coarse grained representation of data. It is on the basis of the assumption that an object and its local neighbors have similar distribution and they have high possibility of belonging to the same class. It has been introduced into supervised learning by Xia et al. to improve the efficiency of supervised learning. Inspired by the idea of granular-ball, we introduce it into unsupervised learning and use it to improve the efficiency of DBSCAN, called GB-DBSCAN. The main idea of the proposed algorithm GB-DBSCAN is to employ granular-ball to represent a set of data points and then clustering on granular-balls, instead of the data points. Firstly, we use k-nearest neighbors (KNN) to generate granular-balls, which is a bottom-up strategy, and describe granular-balls according to their centers and radius. Then, the granular-balls are divided into Core-GBs and Non-Core-GBs according to their density. After that, the Core-GBs are merged into clusters according to the idea of DBSCAN and the Non-Core-GBs are assigned to the appropriate clusters. Since the granular-balls' number is much smaller than the size of the objects in a dataset, the running time of DBSCAN is greatly reduced. By comparing with KNN-BLOCK DBSCAN, RNN-DBSCAN, DBSCAN, K-means, DP and SNN-DPC algorithms, the proposed algorithm can get similar or even better clustering result in much less running time.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刘大宝完成签到,获得积分10
1秒前
nature发布了新的文献求助10
1秒前
1秒前
NASA发布了新的文献求助30
1秒前
李爱国的应助被nmn采纳,获得10
2秒前
胡萝卜卜发布了新的文献求助10
2秒前
胡萝卜卜发布了新的文献求助10
2秒前
胡萝卜卜发布了新的文献求助10
3秒前
胡萝卜卜发布了新的文献求助10
3秒前
华无剑的应助被zhuzhenghua采纳,获得10
3秒前
清茶颂歌完成签到,获得积分10
3秒前
3秒前
何英完成签到,获得积分20
4秒前
苍蓝星完成签到,获得积分10
4秒前
5秒前
桐桐的应助被小红采纳,获得10
5秒前
只为更出色完成签到,获得积分10
6秒前
胡萝卜卜发布了新的文献求助10
6秒前
6秒前
仇剑封完成签到,获得积分10
6秒前
小蘑菇的应助被abin采纳,获得10
6秒前
脑洞疼的应助被hhh采纳,获得10
7秒前
传奇3的应助被吱吱采纳,获得30
7秒前
Firsterchao完成签到,获得积分0
7秒前
9秒前
9秒前
10秒前
桐桐的应助被任我采纳,获得10
10秒前
上官若男的应助被普兴强采纳,获得10
11秒前
糊涂涂完成签到,获得积分10
11秒前
null的应助被温暖砖头采纳,获得10
12秒前
陈懿完成签到,获得积分10
12秒前
12秒前
YANGTIAN完成签到,获得积分10
13秒前
13秒前
橙C发布了新的文献求助10
13秒前
13秒前
ho完成签到 ,获得积分10
14秒前
十三月的篇章完成签到,获得积分10
14秒前
14秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
Markov Decision Processes and Reinforcement Learning 700
八旗制度の研究 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8170973
求助须知:如何正确求助?哪些是违规求助? 9563727
关于积分的说明 21771951
捐赠科研通 7762452
什么是DOI,文献DOI怎么找? 3430786
关于科研通互助平台的介绍 2554629
邀请新用户注册赠送积分活动 2475637