Skip to main content
Erschienen in: Cluster Computing 4/2020

02.01.2020

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

verfasst von: Alireza Abdollahpouri, Chiman Salavati, Jamal Arkat, Fardin Akhlaghian Tab, Zhaleh Manbari

Erschienen in: Cluster Computing | Ausgabe 4/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Xu, K., Li, J., Song, Y.: Identifying valuable customers on social networking sites for profit maximization. Expert Syst. Appl. 39(17), 13009–13018 (2012)CrossRef Xu, K., Li, J., Song, Y.: Identifying valuable customers on social networking sites for profit maximization. Expert Syst. Appl. 39(17), 13009–13018 (2012)CrossRef
2.
Zurück zum Zitat 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)CrossRef 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)CrossRef
3.
Zurück zum Zitat 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)MATHCrossRef 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)MATHCrossRef
4.
Zurück zum Zitat 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)MATHCrossRef 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)MATHCrossRef
5.
Zurück zum Zitat 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)CrossRef 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)CrossRef
6.
Zurück zum Zitat 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)CrossRef 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)CrossRef
7.
Zurück zum Zitat 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)CrossRef 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)CrossRef
8.
Zurück zum Zitat Salavati, C., Abdollahpouri, A., Manbari, Z.: Ranking nodes in complex networks based on local structure and improving closeness centrality. Neurocomputing 336, 36–45 (2019)CrossRef Salavati, C., Abdollahpouri, A., Manbari, Z.: Ranking nodes in complex networks based on local structure and improving closeness centrality. Neurocomputing 336, 36–45 (2019)CrossRef
9.
Zurück zum Zitat Rozin, P., Royzman, E.B.: Negativity bias, negativity dominance, and contagion. Personal. Soc. Psychol. Rev. 5(4), 296–320 (2001)CrossRef Rozin, P., Royzman, E.B.: Negativity bias, negativity dominance, and contagion. Personal. Soc. Psychol. Rev. 5(4), 296–320 (2001)CrossRef
10.
Zurück zum Zitat 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)CrossRef 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)CrossRef
11.
Zurück zum Zitat Taylor, S.E.: Asymmetrical effects of positive and negative events: the mobilization-minimization hypothesis. Psychol. Bull. 110(1), 67 (1991)CrossRef Taylor, S.E.: Asymmetrical effects of positive and negative events: the mobilization-minimization hypothesis. Psychol. Bull. 110(1), 67 (1991)CrossRef
12.
Zurück zum Zitat Baumeister, R.F., Bratslavsky, E., Finkenauer, C., Vohs, K.D.: Bad is stronger than good. Rev. General Psychol. 5(4), 323 (2001)CrossRef Baumeister, R.F., Bratslavsky, E., Finkenauer, C., Vohs, K.D.: Bad is stronger than good. Rev. General Psychol. 5(4), 323 (2001)CrossRef
13.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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)MathSciNetMATHCrossRef 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)MathSciNetMATHCrossRef
15.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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)MathSciNetMATH 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)MathSciNetMATH
18.
Zurück zum Zitat 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 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
19.
Zurück zum Zitat 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)MathSciNetMATHCrossRef 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)MathSciNetMATHCrossRef
20.
Zurück zum Zitat 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) 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)
21.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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)CrossRef 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)CrossRef
23.
Zurück zum Zitat Sela, A., Goldenberg, D., Ben-Gal, I., Shmueli, E.: Latent Viral Marketing, Concepts and Control Methods (2017). arXiv preprint arXiv:170401775 Sela, A., Goldenberg, D., Ben-Gal, I., Shmueli, E.: Latent Viral Marketing, Concepts and Control Methods (2017). arXiv preprint arXiv:170401775
24.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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)CrossRef 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)CrossRef
29.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)CrossRef Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)CrossRef
33.
Zurück zum Zitat Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1978)CrossRef Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1978)CrossRef
35.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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.
Zurück zum Zitat 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 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
39.
Zurück zum Zitat Brooke, A., Kendrick, D., Meeraus, A., Raman, R.: Generalized Algebraic Modeling System (GAMS): A User’s Guide. The Scientific Press, South San Francisco (1988) Brooke, A., Kendrick, D., Meeraus, A., Raman, R.: Generalized Algebraic Modeling System (GAMS): A User’s Guide. The Scientific Press, South San Francisco (1988)
40.
Zurück zum Zitat 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)CrossRef 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)CrossRef
Metadaten
Titel
A multi-objective model for identifying valuable nodes in complex networks with minimum cost
verfasst von
Alireza Abdollahpouri
Chiman Salavati
Jamal Arkat
Fardin Akhlaghian Tab
Zhaleh Manbari
Publikationsdatum
02.01.2020
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe 4/2020
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-019-03039-4

Weitere Artikel der Ausgabe 4/2020

Cluster Computing 4/2020 Zur Ausgabe

Premium Partner