Skip to main content
SpringerLink
Log in

Improving Similarity-Based Methods for Information Propagation on Social Networks

  • Conference paper
Networked Digital Technologies (NDT 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 87))

Included in the following conference series:

Abstract

Social networks are a means to deeply and quickly propagate information. However, in order not to vanish the advantage of information propagation, the amount of information received by users should not be excessive. A typical approach operates by selecting the set of contacts to which propagate the information on the basis of some suitable similarity notion, trying thus to reach only nodes potentially interested. The main limit of this approach is that similarity is not completely suitable to propagation since it is typically non-transitive, whereas propagation is a mechanism inherently transitive. In this paper we show how to improve similarity-based methods by recovering some form of transitive behaviour, through a suitable notion called expectation. The non-trivial combination of similarity and expectation in a nice mathematical framework, provides the user with a flexible tool able to maximize the effectiveness of information propagation on social networks.

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

Access this chapter

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahmadi, H., Mehrbakhsh, A., Asgarian, E.: Towards an efficient method for spreading information in social network. In: Asia International Conference on Modelling & Simulation, pp. 152–157 (2009)

    Google Scholar 

  2. Aleman-Meza, B., Nagarajan, M., Ramakrishnan, C., Ding, L., Kolari, P., Sheth, A.P., Arpinar, I.B., Joshi, A., Finin, T.: Semantic analytics on social networks: experiences in addressing the problem of conflict of interest detection. In: WWW ’06: Proceedings of the 15th international conference on World Wide Web, pp. 407–416. ACM, New York (2006)

    Chapter  Google Scholar 

  3. Bekkerman, R., McCallum, A.: Disambiguating web appearances of people in a social network. In: Proceedings of the 14th international conference on World Wide Web, pp. 463–470. ACM, New York (2005)

    Chapter  Google Scholar 

  4. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: Design, analysis and applications. In: IEEE INFOCOM, vol. 3, p. 1653 (2005)

    Google Scholar 

  5. Buccafurri, F., Lax, G.: Enabling Selective Flooding to Reduce P2P Traffic. In: Meersman, R., Tari, Z. (eds.) OTM 2007, Part I. LNCS, vol. 4803, pp. 188–205. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Bunch, J., Hopcroft, J.: Triangular factorization and inversion by fast matrix multiplication. Math. Comp. 28(125), 231–236 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cha, M., Mislove, A., Gummadi, K.: A measurement-driven analysis of information propagation in the flickr social network. In: Proceedings of the 18th international conference on World wide web, pp. 721–730. ACM, New York (2009)

    Chapter  Google Scholar 

  8. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progression. Journal of Symbolic Computation 9(3), 251–280 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Cover, T., Thomas, J.: Elements of information theory, New York (1991)

    Google Scholar 

  10. Gruhl, D., Guha, R., Liben-Nowell, D., Tomkins, A.: Information diffusion through blogspace. In: Proceedings of the 13th international conference on World Wide Web, pp. 491–501. ACM, New York (2004)

    Google Scholar 

  11. Kang, S.: A note on measures of similarity based on centrality. Social Networks 29(1), 137–142 (2007)

    Article  Google Scholar 

  12. Kim, J., Lee, K., Shaw, M., Chang, H., Nelson, M., Easley, R.: A preference scoring technique for personalized advertisements on Internet storefronts. Mathematical and Computer Modelling 44(1-2), 3–15 (2006)

    Article  Google Scholar 

  13. Kitts, B., Freed, D., Vrieze, M.: Cross-sell: a fast promotion-tunable customer-item recommendation method based on conditionally independent probabilities. In: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p. 446. ACM, New York (2000)

    Google Scholar 

  14. Kohonen, T.: The Self-Organizing Map. Proceedings of the IEEE 78(9) (1990)

    Google Scholar 

  15. Kumar, R., Novak, J., Raghavan, P., Tomkins, A.: On the bursty evolution of blogspace. World Wide Web 8(2), 159–178 (2005)

    Article  Google Scholar 

  16. Kwon, I., Kim, C., Kim, K., Kwak, C.: Recommendation of e-commerce sites by matching category-based buyer query and product e-catalogs. Computers in Industry 59(4), 380–394 (2008)

    Article  Google Scholar 

  17. Li, Y., Lien, N.: An endorser discovering mechanism for social advertising. In: Proceedings of the 11th International Conference on Electronic Commerce, pp. 125–132. ACM, New York (2009)

    Chapter  Google Scholar 

  18. Lin, D.: An information-theoretic definition of similarity. In: Proceedings of the 15th International Conference on Machine Learning, Citeseer, pp. 296–304 (1998)

    Google Scholar 

  19. Matsuo, Y., Hamasaki, M., Nakamura, Y., Nishimura, T., Hasida, K., Takeda, H., Mori, J., Bollegala, D., Ishizuka, M.: Spinning multiple social networks for semantic web. In: Proceedings of the National Conference on Artificial Intelligence, vol. 21, p. 1381. AAAI Press/MIT Press, Menlo Park/Cambridge (1999)

    Google Scholar 

  20. Matsuo, Y., Mori, J., Hamasaki, M., Nishimura, T., Takeda, H., Hasida, K., Ishizuka, M.: POLYPHONET: an advanced social network extraction system from the web. Web Semantics: Science, Services and Agents on the World Wide Web 5(4), 262–278 (2007)

    Article  Google Scholar 

  21. Mayer, R., Roiger, A., Rauber, A.: Map-based Interfaces for Information Management in Large Text Collections. Journal of Digital Information Management 6(4), 295 (2008)

    Google Scholar 

  22. Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet mathematics 1(2), 226–251 (2004)

    MATH  MathSciNet  Google Scholar 

  23. Petrakis, E., Varelas, G., Hliaoutakis, A., Raftopoulou, P.: X-similarity: Computing semantic similarity between concepts from different ontologies. Journal of Digital Information Management 4(4), 233 (2006)

    Google Scholar 

  24. Salton, G.: Automatic text processing: the transformation, analysis, and retrieval of information by computer (1989)

    Google Scholar 

  25. Shah, D.: Gossip Algorithms. Foundations and Trends® in Networking 3(1), 1–125 (2008)

    Article  MATH  Google Scholar 

  26. Spertus, E., Sahami, M., Buyukkokten, O.: Evaluating similarity measures: a large-scale study in the orkut social network. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, p. 684. ACM, New York (2005)

    Google Scholar 

  27. Strassen, V.: Gaussian elimination is not optimal. Numerishe Mathematik 13, 354–356 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  28. Wikipedia. Rss — wikipedia, the free encyclopedia (2010), (Online; accessed -March 8, 2010)

    Google Scholar 

  29. Zadeh, L.: Similarity relations and fuzzy orderings. Information Sciences 3, 177–200 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  30. Zipf, G.K.: Human behaviour and the principle of least effort. Addison-Wesley, Reading (1949)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIMET, Università degli Studi Mediterranea di Reggio Calabria, Via Graziella, Località Feo di Vito, 89122, Reggio Calabria, Italy

    Francesco Buccafurri & Gianluca Lax

Authors
  1. Francesco Buccafurri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gianluca Lax
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software Engineering, Charles University in Prague, Malostranske namesti 25, 118 00, Prague, Czech Republic

    Filip Zavoral

  2. Charles University, Prague, Czech Republic

    Jakub Yaghob

  3. Al Imam University, Riyadh, Saudi Arabia

    Pit Pichappan

  4. Jordan University of Science and Technology, Irbid, Jordan

    Eyas El-Qawasmeh

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buccafurri, F., Lax, G. (2010). Improving Similarity-Based Methods for Information Propagation on Social Networks. In: Zavoral, F., Yaghob, J., Pichappan, P., El-Qawasmeh, E. (eds) Networked Digital Technologies. NDT 2010. Communications in Computer and Information Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14292-5_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14292-5_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14291-8

  • Online ISBN: 978-3-642-14292-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation