Skip to main content
Log in

Mining diversity on social media networks

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

The fast development of multimedia technology and increasing availability of network bandwidth has given rise to an abundance of network data as a result of all the ever-booming social media and social websites in recent years, e.g., Flickr, Youtube, MySpace, Facebook, etc. Social network analysis has therefore become a critical problem attracting enthusiasm from both academia and industry. However, an important measure that captures a participant’s diversity in the network has been largely neglected in previous studies. Namely, diversity characterizes how diverse a given node connects with its peers. In this paper, we give a comprehensive study of this concept. We first lay out two criteria that capture the semantic meaning of diversity, and then propose a compliant definition which is simple enough to embed the idea. Based on the approach, we can measure not only a user’s sociality and interest diversity but also a social media’s user diversity. An efficient top-k diversity ranking algorithm is developed for computation on dynamic networks. Experiments on both synthetic and real social media datasets give interesting results, where individual nodes identified with high diversities are intuitive.

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
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. DC and BC denote degree and betweenness centrality for short respectively in this paper.

  2. SN denotes synthetic network for short.

  3. FN denotes the social network of American football games for short.

References

  1. http://graphexploration.cond.org/index.html

  2. Barabasi AL, Oltvai ZN (2004) Network biology: understanding the cell’s functional organization. Nat Rev Genet 5(2):101–113

    Article  Google Scholar 

  3. Blei D, Ng A, Jordan M (2003) Latent dirichlet allocation. J Mach Learn Res 3:993–1022

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Cover TM, Thomas JA (2006) Elements of information theory. Wiley

    MATH  Google Scholar 

  6. Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: SIGCOMM, pp 251–262

  7. Gibson D, Kumar R, Tomkins A (2005) Discovering large dense subgraphs in massive graphs. In: VLDB, pp 721–732

  8. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826

    Article  MATH  MathSciNet  Google Scholar 

  9. Hwang W, Kim T, Ramanathan M, Zhang A (2008) Bridging centrality: graph mining from element level to group level. In: KDD, pp 336–344

  10. Jeh G, Widom J (2002) Simrank: a measure of structural-context similarity. In: KDD, pp 538–543

  11. Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: KDD, pp 137–146

  12. Kossinets G, Kleinberg JM, Watts DJ (2008) The structure of information pathways in a social communication network. In: KDD, pp 435–443

  13. Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: ICDM, pp 313–320

  14. Lawrence P, Sergey B, Motwani R, Winograd T (1998) The pagerank citation ranking: bringing order to the web. Technical report, Stanford University

  15. Leskovec J, Kleinberg JM, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD, pp 177–187

  16. Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: NIPS, pp 849–856

  17. Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: KDD, pp 228–238

  18. Putnam RD (1995) Bowling alone: America’s declining social capital. J Democr 6(1):65–78

    Article  Google Scholar 

  19. Spirin V, Mirny LA (2003) Protein complexes and functional modules in molecular networks. Proc Natl Acad Sci USA 100(21):12123–12128

    Article  Google Scholar 

  20. Stephenson K, Zelen M (1989) Rethinking centrality: methods and examples. Soc Netw 11(1):1–37

    Article  MathSciNet  Google Scholar 

  21. Sun Y, Han J, Zhao P, Yin Z, Cheng H, Wu T (2009) Rankclus: integrating clustering with ranking for heterogeneous information network analysis. In: EDBT, pp 565–576

  22. Wasserman S, Faust K (1994) Social network analysis, methods and applications. Cambridge University Press

  23. Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393(6684):440–442

    Article  Google Scholar 

  24. Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: ICDM, pp 721–724

  25. Zvi MR, Griffiths T, Steyvers M, Smyth P (2004) The author-topic model for authors and documents. In: UAI, pp 487–494

Download references

Acknowledgements

The work was supported in part by the U.S. National Science Foundation grants IIS-08-42769 and IIS-09-05215, and the NASA grant NNX08AC35A, and 973 Program of China grant 2006CB303103, and the State Key Program of National Natural Science of China grant 60933013. Any opinions, findings, and conclusions expressed here are those of the authors and do not necessarily reflect the views of the funding agencies.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lu Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, L., Zhu, F., Jiang, M. et al. Mining diversity on social media networks. Multimed Tools Appl 56, 179–205 (2012). https://doi.org/10.1007/s11042-010-0568-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-010-0568-1

Keywords

Navigation