Skip to main content
Log in

Meaningful communities detection in medias network

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

Most of the existing algorithms proposed for communities determination are based on the topological features of social networks. They do not take into account information shared between users. In this paper, We introduce a graph mining algorithm to detect social network communities a MeanCD (meaningful community detection). The proposed algorithm encloses a function measuring the strength of links describing the information (topics) shared and friends and more generally between users. This information is called Link-importance. It is based on two main steps. The first one consists in defining the community after cleaning the networks, while the second step is to determine the good partitioning which maximizes the new concept of the quality function called Modularity.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. http://140dev.com/free-twitter-api-source-code-library/.

References

  • Aaron C, Mark NEW, Cristopher M (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111

    Article  Google Scholar 

  • Alex P, Horst SD, Kang-Pu L (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal Appl 11(3):430–452

    Article  MathSciNet  MATH  Google Scholar 

  • Brandes U, Gaertler M (2003) Experiments on graph clustering algorithms. LNCS 14(1):51–65

    Google Scholar 

  • Brian KW, Shen L (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291–307

    Article  Google Scholar 

  • Caroline H (1996) Social network analysis: an approach and technique for the study of information exchange. Libr Inf Sci Res 18(4):323–342

    Article  Google Scholar 

  • David L, Jon K (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019–1031

    Article  Google Scholar 

  • Donetti L, Munoz MA (2004) Detecting network communities: a new systematic and efficient algorithm. J Stat Mech Theory Exp 2004(10):P10012

    Article  MATH  Google Scholar 

  • Ellis J, Anuj M, George N (1993) Min-cut clustering. Math Program 62(1–3):133–151

    MathSciNet  MATH  Google Scholar 

  • Fang W, Bernardo H (2004) Finding communities in linear time: a physics approach. Eur Phys J B-Condens Matter Complex Syst 38(2):331–338

    Article  Google Scholar 

  • Filippo R, Claudio C, Federico C, Vittorio L, Domenico P (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101(9):2658–2663

    Article  Google Scholar 

  • Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110

  • Giatsoglou M, Chatzakou D, Vakali A (2013) Community detection in social media by leveraging interactions and intensities. In: Web information systems engineering–WISE 2013. Springer, pp 57–72

  • Haifeng D, Marcus F, Shuzhuo L, Xiaoyi J (2007) An algorithm for detecting community structure of social networks based on prior knowledge and modularity. Complexity 12(3):53–60

    Article  MathSciNet  Google Scholar 

  • Jianshu W, Ee-Peng L, Jing J, Qi H (2010) Twitterrank: finding topic-sensitive influential twitterers. In: Proceedings of the third ACM international conference on Web search and data mining. ACM, pp 261–270

  • Kim Y, Son S-W, Jeong H (2010) Finding communities in directed networks. Phys Rev E 81:016103

    Article  Google Scholar 

  • Mark NEJ (2004) Detecting community structure in networks. Eur Phys J B-Condens Matter Complex Syst 38(2):321–330

    Article  Google Scholar 

  • Mark NEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066133

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Matthew M, Sofus A (2010) Discovering users’ topics of interest on twitter: a first look. In: Proceedings of the fourth workshop on analytics for noisy unstructured text data. ACM, pp 73–80

  • Michelle G, Mark NEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826

    Article  MathSciNet  MATH  Google Scholar 

  • Miroslav F (1973) Algebraic connectivity of graphs. Czechoslov Math J 23(2):298–305

    MATH  Google Scholar 

  • Santo F (2010) Community detection in graphs. Phys Rep 486(3):75–174

    MathSciNet  Google Scholar 

  • Trevor H, Robert T, Jerome F (2009) The elements of statistical learning, vol 2. Springer, New York

    MATH  Google Scholar 

  • Zhao WX, Jiang J, Weng J, He J, Lim EP, Yan H, Li X (2011) Comparing Twitter and Traditional Media Using Topic Models. In: Clough P, Foley C, Gurrin C, Jones G, Kraaij W, Lee H, Murdock V (eds) Advances in Information Retrieval. ECIR 2011. Lecture Notes in Computer Science, vol 6611. Springer, Berlin, pp 338–349

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yasmine Chaabani.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chaabani, Y., Akaichi, J. Meaningful communities detection in medias network. Soc. Netw. Anal. Min. 7, 11 (2017). https://doi.org/10.1007/s13278-017-0430-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-017-0430-9

Keywords

Navigation