Skip to main content

Information Diffusion Pattern Mining over Online Social Media

  • Conference paper
  • First Online:
  • 2243 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8643))

Abstract

With the rapid development of Web 2.0 technology, online social media have become increasingly popular and influential. In online social media, such as Reddit, Digg, Twitter and Weibo, users can post, vote and comment posted stories and other users’ comments. Users, together with story and corresponding feedbacks, form a heterogeneous information diffusion network. To analyze how information diffuses among different users, we need to better understand a few key factors, including (1) frequent appearing sub-structures, called motifs, in the network and (2) evolution of a motif. In this paper, we explore the MOtif-based Sequential Pattern (MOSP) to facilitate the understanding of motif evolution along the time. Furthermore, we propose Topological MOSP (T-MOSP) and Propagative MOSP (P-MOSP) to observe frequent sequence of motifs in different angles. Facing a large volume of graph data, Motif mining is time-consuming. Therefore, we devise efficient mining algorithms, namely, Motif-Mine and Lattice-based Temporal Sequential Pattern Mine (LTSP-Mine), to discover motifs and sequences of motifs, respectively. Extensive experimental evaluation on Digg demonstrates that T-MOSP and P-MOSP discovered by the proposed algorithms can efficiently and effectively capture and summarize the information diffusion patterns in online social media.

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

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Alon, U.: Network motifs: theory and experimental approaches. Nat. Rev. Genet. 8(6), 450–461 (2007)

    Article  Google Scholar 

  2. Anagnostopoulos, A., Kumar, R., Mahdian, M.: Influence and correlation in social networks. In: KDD, pp. 7–15 (2008)

    Google Scholar 

  3. Asur, S., Huberman, B.: Predicting the future with social media. In: Web Intelligence, pp. 492–499 (2010)

    Google Scholar 

  4. Bakshy, E., Hofman, J., Mason, W., Watts, D.: Everyone’s an influencer: quantifying influence on twitter. In: WSDM, pp. 65–74 (2011)

    Google Scholar 

  5. Chen, B., Zhao, Q., Sun, B., Mitra, P.: Predicting blogging behavior using temporal and social networks. In: ICDM, pp. 439–444 (2007)

    Google Scholar 

  6. Choudhury, M., Sundaram, H., John, A., Seligmann, D.: Dynamic prediction of communication flow using social context. In: Hypertext, pp. 49–54 (2008)

    Google Scholar 

  7. Du, N., Faloutsos, C., Wang, B., Akoglu, L.: Large human communication networks: patterns and a utility-driven generator. In: KDD, pp. 269–278 (2009)

    Google Scholar 

  8. Gruhl, D., Guha, R., Liben-Nowell, D., Tomkins, A.: Information diffusion through blogspace. In: WWW, pp. 491–501 (2004)

    Google Scholar 

  9. Guo, L., Tan, E., Chen, S., Zhang, X., Zhao, Y.: Analyzing patterns of user content generation in online social networks. In: KDD, pp. 369–378 (2009)

    Google Scholar 

  10. Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In: ICDM, pp. 549–552 (2003)

    Google Scholar 

  11. Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 13–23. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. TKDE 16, 1038–1051 (2004)

    Google Scholar 

  13. Lin, Y., Chi, Y., Zhu, S., Sundaram, H., Tseng, B.: Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. In: WWW, pp. 685–694 (2008)

    Google Scholar 

  14. Malmgren, R., Hofman, J., Amaral, L., Watts, D.: Characterizing individual communication patterns. In: KDD, pp. 607–616 (2009)

    Google Scholar 

  15. Nanavati, A., Singh, R., Chakraborty, D., Dasgupta, K., Mukherjea, S., Das, G., Gurumurthy, S., Joshi, A.: Analyzing the structure and evolution of massive telecom graphs. IEEE TKDE 20, 703–718 (2008)

    Google Scholar 

  16. Prins, J., Yang, J., Huan, J., Wang, W.: Spin: mining maximal frequent subgraphs from graph databases. In: KDD, pp. 581–586 (2004)

    Google Scholar 

  17. Thomas, L., Valluri, S., Karlapalem, K.: Margin: maximal frequent subgraph mining. In: ICDM, pp. 1097–1101 (2006)

    Google Scholar 

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

    Google Scholar 

  19. Yang, J., Counts, S.: Predicting the speed, scale, and range of information diffusion in twitter. In: ICWSM (2010)

    Google Scholar 

  20. Zhao, Q., Tian, Y., He, Q., Oliver, N., Jin, R., Lee, W.-C.: Communication motifs: a tool to characterize social communications. In: CIKM, pp. 1645–1648 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eric Hsueh-Chan Lu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Lu, E.HC., Hung, HJ. (2014). Information Diffusion Pattern Mining over Online Social Media. In: Peng, WC., et al. Trends and Applications in Knowledge Discovery and Data Mining. PAKDD 2014. Lecture Notes in Computer Science(), vol 8643. Springer, Cham. https://doi.org/10.1007/978-3-319-13186-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13186-3_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13185-6

  • Online ISBN: 978-3-319-13186-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics