.png){kind=icon}
返回
An Efficient Spectral Clustering Algorithm Based on Granular-Ball
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2023.3249475.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In order to solve the problem that the traditional spectral clustering algorithm is time-consuming and resource consuming when applied to large-scale data, resulting in poor clustering effect or even unable to cluster, this paper proposes a spectral clustering algorithm based on granular-ball(GBSC). The algorithm changes the construction method of the similarity matrix. Based on granular-ball, the size of the similarity matrix is greatly reduced, and the construction of the similarity matrix is more reasonable. Experimental results show that the proposed algorithm achieves better speedup ratio, less memory consumption and stronger anti noise performance while achieving similar clustering results to the traditional spectral clustering algorithm. Suppose the number of granular-balls is m, n is the number of points in the dataset, and m << n, the time complexity of GBSC is O(m(3)). It is proved that GBSC has good adaptability to large-scale datasets. All codes have been released at https://github.com/xjnine/GBSC.
Keyword:
Clustering
granular computing
granular-ball
spectral clustering
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
暂无机构信息
引用论文
GMM clustering for heating load patterns in-depth identification and prediction model accuracy improvement of district heating system.png)
ENERGY AND BUILDINGS
ENERGY AND BUILDINGSIF7.1
PREAI
分享收藏GBNRS: A Novel Rough Set Algorithm for Fast Adaptive Attribute Reduction in ClassificationGBNRS: 一种新的粗糙集分类快速自适应属性约简算法
PREAI
分享收藏
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
PREAI
分享收藏
查看更多内容