作者: Ling Wu , Qishan Zhang
DOI: 10.1109/GSIS.2015.7301844
关键词:
摘要: Community structure is a very important characteristic of complex networks, detecting communities within networks has significance in several disciplines like computer science, physics, biology, etc. To some extent, Realworld exhibit overlapping community structure. solve this problem, we devise novel algorithm to identify social with Grey Relational Analysis. This paper presents the edge vector which measure relationships among nodes, and uses balanced closeness degree describe similarity, computes clusters finally obtains The effectiveness efficiency new evaluated by experiments on both real-world computer-generated datasets.