亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

A Fast Granular-Ball-Based Density Peaks Clustering Algorithm for Large-Scale Data

聚类分析 距离矩阵 算法 无监督学习 模式识别(心理学) 计算机科学 比例(比率) 数据点 数学 人工智能 量子力学 物理
作者
Dongdong Cheng,Ya Li,Shuyin Xia,Guoyin Wang,Jinlong Huang,Sulan Zhang
出处
期刊:IEEE transactions on neural networks and learning systems [Institute of Electrical and Electronics Engineers]
卷期号:35 (12): 17202-17215 被引量:178
标识
DOI:10.1109/tnnls.2023.3300916
摘要

Density peaks clustering algorithm (DP) has difficulty in clustering large-scale data, because it requires the distance matrix to compute the density and -distance for each object, which has time complexity. Granular ball (GB) is a coarse-grained representation of data. It is based on the fact 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, such as support vector machine, -nearest neighbor classification, rough set, etc. Inspired by the idea of GB, we introduce it into unsupervised learning for the first time and propose a GB-based DP algorithm, called GB-DP. First, it generates GBs from the original data with an unsupervised partitioning method. Then, it defines the density of GBs, instead of the density of objects, according to the centers, radius, and distances between its members and centers, without setting any parameters. After that, it computes the distance between the centers of GBs as the distance between GBs and defines the -distance of GBs. Finally, it uses GBs' density and -distance to plot the decision graph, employs DP algorithm to cluster them, and expands the clustering result to the original data. Since there is no need to calculate the distance between any two objects and the number of GBs is far less than the scale of a data, it greatly reduces the running time of DP algorithm. By comparing with -means, ball -means, DP, DPC-KNN-PCA, FastDPeak, and DLORE-DP, GB-DP can get similar or even better clustering results in much less running time without setting any parameters. The source code is available at https://github.com/DongdongCheng/GB-DP.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
纯情的阁发布了新的文献求助10
1秒前
纯情的阁发布了新的文献求助10
1秒前
纯情的阁发布了新的文献求助10
1秒前
纯情的阁发布了新的文献求助10
1秒前
纯情的阁发布了新的文献求助10
1秒前
纯情的阁发布了新的文献求助10
2秒前
纯情的阁发布了新的文献求助30
2秒前
纯情的阁发布了新的文献求助10
5秒前
纯情的阁发布了新的文献求助30
5秒前
纯情的阁发布了新的文献求助10
5秒前
纯情的阁发布了新的文献求助10
5秒前
纯情的阁发布了新的文献求助10
5秒前
潇洒的血茗完成签到 ,获得积分10
5秒前
5秒前
纯情的阁发布了新的文献求助10
8秒前
9秒前
9秒前
10秒前
赘婿的应助被cam采纳,获得10
11秒前
Maestro_S的应助被科研通管家采纳,获得10
12秒前
香蕉觅云的应助被科研通管家采纳,获得10
12秒前
嘻嘻哈哈的应助被科研通管家采纳,获得10
13秒前
xl的应助被科研通管家采纳,获得10
13秒前
大个的应助被科研通管家采纳,获得20
13秒前
16秒前
16秒前
17秒前
18秒前
董翰完成签到,获得积分10
19秒前
miaomao完成签到,获得积分10
21秒前
今夜白完成签到,获得积分10
21秒前
华仔的应助被dakaein采纳,获得10
21秒前
孤独的富完成签到,获得积分10
22秒前
华仔的应助被科研小白采纳,获得10
22秒前
25秒前
28秒前
28秒前
chenyi完成签到 ,获得积分10
29秒前
30秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
plantTFDB 508
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8172945
求助须知:如何正确求助?哪些是违规求助? 9565447
关于积分的说明 21779948
捐赠科研通 7764804
什么是DOI,文献DOI怎么找? 3431480
关于科研通互助平台的介绍 2555510
邀请新用户注册赠送积分活动 2476564