Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Knowledge Graph Data Management: Models, Methods, and Systems Kapitel lesen Erstes Kapitel lesen

2020 | OriginalPaper | Buchkapitel

Influence Maximization Based on Community Closeness in Social Networks

verfasst von : Qingqing Wu, Lihua Zhou, Yaqun Huang

Erschienen in: Web Information Systems Engineering

Verlag: Springer Singapore

Einloggen

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

search-config
loading …

Abstract

The research of Influence maximization (IM) has always been a hot research topic in network analysis, which aims to find the most influential users in social networks to maximize the reach of influence. In recent year, many studies have focused on the problem of IM to improve efficiency by taking advantage of the small-scale community structures. However, the existing community-based methods only consider the number of nodes in a community and ignore the density of edge connections in a community. In addition, existing method can only be applied to non-overlapping community structures. In this paper, we propose community closeness-based influence maximization algorithm (CCIM) to select most influential nodes. CCIM considers the influence of point-to-point and point-to-community, reflecting the micro-level and meso-level influence. The experimental results on synthetic and three real datasets verify CCIM outperforms the state-of-the-art baselines.

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Vorheriges Kapitel Cloud Service Access Frequency Estimation Based on a Stream Filtering Method
Nächstes Kapitel Can Reinforcement Learning Enhance Social Capital?
Literatur
1.
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, San Francisco, pp. 57–66 (2001)
2.
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, Edmonton, pp. 61–70 (2002)
3.
Budak, C., Agrawal, D., Abbadi, A.-E.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, WWW, Hyderabad, pp. 665–674 (2011)
4.
He, X., Song, G., Chen, W.: Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 12th SIAM International Conference on Data Mining, SDM, Anaheim, pp. 463–474 (2011)
5.
Leskovec, J., Krause, A., Guestrin, C.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429. ACM, San Jose (2007)
6.
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM, Washington (2003)
7.
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, pp. 47–48. ACM (2011)
8.
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, pp. 199–208. ACM, Paris (2009)
9.
Liu, H.-L., Ma, C., Xiang, B.-B.: Identifying multiple influential spreaders based on generalized closeness centrality. Phys. A 492, 2237–2248 (2018)CrossRef
10.
Zhu, J., Liu, Y., Yin, X.: A new structure-hole-based algorithm for influence maximization in large online social networks. IEEE Access 5, 23405–23412 (2017)CrossRef
11.
Kim, J., Kim, S.-K., Yu, H.: Scalable and parallelizable processing of influence maximization for large-scale social networks. In: 29th IEEE International Conference on Data Engineering, pp. 266–277. IEEE, Brisbane (2013)
12.
Liu, B., Cong, G., Zeng, Y.: Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans. Knowl. Data Eng. 26(8), 1904–1917 (2014)CrossRef
13.
Ko, Y.-Y., Chae, D.-K., Kim, S.-W.: Accurate path-based methods for influence maximization in social networks. In: Proceedings of the 25th International Conference Companion on World Wide Web, WWW, Geneva, pp. 59–60 (2016)
14.
Galstyan, A., Musoyan, V.: Maximizing influence propagation in networks with community structure. Phys. Rev. E 79(2), 056102 (2009)CrossRef
15.
Cao, T., Wu, X., Wang, S., Hu, X.: OASNET: an optimal allocation approach to influence maximization in modular social networks. In: ACM Symposium on Applied Computing, SAC, Sierre, pp. 1088–1094 (2010)
16.
Wang, Y., Cong, G., Song, G.: Community-based greedy algorithm for mining top-K influential nodes in mobile social network. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1039–1048. ACM, Washington (2010)
17.
Shang, J., Zhou, S., Li, X.: CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl.-Based Syst. 117, 88–100 (2017)CrossRef
18.
Shang, J., Wu, H.: IMPC: influence maximization based on multi-neighbor potential in community networks. Phys. A 512, 1085–1103 (2018)CrossRef
19.
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99(12), 7821–7826 (2002)MathSciNetCrossRef
20.
21.
Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4 Pt 2), 046110 (2008)CrossRef
22.
Lancichinetti, A., Fortunato, S., Kertész, János.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)CrossRef
Metadaten
Titel
Influence Maximization Based on Community Closeness in Social Networks
verfasst von
Qingqing Wu
Lihua Zhou
Yaqun Huang
Copyright-Jahr
2020
Verlag
Springer Singapore
Buch
Web Information Systems Engineering

Print ISBN: 978-981-15-3280-1

Electronic ISBN: 978-981-15-3281-8

Copyright-Jahr: 2020

DOI
https://doi.org/10.1007/978-981-15-3281-8_13