Abstract

Community structure is one of the most important topological properties of complex networks, in which the intra-group links are very dense, but the inter-group links are quite sparse. Although there exists many works with regard to community mining, few of them studied the connections between the local distance among nodes and the global community structures of networks. In this work, we have studied their connection and established a corresponding heuristics depicting such a connection between local distance and community structure. On the basis of the heuristic, we have proposed a distance-based similarity measure as well as a novel community mining algorithm DSA. The DSA has been rigorously validated and tested against several benchmark networks. The experimental results show that the DSA is able to accurately discovery the potential communities with their hierarchical structures from real-world networks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call