.png){kind=icon}
.png){kind=icon}
Return
A Graph Clustering Algorithm Using Attraction-Force Similarity for Community Detection
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2889312.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph clustering is to partition a large graph into several subgraphs according to the topological structure and node characteristics of the graph. It can discover the community structures of complex networks and thus help researchers better understand the characteristics and structures of complex networks. This paper first proposes the concepts of direct attraction force and indirect attraction force. Then, it defines a new structural similarity, attraction-force similarity. Finally, the AF-Cluster algorithm is proposed based on the attraction-force similarity. Through the experimental analysis, we can conclude that the AF-Cluster algorithm is effective for clustering graph compared with other contrast algorithms.
Keywords:
Complex network
community discovery
graph clustering
similarity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
No organization information available