Skip to main content
SpringerLink
Log in

MODM: multi-objective diffusion model for dynamic social networks using evolutionary algorithm

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

A lot of research efforts have been made to model the diffusion process in social networks that varies from adoption of products in marketing strategies to disease and virus spread. Previously, a diffusion process is usually considered as a single-objective optimization problem, in which different heuristics or approximate algorithms are applied to optimize an objective of spreading single piece of information that captures the notion of diffusion. However, in real social networks individuals simultaneously receive several pieces of information during their communication. Single-objective solutions are inadequate for collective spread of several information pieces. Therefore, in this paper, we propose a Multi-Objective Diffusion Model (MODM) that allows the modeling of complex and nonlinear phenomena of multiple types of information exchange, and calculate the information worth of each individual from different aspects of information spread such as score, influence and diversity. We design evolutionary algorithm to achieve the multi-objectives in single diffusion process. Through extensive experiments on a real world data set, we have observed that MODM leads to a richer and more realistic class of diffusion model compared to a single objective. This signifies the correlation between the importance of each individual and his information processing capability. Our results indicate that some individuals in the network are naturally and significantly better connected in terms of receiving information irrespective of the starting position of the diffusion process.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Fig. 2
Algorithm 2
Algorithm 3
Algorithm 4
Fig. 3a
Fig. 3b
Fig. 4a
Fig. 4b
Fig. 5a
Fig. 5b
Fig. 5c
Fig. 6
Fig. 7a
Fig. 7b

Similar content being viewed by others

Notes

  1. We use information and piece of information interchangeably throughout the paper.

References

  1. Agrawal D, Budak C, Abbadi AE (2011) Information diffusion in social networks: observing and influencing societal interests. In: Proceedings of the 37th international conference on very large data bases, pp 1512–1513

    Google Scholar 

  2. Fox S (2011) The social life of health information. Technical report, Pew Internet & American Life Project

  3. Gilbert E, Karahalios K (2009) Predicting tie strength with social media. In: Proceedings of the 27th international conference on human factors in computing systems, pp 211–220

    Google Scholar 

  4. Rodriguez M, Leskovec J, Krause A (2010) Inferring networks of diffusion and influence. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1019–1028

    Chapter  Google Scholar 

  5. Aral S, Walker D (2011) Creating social contagion through viral product design: a randomized trial of peer influence in networks. Manag Sci 57(9):1623–1639

    Article  Google Scholar 

  6. Bakshy E, Rosenn I, Marlow C, Adamic L (2012) The role of social networks in information diffusion. In: Proceeding of the 21st ACM conference on the world wide web, pp 519–528

    Chapter  Google Scholar 

  7. Bakshy E, Karrer B, Adamic L (2009) Social influence and the diffusion of user-created content. In: Proceedings of the 10th ACM conference on electronic commerce, pp 325–334

    Google Scholar 

  8. Anagnostopoulos A, Kumar R, Mahdian M (2008) Influence and correlation in social networks. In: Proceedings of the 14th internal conference on knowledge discover and data mining, pp 7–15

    Google Scholar 

  9. Adar E, Adamic E, Lada A (2005) Tracking information epidemics in blogspace. In: Proceedings of IEEE/WIC/ACM international conference on web intelligence, pp 207–214

    Google Scholar 

  10. Huckfeldt R, Sprague J (1991) Discussant effects on vote choice: intimacy, structure and interdependence. J Polit 53(1):122–158

    Article  Google Scholar 

  11. Rogers EM (1995) Diffusion of innovations. Free Press, New York

    Google Scholar 

  12. Aral S, Brynjolfssen E, Alstyne MV (2007) Productivity effects of information diffusion in networks. MIT Center for Digital Business, paper 234

  13. Christakis N, Fowler J (2007) The spread of obesity in a large social network over 32 years. N Engl J Med 357:370–379

    Article  Google Scholar 

  14. Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence in a social network. In: Proceedings of the 9th international conference on knowledge discovery and data mining, pp 137–146

    Google Scholar 

  15. Kempe D, Kleinberg J, Tardos É (2005) Influential nodes in a diffusion model for social networks. In: Proceedings of the 32nd international conference on automata, languages and programming, pp 1127–1138

    Chapter  Google Scholar 

  16. Saito K, Kimura M, Ohara K, Motoda H (2009) Learning continuous-time information diffusion model for social behavioral data analysis. In: Proceedings of the advances in machine learning, pp 322–337

    Chapter  Google Scholar 

  17. Goldenberg J, Libai B, Muller E (2001) Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Academy of Marketing Science Review

  18. Lahiri M, Cebrian M (2010) The genetic algorithm as a general diffusion model for social networks. In: Proceedings of the 24th AAAI conference on artificial intelligence, pp 494–499

    Google Scholar 

  19. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman, Reading

    MATH  Google Scholar 

  20. Payne J, Eppstein M (2006) Emergent mating topologies in spatially structured genetic algorithms. In: Proceedings of the 8th GECCO, pp 207–214

    Google Scholar 

  21. Holland H (2000) Building blocks, cohort genetic algorithms, and hyperplane-defined functions. Evol Comput 8(4):373–391

    Article  MathSciNet  Google Scholar 

  22. http://www.cs.cmu.edu/~enron/ [Aug 25, 2012]

  23. Bader DA, Kintali S, Madduri K, Mihail M (2007) Approximating betweenness centrality. In: Proceedings of the 5th workshop on algorithms and models for the web-graph, pp 134–137

    Google Scholar 

  24. Jing Y, Baluja S (2008) PageRank for product image search. In: Proceedings of WWW, pp 307–316

    Chapter  Google Scholar 

  25. Liu Z, Wang C, Zou Q, Wang H (2010) Clustering coefficient queries on massive dynamic social networks. In: Proceedings of the 11th international conference on web-age information management, pp 115–126

    Chapter  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (No. 2012047478).

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Kyung Hee University, Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, 446-701, Korea

    Iram Fatima, Muhammad Fahim, Young-Koo Lee & Sungyoung Lee

Authors
  1. Iram Fatima
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Muhammad Fahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Young-Koo Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sungyoung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Young-Koo Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fatima, I., Fahim, M., Lee, YK. et al. MODM: multi-objective diffusion model for dynamic social networks using evolutionary algorithm. J Supercomput 66, 738–759 (2013). https://doi.org/10.1007/s11227-013-0947-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-013-0947-2

Keywords

Search

Navigation