Research on community methods based on node-links importance
A common description of community structure is about strong and weak communities.An edge is composed of two nodes,which have a direct impact on the edge by the number of adjacent nodes.In addition,its indirect correlation is the indirect impact of the common neighboring nodes of these two nodes on the rest of the network.Based on these two considerations,a new community discovery algorithm is obtained.This article uses 10 manually generated network datasets with different clarity of community structures,and conducts comparative experiments with several community discovery algorithms.Experimental results have shown that the algorithm proposed in this paper achieves good results on artificially generated network datasets with different community structure clarity,from the perspective of several different evaluation indicators.
the importance of node-linkscentralitycommunity discoverycomplex network
NETL
NSTL
万方数据
