Skip to main content
SpringerLink
Log in

Identification of Subgroups in a Directed Social Network Using Edge Betweenness and Random Walks

  • Conference paper
  • First Online:
Smart Computing and Informatics

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 77))

Abstract

Social networks have obtained masses hobby recently, largely because of the success of online social networking Web sites and media sharing sites. In such networks, rigorous and complex interactions occur among several unique entities, leading to huge information networks with first rate commercial enterprise ability. Network detection is an unmanaged getting to know challenge that determines the community groups based on common  place hobbies, career, modules, and their hierarchical agency, the usage of the records encoded in the graph topology. Locating groups from social network is a tough mission because of its topology and overlapping of various communities. In this research, edge betweenness modularity and random walks is used for detecting groups in networks with node attributes. The twitter data of the famous cricket player is used here and network of friends and followers is analyzed using two algorithms based on edge betweenness and random walks. Also the strength of extracted communities is evaluated using on modularity score and the experiment results confirmed that the cricket player’s network is dense.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Coscia, M., Rossetti, G., Giannotti, F., Pedreschi, D.: Demon: a local-first discovery method for overlapping communities. In: KDD ’12 (2012)

    Google Scholar 

  2. Girvan, M., Newman, M.: Community structure in social and biological networks. In: PNAS (2002)

    Google Scholar 

  3. Yang, J., Leskovec, J.: Overlapping community detection at scale: a non-negative factorization approach. In: WSDM ’13 (2013)

    Google Scholar 

  4. Blei, D.M., Ng, A., Jordan, M.: Latent Dirichlet allocation. MLR 3, 993–1022 (2003)

    MATH  Google Scholar 

  5. Johnson, S.: Hierarchical clustering schemes. Psychometrika 32(3), 241–254 (1967)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: the state of the art and comparative study. ACM Comput. Surv. (2013). doi:https://doi.org/10.1145/2501654.2501657

    Article  MATH  Google Scholar 

  8. Barbieri, N., Bonchi, F., Manco, G.: Cascade-based community detection. In: WSDM’13, February 4–8, Rome, Italy (2012)

    Google Scholar 

  9. Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: the state of the art and comparative study. ACM Comput. Surv (2013). doi:https://doi.org/10.1145/2501654.2501657

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  11. Padrol-Sureda, A., Perarnau-Llobet, G., Pfeie, J., Munes-Mulero, V.: Overlapping community search for social networks. In: ICDE (2010)

    Google Scholar 

  12. Evans, T.S., Lambiotte, R.: Line graphs, link partitions, and overlapping communities. Phys. Rev. E 80, 016105 (2009)

    Article  Google Scholar 

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

    Article  Google Scholar 

  14. Kim, Y., Jeong, H.: The map equation for link communities. Phys. Rev. E 84, 026110 (2011)

    Article  Google Scholar 

  15. Hughes, A.L., Palen, L.: Twitter adoption and use in mass convergence and emergency events. Int. J. Emerg. Manag. 6(3–4), 248–260 (2009)

    Article  Google Scholar 

  16. Diakopoulos, N.A., Shamma, D.A.: Characterizing debate performance via aggregated twitter sentiment. In: Proceedings of the 28th International Conference on Human Factors in Computing Systems (CHI ‘10), pp. 1195–1198 (2010)

    Google Scholar 

  17. Kwak, H., Lee, C., Park, H., Moon, S.: What is twitter, a social network or news media? In: Proceedings of the 19th International World Wide Web Conference (WWW ‘10), pp. 591–600 (2010)

    Google Scholar 

  18. Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27–64 (2007)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. Freeman, L.C.: A set of measures of centrality based upon betweenness. Sociometry 40, 35–41 (1977)

    Article  Google Scholar 

  21. Anthonisse, J.M.: The rush in a directed graph. Technical Report BN9/71, Stichting Mathematicsh Centrum, Amsterdam (1971)

    Google Scholar 

  22. Newman, M.E.J.: Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality. Phys. Rev. E 64, 016132 (2001)

    Article  Google Scholar 

  23. Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25, 163–177 (2001)

    Article  Google Scholar 

  24. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Preprint cond-mat/0308217 (2003)

    Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PSGR Krishnammal College for Women, Coimbatore, 641004, Tamilnadu, India

    K. Sathiyakumari & M. S. Vijaya

Authors
  1. K. Sathiyakumari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. S. Vijaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. Sathiyakumari .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, PVP Siddhartha Institute of Technology, Vijayawada, Andhra Pradesh, India

    Suresh Chandra Satapathy

  2. Department of Electronics and Communication Engineering, Shri Ramswaroop Memorial Group of Professional Colleges, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

  3. Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, West Bengal, India

    Swagatam Das

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sathiyakumari, K., Vijaya, M.S. (2018). Identification of Subgroups in a Directed Social Network Using Edge Betweenness and Random Walks . In: Satapathy, S., Bhateja, V., Das, S. (eds) Smart Computing and Informatics . Smart Innovation, Systems and Technologies, vol 77. Springer, Singapore. https://doi.org/10.1007/978-981-10-5544-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5544-7_12

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5543-0

  • Online ISBN: 978-981-10-5544-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation