Tolerance Granulation Based Community Detection Algorithm

Shu Zhao

doi:10.1109/TST.2015.7350014

Tolerance Granulation Based Community Detection Algorithm

2015-12-01

6

OA

AI

DOI：10.1109/TST.2015.7350014

原文链接

查看原文

摘要

En 中文

Community structure is one of the most important features in real networks and reveals the internal organization of the vertices. Uncovering accurate community structure is effective for understanding and exploiting networks. Tolerance Granulation based Community Detection Algorithm (TGCDA) is proposed in this paper, which uses tolerance relation (namely tolerance granulation) to granulate a network hierarchically. Firstly, TGCDA relies on the tolerance relation among vertices to form an initial granule set. Then granules in this set which satisfied granulation coefficient are hierarchically merged by tolerance granulation operation. The process is finished till the granule set includes one granule. Finally, select a granule set with maximum granulation criterion to handle overlapping vertices among some granules. The overlapping vertices are merged into corresponding granules based on their degrees of affiliation to realize the community partition of complex networks. The final granules are regarded as communities so that the granulation for a network is actually the community partition of the network. Experiments on several datasets show our algorithm is effective and it can identify the community structure more accurately. On real world networks, TGCDA achieves Normalized Mutual Information (NMI) accuracy 17.55% higher than NFA averagely and on synthetic random networks, the NMI accuracy is also improved. For some networks which have a clear community structure, TGCDA is more effective and can detect more accurate community structure than other algorithms.

Keyword:

tolerance relation

community

tolerance granulation

Normalized Mutual Information (NMI) accuracy

Tolerance Granulation Based Community Detection Algorithm

摘要

AI总结

期刊

机构

引用论文