Skip to main content
Springer Nature Link
Log in

A multi-objective model for identifying valuable nodes in complex networks with minimum cost

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Nowadays, social networks sites (SNs) are widely used in a variety of applications such as viral marketing. Given a huge number of users on SNs, the process of selecting appropriate users as the target set is key decision for enterprises to conduct cost-effective targeted marketing and reputation management. Several methods have been presented to find influential users for viral marketing in social networks. One of the weaknesses of previous methods is the selection of target sets who activate similar users and have high spreading ability in the whole network. In this paper, an optimization model is proposed to identify the most influential users of social networks in another view by splitting a big network into small parts as communities and considering both positive and negative interactions between users to create the influence graph. Our model takes the usefulness and similarity of the users into account and tries to select the most profitable users with the lowest possible similarity in which the number of target users is automatically determined. Assessments on real and synthetic networks indicate that the proposed method is capable to select a target set with high profit and gives better performance than other methods.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Xu, K., Li, J., Song, Y.: Identifying valuable customers on social networking sites for profit maximization. Expert Syst. Appl. 39(17), 13009–13018 (2012)

    Article  Google Scholar 

  2. Chen, D., Lü, L., Shang, M.-S., Zhang, Y.-C., Zhou, T.: Identifying influential nodes in complex networks. Phys A 391(4), 1777–1787 (2012)

    Article  Google Scholar 

  3. Gao, S., Ma, J., Chen, Z., Wang, G., Xing, C.: Ranking the spreading ability of nodes in complex networks based on local structure. Phys A 403, 130–147 (2014)

    Article  MATH  Google Scholar 

  4. Xu, W., Liang, W., Lin, X., Yu, J.X.: Finding top-k influential users in social networks under the structural diversity model. Inf. Sci. 355, 110–126 (2016)

    Article  MATH  Google Scholar 

  5. Zeng, Y., Chen, X., Cong, G., Qin, S., Tang, J., Xiang, Y.: Maximizing influence under influence loss constraint in social networks. Expert Syst. Appl. 55, 255–267 (2016)

    Article  Google Scholar 

  6. Rahimkhani, K., Aleahmad, A., Rahgozar, M., Moeini, A.: A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst. Appl. 42(3), 1353–1361 (2015)

    Article  Google Scholar 

  7. Salavati, C., Abdollahpouri, A., Manbari, Z.: BridgeRank: a novel fast centrality measure based on local structure of the network. Phys A 496, 635–653 (2017)

    Article  Google Scholar 

  8. Salavati, C., Abdollahpouri, A., Manbari, Z.: Ranking nodes in complex networks based on local structure and improving closeness centrality. Neurocomputing 336, 36–45 (2019)

    Article  Google Scholar 

  9. Rozin, P., Royzman, E.B.: Negativity bias, negativity dominance, and contagion. Personal. Soc. Psychol. Rev. 5(4), 296–320 (2001)

    Article  Google Scholar 

  10. Peeters, G., Czapinski, J.: Positive-negative asymmetry in evaluations: the distinction between affective and informational negativity effects. Eur. Rev. Soc. Psychol. 1(1), 33–60 (1990)

    Article  Google Scholar 

  11. Taylor, S.E.: Asymmetrical effects of positive and negative events: the mobilization-minimization hypothesis. Psychol. Bull. 110(1), 67 (1991)

    Article  Google Scholar 

  12. Baumeister, R.F., Bratslavsky, E., Finkenauer, C., Vohs, K.D.: Bad is stronger than good. Rev. General Psychol. 5(4), 323 (2001)

    Article  Google Scholar 

  13. Long, C., Wong, R.C.-W.: Minimizing seed set for viral marketing. In: 11th International Conference on Data Mining (ICDM), 2011 IEEE (2011). IEEE, pp. 427–436

  14. Lu, Z., Zhang, W., Wu, W., Kim, J., Fu, B.: The complexity of influence maximization problem in the deterministic linear threshold model. J. Combin. Optim. 24(3), 374–378 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: 10th International Conference on Data Mining (ICDM), 2010 IEEE (2010). IEEE, pp. 88–97

  16. Bakshy, E., Hofman, J.M., Mason, W.A., Watts, D.J.: Everyone's an influencer: quantifying influence on twitter. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining (2011). ACM, pp. 65–74

  17. Haimes, Y.Y.: On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans.Syst. Man Cybern. 1(3), 296–297 (1971)

    MathSciNet  MATH  Google Scholar 

  18. Vira, C., Haimes, Y.Y.: Multiobjective Decision Making: Theory and Methodology. North Holland Series in System Science and Engineering, vol. 8. North-Holland, Amsterdam (1983)

    MATH  Google Scholar 

  19. Bérubé, J.-F., Gendreau, M., Potvin, J.-Y.: An exact ϵ-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits. Eur. J. Oper. Res. 194(1), 39–50 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Goldenberg, J., Libai, B., Muller, E.: Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad. Market. Sci. Rev. 2001, 1 (2001)

    Google Scholar 

  21. Richardson, .M, Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002). ACM, pp. 61–70

  22. Golkar Amnieh, I., Kaedi, M.: Using estimated personality of social network members for finding influential nodes in viral marketing. Cybern. Syst. 46(5), 355–378 (2015)

    Article  Google Scholar 

  23. Sela, A., Goldenberg, D., Ben-Gal, I., Shmueli, E.: Latent Viral Marketing, Concepts and Control Methods (2017). arXiv preprint arXiv:170401775

  24. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003). ACM, pp. 137–146

  25. Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: International Colloquium on Automata, Languages, and Programming, 2005. Springer, Berlin, pp. 1127–1138

  26. Kimura M, Saito K Tractable models for information diffusion in social networks. In: European Conference on Principles of Data Mining and Knowledge Discovery, 2006. Springer, pp 259–271

  27. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance N cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007. ACM, pp 420–429

  28. Narayanam, R., Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. IEEE Trans. Autom. Sci. Eng. 8(1), 130–147 (2011)

    Article  Google Scholar 

  29. Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2009). ACM, pp. 199–208

  30. Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010. ACM, pp. 1029–1038

  31. Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010. ACM, pp. 1039–1048

  32. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)

    Article  Google Scholar 

  33. Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1978)

    Article  Google Scholar 

  34. Sabidussi, G.: The centrality index of a graph. Psychometrika 31(4), 581–603 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  35. Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2001). ACM, pp. 57–66

  36. Goyal, A., Lu, W.: Lakshmanan LV Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web (2011). ACM, pp. 47–48

  37. Goyal, A., Lu, W., Lakshmanan, L.V., Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: 11th International Conference on Data Mining (ICDM), 2011 IEEE (2011). IEEE, pp. 211–220

  38. Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410–421 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  39. Brooke, A., Kendrick, D., Meeraus, A., Raman, R.: Generalized Algebraic Modeling System (GAMS): A User’s Guide. The Scientific Press, South San Francisco (1988)

    Google Scholar 

  40. Breiger, R.L., Boorman, S.A., Arabie, P.: An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. J. Math. Psychol. 12(3), 328–383 (1975)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran

    Alireza Abdollahpouri, Chiman Salavati, Fardin Akhlaghian Tab & Zhaleh Manbari

  2. Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran

    Jamal Arkat

Authors
  1. Alireza Abdollahpouri
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chiman Salavati
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Jamal Arkat
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Fardin Akhlaghian Tab
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Zhaleh Manbari
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Alireza Abdollahpouri.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abdollahpouri, A., Salavati, C., Arkat, J. et al. A multi-objective model for identifying valuable nodes in complex networks with minimum cost. Cluster Comput 23, 2719–2733 (2020). https://doi.org/10.1007/s10586-019-03039-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-019-03039-4

Keywords