Integrating ant colony algorithm and node centrality to improve prediction of information diffusion in social networks

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One of the latest and most important research topics in the field of information diffusion, which has attracted many social network analyst experts in recent years, is how information is disseminated on social networks. In this paper, a new method is proposed by integration of ant colony algorithm and node centrality to increase the prediction accuracy of information diffusion paths on social networks. In the first stage of our approach, centrality of all nodes in the network is calculated. Then, based on the distances of nodes in the network and also ant colony algorithm, the optimal path of propagation is detected. After implementation of the proposed method, 4 real social network data sets were used to evaluate its performance. The evaluation results of all methods showed a better outcome for our method.

Cite

CITATION STYLE

APA

Majbouri Yazdi, K., Yazdi, A. M., Khodayi, S., Hou, J., Zhou, W., & Saedy, S. (2018). Integrating ant colony algorithm and node centrality to improve prediction of information diffusion in social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11342 LNCS, pp. 381–391). Springer Verlag. https://doi.org/10.1007/978-3-030-05345-1_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free