A Graph Clustering Algorithm Using Attraction-Force Similarity for Community Detection
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 n...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8598825/ |