A New BAT and PageRank Algorithm for Propagation Probability in Social Networks

Social networks have increasingly become important and popular in modern times. Moreover, the influence of social networks plays a vital role in various organizations, including government organizations, academic research organizations and corporate organizations. Therefore, strategizing the optimal...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied sciences Ročník 12; číslo 14; s. 6858
Hlavní autoři: Yeh, Wei-Chang, Zhu, Wenbo, Huang, Chia-Ling, Hsu, Tzu-Yun, Liu, Zhenyao, Tan, Shi-Yi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.07.2022
Témata:
Algorithms
Barabási–Albert model
binary-addition tree (BAT) algorithm
Information dissemination
PageRank algorithm
Personalized PageRank algorithm
Preferences
Probability
Propagation
propagation probability
Social network analysis
Social networks
Social research
Word of mouth advertising
ISSN:2076-3417, 2076-3417
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Social networks have increasingly become important and popular in modern times. Moreover, the influence of social networks plays a vital role in various organizations, including government organizations, academic research organizations and corporate organizations. Therefore, strategizing the optimal propagation strategy in social networks has also become more important. Increasing the precision of evaluating the propagation probability of social networks can indirectly influence the investment of cost, manpower and time for information propagation to achieve the best return. This study proposes a new algorithm, which includes a scale-free network, Barabási–Albert model, binary-addition tree (BAT) algorithm, PageRank algorithm, Personalized PageRank algorithm and a new BAT algorithm to calculate the propagation probability of social networks. The results obtained after implementing the simulation experiment of social network models show that the studied model and the proposed algorithm provide an effective method to increase the efficiency of information propagation in social networks. In this way, the maximum propagation efficiency is achieved with the minimum investment.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app12146858