.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Complex network
community discovery
graph clustering
similarity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
Networks of bZIP Protein-Protein Interactions Diversified Over a Billion Years of Evolution.png)
Science
OAAI
ScienceIF0
OAAI分享收藏Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
PREAI
分享收藏Potential Negative Consequences of Adding Phosphorus‐Based Fertilizers to Immobilize Lead in Soil
PREAI
分享收藏CAMAS: A cluster-aware multiagent system for attributed graph clusteringINFORMATION FUSION
INFORMATION FUSIONIF15.5
PREAI
分享收藏
查看更多内容