A Fast Community Detection Algorithm based on Clustering Coefficient

摘要

Community detecting has always been a hot topic in the complex network research area, the fast and accurate community detection can provide a good foundation for the research of complex network nature. With the number of network nodes increasing, the structure of network becomes complicated, the traditional community detection becomes more unpractical for they are all based on global information of network. We offered a local community detection algorithm which didn't need to know the whole complex network information, it just beginning with a node as initial community and computing the intensity between the initial node and its adjacent nodes. And add its adjacent nodes to community gradually; eventually get this node community structure. Above all, this method can achieve global network community detection. We applied this method to American College football network and dolphin social network, and experiment results show accuracy and feasibility.