Advertisement

GeNeDis 2016 pp 205-214 | Cite as

On the Detection of Overlapped Network Communities via Weight Redistributions

Conference paper
First Online:
Part of the Advances in Experimental Medicine and Biology book series (AEMB, volume 988)

Abstract

A community is an important attribute of networking, since people who join networks tend to join communities. Community detection is used to identify and understand the structure and organization of real-world networks, thus, it has become a problem of considerable interest. The study of communities is highly related to network partitioning, which is defined as the division of a network into a set of groups of approximately equal sizes with minimum number of edges. Since this is an NP-hard problem, unconventional computation methods have been widely applied. This work addresses the problem of detecting overlapped communities (communities with common nodes) in weighted networks with irregular topologies. These communities are particularly interesting, firstly because they are more realistic, i.e., researchers may belong to more than one research community, and secondly, because they reveal hierarchies of communities: i.e., a medical community is subdivided into groups of certain specialties. Our strategy is based on weight redistribution: each node is examined against all communities and weights are redistributed between the edges. At the end of this process, these weights are compared to the total connectivity of each community, to determine if overlapping exists.

Keywords

Networks Community detection 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Clauset, A., M.E. Newman, and C. Moore, 2004. Finding community structure in very large networks. Physical Review E 70(6): 066111.CrossRefGoogle Scholar
  2. 2.
  3. 3.
    Bu, Z., C. Zhang, Z. Xia, and J. Wang. 2013. A fast parallel modularity optimization algorithm (FPMQA) for community detection in online social network. Knowledge-Based Systems 50: 246–259.CrossRefGoogle Scholar
  4. 4.
    Fortunato, S. 2010. Community detection in graphs. Physics Reports 486(3–5): 75–174.CrossRefGoogle Scholar
  5. 5.
    Raghavan, U.N., R. Albert, and S. Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76(3): 036106.CrossRefGoogle Scholar
  6. 6.
    Gao, W., G. Cao, T.L. Porta, and J. Han. 2013. On exploiting transient social contact patterns for data forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing 12(1): 151–165.CrossRefGoogle Scholar
  7. 7.
    Gao, W., Q. Li, B. Zhao, and G. Cao. 2012. Social-aware multicast in disruption-tolerant networks. IEEE/ACM Transactions on Networking 20(5): 1553–1566.CrossRefGoogle Scholar
  8. 8.
    Hui, P., J. Crowcroft, and E. Yoneki, 2011. Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing 10(11): 1576–1589.CrossRefGoogle Scholar
  9. 9.
    Lu, Z., X. Sun, Y. Wen, G. Cao, and T.L. Porta. 2015. Algorithms and applications for community detection in weighted networks. IEEE Transactions on Parallel and Distributed Systems 26(11): 2916–2926.CrossRefGoogle Scholar
  10. 10.
    Bu, Z., Z. Xia, and J. Wang. 2013. A sock puppet detection algorithm on virtual spaces. Knowledge-Based Systems 37: 366–377.CrossRefGoogle Scholar
  11. 11.
    Newman, M.E. and M. Girvan, 2004. Finding and evaluating community structure in networks. Physical Review E 69(2): 026113.CrossRefGoogle Scholar
  12. 12.
    Leskovec, J., K.J. Lang, and M. Mahoney. 2010. Empirical comparison of algorithms for network community detection. In Proceedings of the 19th International Conference on World Wide Web, WWW ’10, 631–640. New York, NY: ACMCrossRefGoogle Scholar
  13. 13.
    Lancichinetti, A., and S. Fortunato, 2009. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E 80(1): 016118.CrossRefGoogle Scholar
  14. 14.
    Hui, P., E. Yoneki, S.Y. Chan, and J. Crowcroft. 2007. Distributed community detection in delay tolerant networks. In Proceedings of 2nd ACM/IEEE International Workshop on Mobility in the Evolving Internet Architecture, MobiArch ’07, vol. 7, 1–7:8. New York, NY: ACM.Google Scholar
  15. 15.
    Lu, Z., Y. Wen, and G. Cao. 2013. Community detection in weighted networks: Algorithms and applications. In IEEE International Conference on Pervasive Computing and Communications (PerCom), 179–184.Google Scholar
  16. 16.
    Newman, M.E. 2004. Analysis of weighted networks. Physical Review E 70(5): 056131.CrossRefGoogle Scholar
  17. 17.
    Xia, Z., and Z. Bu. 2012. Community detection based on a semantic network. Knowledge-Based Systems 26: 30–39CrossRefGoogle Scholar
  18. 18.
    Zhao, Z., S. Feng, Q. Wang, J.Z. Huang, G.J. Williams, and J. Fan. 2012. Topic oriented community detection through social objects and link analysis in social networks. Knowledge-Based Systems 26: 164–173.CrossRefGoogle Scholar
  19. 19.
    Berry, J.W., B. Hendrickson, R.A. LaViolette, and C.A. Phillips. 2011. Tolerating the community detection resolution limit with edge weighting. Physical Review E 83(5): 056119.CrossRefGoogle Scholar
  20. 20.
    Chen, D., M. Shang, Z. Lv, and Y. Fu. 2010. Detecting overlapping communities of weighted networks via a local algorithm. Physica A: Statistical Mechanics and its Applications 389(19): 4177–4187.CrossRefGoogle Scholar
  21. 21.
    Gregory, S. 2010. Finding overlapping communities in networks by label propagation. New Journal of Physics 12(10): 103018.CrossRefGoogle Scholar
  22. 22.
    Nguyen, N.P., T.N. Dinh, S. Tokala, and M.T. Thai. 2011. Overlapping communities in dynamic networks: Their detection and mobile applications. In Proceedings of the 17th Annual International Conference on Mobile Computing and Networking, MobiCom ’11, 85–96. New York, NY: ACM.Google Scholar
  23. 23.
    Nguyen, N.P., T.N. Dinh, Y. Xuan, and M.T. Thai. 2011. Adaptive algorithms for detecting community structure in dynamic social networks. In IEEE International Conference on Computer Communications (INFOCOM), 2282–2290.Google Scholar
  24. 24.
    Lancichinetti, A., S. Fortunato, and J. Kertész, 2009. Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics 11(3): 033015.CrossRefGoogle Scholar
  25. 25.
    Xie, J., S. Kelley, and B.K. Szymanski. 2013. Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Computing Surveys 45(4): 43.CrossRefGoogle Scholar
  26. 26.
    Wu, F., and B.A. Huberman. 2004. Finding communities in linear time: A physics approach. European Physical Journal B 38(2): 331–338.CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Applied InformaticsUniversity of MacedoniaThessalonikiGreece

Personalised recommendations

Cite paper

Buy options