Skip to main content
SpringerLink
Log in
Book cover

Prediction and Inference from Social Networks and Social Media pp 51–84Cite as

The Significant Effect of Overlapping Community Structures in Signed Social Networks

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Social Networks ((LNSN))

Abstract

Social networks are non-detachable part of modern life. It is improbable that someone is not familiar with Facebook or Twitter. Nowadays people join these platforms and communicate with other members. In social networks, some people are more similar to each other and they form densely connected components named communities. Detection of these tightly connected components have received much attention recently. These components are overlapping in nature. In other words, a member belongs to more than one community. Not only overlapping community structure but also temporality is an intrinsic property of online social networks. Regarding the dynamism, people initiate new connections among each other. When people’s communications is mapped to signed connections then we obtain a network with both positive and negative links. To reliably predict how these interactions evolve, we consider the sign prediction problem. Sign prediction and overlapping community detection have been explored to a certain extent, however, answers to some of research questions are still unknown. For instance, how much is the significance of overlapping members in signed networks? To answer this question, we need a fast and precise overlapping community detection algorithm (OCD) working based on simple network dynamics such as disassortative degree mixing and information diffusion. In this paper, we propose a two-phase approach to discover overlapping communities in signed networks. In the first phase, the algorithm identifies most influential nodes (leaders) in the network. In the second phase, we identify the membership of each node to the leaders using network coordination game. We apply several features to investigate the significance of overlapping members. These features include extra, overlapping and intra. To compute these feature types, we not only apply simple degree ranking but also extend original HITS and PageRank ranking algorithms. We employ the features to the sign prediction problem. Results indicate that overlapping nodes competitively predict signs in comparison to intra and extra nodes.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    https://snap.stanford.edu/data/

  2. 2.

    https://sites.google.com/site/santofortunato/inthepress2

  3. 3.

    https://snap.stanford.edu/data/wiki-Elec.html

References

  1. Amelio A, Pizzuti C (2013) Community mining in signed networks: a multiobjective approach. In: Proceedings of the 2013 IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM ’13). ACM, New York, NY, pp 95–99

    Chapter  Google Scholar 

  2. Anchuri P, Ismail MM (2012) Communities and balance in signed networks: a spectral approach. In: 2012 IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 235–242

    Google Scholar 

  3. Anchuri P, Magdon-Ismail M (2012) Communities and balance in signed networks: a spectral approach. In: Proceedings of the 2012 international conference on advances in social networks analysis and mining (ASONAM 2012). IEEE Computer Society, Washington, DC, pp 235–242

    Google Scholar 

  4. Backstrom L, Huttenlocher D, Kleinberg J, Lan X (2006) Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining (KDD ’06). ACM, New York, NY, pp 44–54

    Chapter  Google Scholar 

  5. Bishop CM (2006) Pattern recognition and machine learning (information science and statistics). Springer, New York, Secaucus, NJ

    MATH  Google Scholar 

  6. Cartwright D, Harary F (1956) Structural balance: a generalization of Heider’s theory. Psychol Rev 63:277–293

    Article  Google Scholar 

  7. Chen D, Fu Y, Shang M (2009) An efficient algorithm for overlapping community detection in complex networks. In: WRI global congress on intelligent systems, 2009 (GCIS ’09), vol 1, pp 244–247

    Google Scholar 

  8. Chen Y, Wang X, Yuan B, Tang B (2014) Overlapping community detection in networks with positive and negative links. J Stat Mech Theory Exp 2014(3):P03021

    Article  Google Scholar 

  9. Choudhury D, Paul A (2013) Community detection in social networks: an overview. Int J Res Eng Technol 2(2):83–88

    Google Scholar 

  10. Doriean P (2004) Evolution of human signed networks. Metodoloski Zvezki 1(2):277–293

    Google Scholar 

  11. Doreian P, Mrvar A (2009) Partitioning signed social networks. Soc Networks 31(1):1–11

    Article  MATH  Google Scholar 

  12. DuBois T, Golbeck J, Srinivasan A (2011) Predicting trust and distrust in social networks. In: 2011 IEEE third international conference on privacy, security, risk and trust (PASSAT) and 2011 IEEE third international conference on social computing (SocialCom) (PASSAT/SocialCom 2011), Boston, MA, 9–11 October 2011, pp 418–424

    Google Scholar 

  13. Gomez S, Jensen P, Arenas A (2009) Analysis of community structure in networks of correlated data. Phys Rev E 80(1):16114

    Article  Google Scholar 

  14. Guimerà R, Sales-Pardo M, Amaral LAN (2004) Modularity from fluctuations in random graphs and complex networks. Phys Rev E 70(2):25101

    Article  Google Scholar 

  15. Hasan MA, Chaoji V, Salem S, Zaki M (2006) Link prediction using supervised learning. In: Proceedings of SDM 06 workshop on link analysis, counterterrorism and security

    Google Scholar 

  16. Javari A, Jalili M (2014) Cluster-based collaborative filtering for sign prediction in social networks with positive and negative links. ACM Trans Intell Syst Technol 5(2):24:1–24:19

    Google Scholar 

  17. Jin D, Yang B, Baquero C, Liu D, He D, Liu J (2013) Markov random walk under constraint for discovering overlapping communities in complex networks. Comput Res Repository abs/1303.5675

    Google Scholar 

  18. Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291–307

    Article  MATH  Google Scholar 

  19. Klamma R (2013) Community learning analytics – challenges and opportunities. In: Wang J-F, Lau R (eds) Advances in web-based learning – ICWL 2013. Lecture notes in computer science, vol 8167. Springer, Berlin, Heidelberg, pp 284–293

    Chapter  Google Scholar 

  20. Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM 46(5):604–632

    Article  MathSciNet  MATH  Google Scholar 

  21. Kunegis J, Lommatzsch A, Bauckhage C (2009) The slashdot zoo: mining a social network with negative edges. In: Proceedings of the 18th international conference on world wide web (WWW ’09). ACM, New York, NY, pp 741–750

    Chapter  Google Scholar 

  22. Kunegis J, Gröner G, Gottron T (2012) Online dating recommender systems: the split-complex number approach. In: Proceedings of the 4th ACM RecSys workshop on recommender systems and the social web (RSWeb ’12). ACM, New York, NY, pp 37–44

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  24. Lerman K, Intagorn S, Kang J, Ghosh R (2011) Using proximity to predict activity in social networks. Comput Res Repository abs/1112.2755

    Google Scholar 

  25. Leskovec J, Huttenlocher D, Kleinberg J (2010) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on world wide web (WWW ’10). ACM, New York, NY, pp 641–650

    Google Scholar 

  26. Li H, Zhang J, Liu Z, Chen L, Zhang X (2012) Identifying overlapping communities in social networks using multi-scale local information expansion. Eur Phys J B 85(6):190–198

    Article  Google Scholar 

  27. Liben-Nowell D, Kleinberg J (2003) The link prediction problem for social networks. In: Proceedings of the twelfth international conference on information and knowledge management (CIKM ’03). ACM, New York, NY, pp 556–559

    Google Scholar 

  28. Liu C, Liu J, Jiang Z (2014) A multiobjective evolutionary algorithm based on similarity for community detection from signed social networks. IEEE Trans Cybern 44(12):2274–2286

    Article  Google Scholar 

  29. Mitchell TM (1997) Machine learning, 1st edn. McGraw-Hill, New York, NY

    MATH  Google Scholar 

  30. Newman MEJ (2003) Mixing patterns in networks. Phys Rev E 67(2):026126

    Article  MathSciNet  Google Scholar 

  31. Newman M (2004) Detecting community structure in networks. Eur Phys J B 38(2):321–330

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  33. Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Technical report. Stanford InfoLab. http://ilpubs.stanford.edu:8090/422/

    Google Scholar 

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

    Article  Google Scholar 

  35. Pothen A, Simon HD, Liou K-P (1990) Partitioning sparse matrices with eigenvectors of graphs. Eur Phys J B 11(3):430–452

    MathSciNet  MATH  Google Scholar 

  36. Shahriari M, Jalili M (2014) Ranking nodes in signed social networks. Soc Netw Anal Min 4(1):1–12

    Article  Google Scholar 

  37. Shahriari M, Klamma R (2015) Signed social networks: link prediction and overlapping community detection. In: The 2015 IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM), Paris

    Google Scholar 

  38. Shahriari M, Krott S, Klamma R (2015) Disassortative degree mixing and information diffusion for overlapping community detection in social networks (DMID). In: Proceedings of the 24th international conference on world wide web companion, WWW 2015 - companion volume, pp 1369–1374

    Google Scholar 

  39. Shahriari M, Li Y, Klamma R (2016) Analysis of overlapping communities in signed complex networks. In: International conference on knowledge technologies and data-driven business (i-KNOW)

    Google Scholar 

  40. Shahriary SR, Shahriari M, Noor RM (2014) A community-based approach for link prediction in signed social networks. Sci Program J, 2015(5):10

    Google Scholar 

  41. Shen H-W (2013) Exploratory analysis of the structural regularities in networks. In: Community structure of complex networks, Springer theses. Springer, Berlin, Heidelberg, pp 93–117

    Chapter  Google Scholar 

  42. Stanoev A, Smilkov D, Kocarev L (2011) Identifying communities by influence dynamics in social networks. Phys Rev E 84:046102

    Article  Google Scholar 

  43. Šubelj L, Bajec M (2013) Model of complex networks based on citation dynamics. In: Proceedings of the 22nd international conference on world wide web companion WWW ’13 Companion, pp 527–530

    Google Scholar 

  44. Symeonidis P, Iakovidou N, Mantas N, Manolopoulos Y (2013) From biological to social networks: link prediction based on multi-way spectral clustering. Data Knowl Eng 87:226–242

    Article  Google Scholar 

  45. Tan P-N, Steinbach M, Kumar V (2005) Introduction to data mining, 1st edn. Addison-Wesley Longman, Boston, MA

    Google Scholar 

  46. Wang G, Shen Y, Ouyang M (2008) A vector partitioning approach to detecting community structure in complex networks. Comput Math Appl 55(12):2746–2752

    Article  MathSciNet  MATH  Google Scholar 

  47. Wu L, Wu X, Lu A, Li Y (2014) On spectral analysis of signed and dispute graphs. In: 2014 IEEE international conference on data mining (ICDM), pp 1049–1054

    Google Scholar 

  48. Xie J, Szymanski BK, Liu X (2011) Slpa: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE international conference on data mining workshops (ICDMW), pp 344–349

    Google Scholar 

  49. Yang J, Leskovec J (2012) Community-affiliation graph model for overlapping network community detection. In: 2012 IEEE 12th international conference on data mining (ICDM), pp 1170–1175

    Google Scholar 

  50. Yang B, Cheung W, Liu J (2007) Community mining from signed social networks. IEEE Trans Knowl Data Eng 19(10):1333–1348

    Article  Google Scholar 

Download references

Acknowledgements

The work has received funding from the European Commission’s FP7 IP Learning Layers under grant agreement no 318209.

Author information

Authors and Affiliations

  1. Advanced Community Information Systems (ACIS), RWTH Aachen University, Ahornstr. 55, 52056, Aachen, Germany

    Mohsen Shahriari, Ying Li & Ralf Klamma

Authors
  1. Mohsen Shahriari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ralf Klamma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohsen Shahriari .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, Calgary, Alberta, Canada

    Jalal Kawash

  2. Information Science Department, University of Arkansas at Little Rock, Little Rock, Arkansas, USA

    Nitin Agarwal

  3. Department of Computer Engineering, TOBB University, Ankara, Turkey

    Tansel Özyer

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Shahriari, M., Li, Y., Klamma, R. (2017). The Significant Effect of Overlapping Community Structures in Signed Social Networks. In: Kawash, J., Agarwal, N., Özyer, T. (eds) Prediction and Inference from Social Networks and Social Media. Lecture Notes in Social Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-51049-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51049-1_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51048-4

  • Online ISBN: 978-3-319-51049-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation