Skip to main content

Application of the Ant Colony Optimization Algorithm to Competitive Viral Marketing

  • Conference paper

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

Abstract

Consumers often form complex social networks based on a multitude of different relations and interactions. By virtue of these interactions, they influence each other’s decisions in adopting products or behaviors. Therefore, it is essential for companies to identify influential consumers to target, in the hopes that influencing them will lead to a large cascade of further recommendations. Several studies, based on approximation algorithms and assume that the objective function is monotonic and submodular, have been addressed this issue of viral marketing. However, there is a complex and broad family of diffusion models in competitive environment, and the properties of monotonic and submodular may not be upheld. Therefore, in this research, we borrowed from swarm intelligence-specifically the ant colony optimization algorithm-to address the competitive influence-maximization problem. The proposed approaches were evaluated using a coauthorship data set from the arXiv e-print (http://www.arxiv.org), and the obtained experimental results demonstrated that our approaches outperform two well-known benchmark heuristics.

Keywords

  • Ant Colony Optimization Algorithm
  • Viral Marketing
  • Social Network
  • E-Commerce

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bharathi, S., Kempe, D., Salek, M.: Competitive Influence Maximization in Social Networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  2. Borodin, A., Filmus, Y., Oren, J.: Threshold Models for Competitive Influence in Social Networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 539–550. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  3. Cao, T., Wu, X., Wang, S., Hu, X.: Maximizing Influence Spread in Modular Social Networks by Optimal Resource Allocation. Expert Systems with Applications 38(10), 13128–13135 (2011)

    CrossRef  Google Scholar 

  4. Carnes, T., Nagarajan, C., Wild, S.M., Zuylen, A.: Maximizing Influence in a Competitive Social Network: A Follower’s Perspective. In: International Conference on Electronic Commerce (2007)

    Google Scholar 

  5. Chen, W., Wang, Y., Yang, S.: Efficient Influence Maximization in Social Networks. In: International Conference on Knowledge Discovery and Data Mining (2009)

    Google Scholar 

  6. Domingos, P., Richardson, M.: Mining the Network Value of Customers. In: International Conference on Knowledge Discovery and Data Mining (2001)

    Google Scholar 

  7. Dorigo, M., Blum, C.: Ant Colony Optimization Theory: A Survey. Theoretical Computer Science 344 (2005)

    Google Scholar 

  8. Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the Spread of Influence through a Social Network. In: International Conference on Knowledge Discovery and Data Mining (2003)

    Google Scholar 

  9. Kempe, D., Kleinberg, J., Tardos, É.: Influential Nodes in a Diffusion Model for Social Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  10. Kostka, J., Oswald, Y.A., Wattenhofer, R.: Word of Mouth: Rumor Dissemination in Social Networks. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 185–196. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  11. Mossel, E., Roch, S.: Submodularity of Influence in Social Networks: From Local to Global. SIAM Journal on Computing 39(6), 2176–2188 (2010)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Opsahl, T., Agneessens, F., Skvoretz, J.: Node Centrality in Weighted Networks: Generalizing Degree and Shortest Paths. Social Networks 32(245), 245–251 (2010)

    CrossRef  Google Scholar 

  13. Richardson, M., Domingos, P.: Mining Knowledge-sharing Sites for Viral Marketing. In: International Conference on Knowledge Discovery and Data Mining (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, WS., Weng, SX. (2012). Application of the Ant Colony Optimization Algorithm to Competitive Viral Marketing. In: Maglogiannis, I., Plagianakos, V., Vlahavas, I. (eds) Artificial Intelligence: Theories and Applications. SETN 2012. Lecture Notes in Computer Science(), vol 7297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30448-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30448-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30447-7

  • Online ISBN: 978-3-642-30448-4

  • eBook Packages: Computer ScienceComputer Science (R0)