J4 ›› 2011, Vol. 46 ›› Issue (5): 86-90.
• Articles •
WANG Li, ZHANG Jing-yang, XU Li-heng
Aimed at the problem of distortion in the static network and higher time complexity in the dynamic network, a overlap community detecting algorithm for a dynamic network is proposed, in which the idea is that the edge of the maximum edge betweenness or node of the maximum split betweenness is the key link edge or node. Considering the dynamics and overlapping in the network community, communities found is achieved, based on removing the edge of maximum edge betweenness or dividing the point of maximum split betweenness. Finally, under the control of community detection by modularity, the community structure becomes more reasonable.
dynamic network; overlap community; edge(split)betweenness; modularity
WANG Li, ZHANG Jing-yang, XU Li-heng. A dynamic network overlapping communities detecting algorithm based on local betweenness[J].J4, 2011, 46(5): 86-90.
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks