Learning from bees: An approach for influence maximization on viral campaigns

16Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

Abstract

Maximisation of influence propagation is a key ingredient to any viral marketing or sociopolitical campaigns. However, it is an NP-hard problem, and various approximate algorithms have been suggested to address the issue, though not largely successful. In this paper, we propose a bio-inspired approach to select the initial set of nodes which is significant in rapid convergence towards a sub-optimal solution in minimal runtime. The performance of the algorithm is evaluated using the re-tweet network of the hashtag #KissofLove on Twitter associated with the non-violent protest against the moral policing spread to many parts of India. Comparison with existing centrality based node ranking process the proposed method significant improvement on influence propagation. The proposed algorithm is one of the hardly few bio-inspired algorithms in network theory. We also report the results of the exploratory analysis of the network kiss of love campaign.

Cite

CITATION STYLE

APA

Sankar, C. P., Asharaf, S., & Kumar, K. S. (2016). Learning from bees: An approach for influence maximization on viral campaigns. PLoS ONE, 11(12). https://doi.org/10.1371/journal.pone.0168125

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