An Algorithm based on Efficient Influence Maximization applied to Social Network

Ying Hong Wang, Lin Hui, Yi Cheng Chen, Meng Shiu Chaung

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Social Network is becoming more and more common. This has also caused the wave to find influence maximization problem by the academic community. The earliest Influence maximization problem was proposed by Kempe. Kleinberg and Tardosy in 2003. Given a social network G and a constant k, finding k nodes in G which can influence most nodes in the diffusion model. As the Social Network is getting larger, the previous algorithms in this case, whether in the IC or the LT Model, take more time to execute, and these algorithms do not have good Scalability. The method in this paper given a deterministic value for edges and develops an efficient algorithm. It not only can reduce the time required for implementation, but also ensures the accuracy of results. And the experimental results show that our algorithm is better than the previous algorithm, and has good scalability.

Original languageEnglish
Title of host publicationProceedings - 2020 International Computer Symposium, ICS 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages576-581
Number of pages6
ISBN (Electronic)9781728192550
DOIs
StatePublished - Dec 2020
Event2020 International Computer Symposium, ICS 2020 - Tainan, Taiwan
Duration: 17 Dec 202019 Dec 2020

Publication series

NameProceedings - 2020 International Computer Symposium, ICS 2020

Conference

Conference2020 International Computer Symposium, ICS 2020
Country/TerritoryTaiwan
CityTainan
Period17/12/2019/12/20

Keywords

  • Cluster
  • Influence maximization problem
  • Virtual marketing

Fingerprint

Dive into the research topics of 'An Algorithm based on Efficient Influence Maximization applied to Social Network'. Together they form a unique fingerprint.

Cite this