Skip to main content
SpringerLink
Log in

A Rough Connectedness Algorithm for Mining Communities in Complex Networks

  • Conference paper
  • First Online:
Big Data Analytics and Knowledge Discovery (DaWaK 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9829))

Included in the following conference series:

Abstract

Mining communities is essential for modern network analysis so as to understand the dynamic processes taking place in the complex real-world networks. Though community detection is a very active research area, most of the algorithms focus on detecting disjoint community structure. However, real-world complex networks do not necessarily have disjoint community structure. Concurrent overlapping and hierarchical communities are prevalent in real-world networked systems. In this paper, we propose a novel algorithm based on rough sets that is capable of detecting disjoint, overlapping and hierarchically nested communities in networks. The algorithm is initiated by constructing granules of neighborhood nodes and representing them as rough sets. Subsequently, utilizing the concept of constrained connectedness, upper approximation is computed in an iterative manner. We also introduce a new metric based on relative connectedness which is used as the merging criteria for sets during iterations. Experiments conducted on nine real-world networks, including a large word association network and protein-protein interaction network, demonstrate the effectiveness of the proposed algorithm. Moreover, it is observed that the proposed algorithm competes favorably with five relevant methods of community detection.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Steinhaeuser, K., Chawla, N.V.: Identifying and evaluating community structure in complex networks. Pattern Recogn. Lett. 31, 413–421 (2010)

    Article  Google Scholar 

  2. Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  3. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 26113 (2004)

    Article  Google Scholar 

  4. Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42, 181–213 (2015)

    Article  Google Scholar 

  5. Kloster, K., Gleich, D.F.: Heat kernel based community detection. In: 20th International Conference on Knowledge Discovery and Data Mining, pp. 1386–1395. ACM (2014)

    Google Scholar 

  6. Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)

    Article  Google Scholar 

  7. Gregory, S.: An algorithm to find overlapping community structure in networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 91–102. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Shen, H., Cheng, X., Cai, K., Hu, M.-B.: Detect overlapping and hierarchical community structure in networks. Phys. Stat. Mech. Appl. 388, 1706–1712 (2009)

    Article  Google Scholar 

  9. Ball, B., Karrer, B., Newman, M.E.J.: Efficient and principled method for detecting communities in networks. Phys. Rev. E 84, 36103 (2011)

    Article  Google Scholar 

  10. Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PLoS ONE 6, e18961 (2011)

    Article  Google Scholar 

  11. Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11, 33015 (2009)

    Article  Google Scholar 

  12. Zhang, Z.-Y., Wang, Y., Ahn, Y.-Y.: Overlapping community detection in complex networks using symmetric binary matrix factorization. Phys. Rev. E 87, 62803 (2013)

    Article  Google Scholar 

  13. Psorakis, I., Roberts, S., Ebden, M., Sheldon, B.: Overlapping community detection using bayesian non-negative matrix factorization. Phys. Rev. E 83, 66114 (2011)

    Article  Google Scholar 

  14. McDaid, A., Hurley, N.: Detecting highly overlapping communities with model-based overlapping seed expansion. In: 2010 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 112–119. IEEE (2010)

    Google Scholar 

  15. Latouche, P., Birmelé, E., Ambroise, C.: Overlapping stochastic block models with application to the french political blogosphere. Ann. Appl. Stat. 5(1), 309–336 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12, 103018 (2010)

    Article  Google Scholar 

  17. Xie, J., Szymanski, B.K., Liu, X.: SLPA: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: Data Mining Workshops (ICDMW), pp. 344–349. IEEE (2011)

    Google Scholar 

  18. Huang, J., Sun, H., Han, J., Feng, B.: Density-based shrinkage for revealing hierarchical and overlapping community structure in networks. Phys. Stat. Mech. Appl. 390, 2160–2171 (2011)

    Article  Google Scholar 

  19. Nepusz, T., Petróczi, A., Négyessy, L., Bazsó, F.: Fuzzy communities and the concept of bridgeness in complex networks. Phys. Rev. E 77, 16107 (2008)

    Article  MathSciNet  Google Scholar 

  20. Zhang, S., Wang, R.-S., Zhang, X.-S.: Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Phys. Stat. Mech. Appl. 374, 483–490 (2007)

    Article  Google Scholar 

  21. Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput. Surv. 45, 1–35 (2013)

    Article  MATH  Google Scholar 

  22. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  23. Kumar, P., Krishna, P.R., Bapi, R.S., De, S.K.: Rough clustering of sequential data. Data Knowl. Eng. 63, 183–199 (2007)

    Article  Google Scholar 

  24. Lingras, P., West, C.: Interval set clustering of web users with rough k-means. J. Intell. Inf. Syst. 23, 5–16 (2004)

    Article  MATH  Google Scholar 

  25. Kundu, S., Pal, S.K.: Fuzzy-rough community in social networks. Pattern Recogn. Lett. 67, 145–152 (2015)

    Article  Google Scholar 

  26. Zadeh, L.A.: Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets Syst. 90, 111–127 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  27. Gleich, D.F., Seshadhri, C.: Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In: 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 597–605. ACM (2012)

    Google Scholar 

  28. Grzymala-Busse, J.W.: LERS-a system for learning from examples based on rough sets. In: Słowiński, R. (ed.) Intelligent Decision Support. Theory and Decision Library, vol. 11, pp. 3–18. Springer, Netherlands (1992)

    Chapter  Google Scholar 

  29. Dash, M., Liu, H., Scheuermann, P., Tan, K.L.: Fast hierarchical clustering and its validation. Data Knowl. Eng. 44, 109–138 (2003)

    Article  MATH  Google Scholar 

  30. Krebs, V.: Books about US Politics (2004). http://www.orgnet.com

  31. Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99, 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  32. Adamic, L.A., Glance, N.: The political blogosphere and the 2004 us election: divided they blog. In: 3rd International Workshop on Link Discovery, pp. 36–43. ACM (2005)

    Google Scholar 

  33. Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452–473 (1977)

    Article  Google Scholar 

  34. Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54, 396–405 (2003)

    Article  Google Scholar 

  35. Knuth, K.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading (1993)

    MATH  Google Scholar 

  36. Krogan, N.J., Cagney, G., Yu, H., Zhong, G., Guo, X., Ignatchenko, A., Li, J., Pu, S., Datta, N., Tikuisis, A.P., et al.: Global landscape of protein complexes in the yeast Saccharomyces cerevisiae. Nature 440, 637–643 (2006)

    Article  Google Scholar 

  37. Newman, M.E.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 36104 (2006)

    Article  MathSciNet  Google Scholar 

  38. Agarwal, G., Kempe, D.: Modularity-maximizing graph communities via mathematical programming. Eur. Phys. J. B 66, 409–418 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  39. He, D., Jin, D., Chen, Z., Zhang, W.: Identification of hybrid node and link communities in complex networks. Sci. Rep. 5, 8638 (2015)

    Article  Google Scholar 

  40. Balakrishnan, H., Deo, N.: Discovering communities in complex networks. In: 44th Annual Southeast Regional Conference, pp. 280–285. ACM (2006)

    Google Scholar 

  41. Ahn, Y.-Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466, 761–764 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Management, Lucknow, India

    Samrat Gupta, Pradeep Kumar & Bharat Bhasker

Authors
  1. Samrat Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pradeep Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bharat Bhasker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Samrat Gupta .

Editor information

Editors and Affiliations

  1. University of Science and Technology , Rolla, Missouri, USA

    Sanjay Madria

  2. Osaka University , Osaka, Japan

    Takahiro Hara

Appendix

Appendix

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Gupta, S., Kumar, P., Bhasker, B. (2016). A Rough Connectedness Algorithm for Mining Communities in Complex Networks. In: Madria, S., Hara, T. (eds) Big Data Analytics and Knowledge Discovery. DaWaK 2016. Lecture Notes in Computer Science(), vol 9829. Springer, Cham. https://doi.org/10.1007/978-3-319-43946-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43946-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43945-7

  • Online ISBN: 978-3-319-43946-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation