Fast Graph Clustering Algorithm Based on Selection of Key Nodes

Fast Graph Clustering Algorithm Based on Selection of Key Nodes

Spectral clustering has attracted extensive attention as a typical graph clustering algorithm among clustering algorithms since it has really strong adaptability to complex data distribution and great clustering effect. However, it is difficult to apply spectral clustering algorithm to large scale d...

Full description

Bibliographic Details
Main Author: YOU Fangzhou, BAI Liang
Format: Article
Language:zho
Published: Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press 2021-10-01
Series:Jisuanji kexue yu tansuo
Subjects:
cluster analysis
graph clustering
spectral clustering
cluster ensemble
selection of key nodes
Online Access:http://fcst.ceaj.org/CN/abstract/abstract2916.shtml

Internet

http://fcst.ceaj.org/CN/abstract/abstract2916.shtml

Similar Items