An Efficient Spectral Clustering Algorithm Based on Granular-Ball

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)....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on knowledge and data engineering Jg. 35; H. 9; S. 9743 - 9753
Hauptverfasser:	Xie, Jiang, Kong, Weiyu, Xia, Shuyin, Wang, Guoyin, Gao, Xinbo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.09.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation algorithms Clustering Clustering algorithms Clustering methods Datasets granular computing granular-ball Machine learning algorithms Matrix decomposition Partitioning algorithms Similarity spectral clustering Time complexity
ISSN:	1041-4347, 1558-2191
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!