A Fast Community Detection Algorithm based on Clustering Coefficient

DOI

10.2991/icmeit-19.2019.100How to use a DOI?

Keywords

Community detection; Clustering coefficient.

Abstract

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.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Run Zheng
PY  - 2019/04
DA  - 2019/04
TI  - A Fast Community Detection Algorithm based on Clustering Coefficient
BT  - Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)
PB  - Atlantis Press
SP  - 626
EP  - 633
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmeit-19.2019.100
DO  - 10.2991/icmeit-19.2019.100
ID  - Zheng2019/04
ER  -