New paper on maximizing the spread of influence in social networks
The ENGINE group member, Radosław Michalski, altogether with Michał Weskida published an article on maximizing the spread of influence in social networks. In this work the authors perform a study on the usability of the evolutionary algorithm in this task. The results indicate that this approach is able to outperform other methods, especially when time constraints apply, e.g., for streaming scenarios.
The work has been published in the February issue of the Journal of Computational Science: Weskida, M., Michalski, R.: Finding Influentials in Social Networks using Evolutionary Algorithm. Journal of Computational Science (JCR-listed journal), Vol. 31, pp. 77-85, DOI:https://doi.org/10.1016/j.jocs.2018.12.010