Skip to main content

2019 | OriginalPaper | Buchkapitel

CoIM: Community-Based Influence Maximization in Social Networks

verfasst von : Shashank Sheshar Singh, Kuldeep Singh, Ajay Kumar, Bhaskar Biswas

Erschienen in: Advanced Informatics for Computing Research

Verlag: Springer Singapore

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

search-config
loading …

Abstract

Influence maximization (IM) is the problem of identifying k most influential users (seed) in social networks to maximize influence spread. Despite some recent development achieved by the state-of-the-art greedy IM techniques, these works are not time-efficient for large-scale networks. To solve time-efficiency issue, we propose Community-based Influence Maximization (CoIM) algorithm. CoIM first partitions the network into sub-networks. Then it selects influential users from sub-networks based on their local influence. The experimental results on both synthetic and real datasets show that proposed algorithm performs better than greedy regarding time with the almost same level of memory-consumption and influence spread.

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 Chen, S., Fan, J., Li, G., Feng, J., Tan, K., Tang, J.: Online topic-aware influence maximization. Proc. VLDB Endow. 8(6), 666–677 (2015)CrossRef Chen, S., Fan, J., Li, G., Feng, J., Tan, K., Tang, J.: Online topic-aware influence maximization. Proc. VLDB Endow. 8(6), 666–677 (2015)CrossRef
2.
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, KDD 2009, pp. 199–208. ACM, New York (2009) 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, KDD 2009, pp. 199–208. ACM, New York (2009)
3.
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, KDD 2001, pp. 57–66. ACM, New York (2001) 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, KDD 2001, pp. 57–66. ACM, New York (2001)
5.
Zurück zum Zitat Gomez Rodriguez, M., Schölkopf, B.: Influence maximization in continuous time diffusion networks. In: Proceedings of the 29th International Conference on Machine Learning, pp. 313–320. Omnipress, New York, July 2012 Gomez Rodriguez, M., Schölkopf, B.: Influence maximization in continuous time diffusion networks. In: Proceedings of the 29th International Conference on Machine Learning, pp. 313–320. Omnipress, New York, July 2012
6.
Zurück zum Zitat Gomez-Rodriguez, M., Song, L., Du, N., Zha, H., Schölkopf, B.: Influence estimation and maximization in continuous-time diffusion networks. ACM Trans. Inf. Syst. 34(2), 9:1–9:33 (2016)CrossRef Gomez-Rodriguez, M., Song, L., Du, N., Zha, H., Schölkopf, B.: Influence estimation and maximization in continuous-time diffusion networks. ACM Trans. Inf. Syst. 34(2), 9:1–9:33 (2016)CrossRef
7.
Zurück zum Zitat Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011, pp. 47–48. ACM, New York (2011) Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011, pp. 47–48. ACM, New York (2011)
8.
Zurück zum Zitat Guo, L., Zhang, D., Cong, G., Wu, W., Tan, K.L.: Influence maximization in trajectory databases. IEEE Trans. Knowl. Data Eng. 29(3), 627–641 (2017)CrossRef Guo, L., Zhang, D., Cong, G., Wu, W., Tan, K.L.: Influence maximization in trajectory databases. IEEE Trans. Knowl. Data Eng. 29(3), 627–641 (2017)CrossRef
9.
Zurück zum Zitat Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 137–146. ACM, New York (2003) Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 137–146. ACM, New York (2003)
11.
Zurück zum Zitat Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web 1(1) (2007)CrossRef Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web 1(1) (2007)CrossRef
12.
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, KDD 2007, pp. 420–429. ACM, New York (2007) 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, KDD 2007, pp. 420–429. ACM, New York (2007)
13.
Zurück zum Zitat Li, G., Chen, S., Feng, J., Tan, K., Li, W.: Efficient location-aware influence maximization. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD 2014, pp. 87–98. ACM, New York (2014) Li, G., Chen, S., Feng, J., Tan, K., Li, W.: Efficient location-aware influence maximization. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD 2014, pp. 87–98. ACM, New York (2014)
14.
Zurück zum Zitat Li, H., Bhowmick, S.S., Sun, A., Cui, J.: Conformity-aware influence maximization in online social networks. VLDB J. 24(1), 117–141 (2015)CrossRef Li, H., Bhowmick, S.S., Sun, A., Cui, J.: Conformity-aware influence maximization in online social networks. VLDB J. 24(1), 117–141 (2015)CrossRef
15.
Zurück zum Zitat Li, Y., Zhang, D., Tan, K.L.: Real-time targeted influence maximization for online advertisements. Proc. VLDB Endow. 8(10), 1070–1081 (2015)CrossRef Li, Y., Zhang, D., Tan, K.L.: Real-time targeted influence maximization for online advertisements. Proc. VLDB Endow. 8(10), 1070–1081 (2015)CrossRef
16.
Zurück zum Zitat Lin, S.C., Lin, S.D., Chen, M.S.: A learning-based framework to handle multi-round multi-party influence maximization on social networks. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2015, pp. 695–704. ACM, New York (2015) Lin, S.C., Lin, S.D., Chen, M.S.: A learning-based framework to handle multi-round multi-party influence maximization on social networks. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2015, pp. 695–704. ACM, New York (2015)
17.
Zurück zum Zitat Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396–405 (2003)CrossRef Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396–405 (2003)CrossRef
18.
Zurück zum Zitat Mahajan, V., Muller, E., Bass, F.M.: New product diffusion models in marketing: a review and directions for research. J. Mark. 54(1), 1–26 (1990)CrossRef Mahajan, V., Muller, E., Bass, F.M.: New product diffusion models in marketing: a review and directions for research. J. Mark. 54(1), 1–26 (1990)CrossRef
19.
Zurück zum Zitat Paul, J.: The distribution of the flora in the alpine zone.1. New Phytol. 11(2), 37–50 (1912)CrossRef Paul, J.: The distribution of the flora in the alpine zone.1. New Phytol. 11(2), 37–50 (1912)CrossRef
20.
Zurück zum Zitat Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41–43 (2004)MathSciNetCrossRef Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41–43 (2004)MathSciNetCrossRef
21.
Zurück zum Zitat Teng, Y.W., Tai, C.H., Yu, P.S., Chen, M.S.: Revenue maximization on the multi-grade product, pp. 576–584 (2018)CrossRef Teng, Y.W., Tai, C.H., Yu, P.S., Chen, M.S.: Revenue maximization on the multi-grade product, pp. 576–584 (2018)CrossRef
23.
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: KDD (2010) Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: KDD (2010)
24.
Zurück zum Zitat Wu, P., Pan, L.: Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput. Netw. 123, 38–50 (2017)CrossRef Wu, P., Pan, L.: Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput. Netw. 123, 38–50 (2017)CrossRef
25.
Zurück zum Zitat Ye, M., Liu, X., Lee, W.C.: Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2012, pp. 671–680. ACM, New York (2012) Ye, M., Liu, X., Lee, W.C.: Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2012, pp. 671–680. ACM, New York (2012)
26.
Zurück zum Zitat Zhu, Y., Li, D., Zhang, Z.: Minimum cost seed set for competitive social influence. In: IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, pp. 1–9, April 2016 Zhu, Y., Li, D., Zhang, Z.: Minimum cost seed set for competitive social influence. In: IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, pp. 1–9, April 2016
Metadaten
Titel
CoIM: Community-Based Influence Maximization in Social Networks
verfasst von
Shashank Sheshar Singh
Kuldeep Singh
Ajay Kumar
Bhaskar Biswas
Copyright-Jahr
2019
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-13-3143-5_36