{'fraction_non_alphanumeric': 0.020370370370370372, 'fraction_numerical': 0.0, 'mean_word_length': 5.45816733067729, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Identifying Topic-Sensitive Influential Spreaders in Social Networks

Identifying influential spreaders is an important issue in understanding the dynamics of information diffusion in social networks. It is to find a small subset of nodes, which can spread the information or influence to the largest number of nodes. The conventional approaches consider information diffusion through the network in a coarse-grained manner, without taking into account the topical features of information content and users. However, for messages with different topics, the target influential spreaders may vary largely. In this paper, we propose to harness historical propagation data to learn the information diffusion probabilities on topic-level, based on which we use a greedy algorithm to iteratively select a set of influential nodes for a given topic. Specially, we design a three-stage algorithm named TopicRank to mine the most influential spreaders with respect to a specific topic. Given observed propagation data, we first use Latent Dirichlet Allocation (LDA) model to learn a topic mixture for each propagation message. Then, the topic-level diffusion probability of an edge is computed by exploiting the propagation actions occurred to it and the topic distribution of these propagation messages. Last, based on the learned topic-level diffusion probabilities, we apply optimized greedy algorithm CLEF to identify influential nodes with respect to a specific topic. Experimental results show that our method significantly outperforms state-of-the-art methods when used for topic-sensitive information spread maximization.