Time-sensitive influence maximization in social networks. (December 2015)

• Record Type: Journal Article
• Authors: Mohammadi, Azadeh; Saraee, Mohamad; Mirzaei, Abdolreza
• Is Part Of: Journal of information science. Volume 41:Number 6(2015)
• Page Start: 765
• Page End: 778
• Publication Date: 2015-12
• Subjects: Approximation analysis -- influence maximization -- information diffusion -- social networks -- time-sensitive diffusion; Information science -- Periodicals; Information science; Periodicals; 020.5
• DOI: 10.1177/0165551515602808
• Languages: English
• ISSNs: 0165-5515

Abstract

One of the fundamental issues in social networks is the influence maximization problem, where the goal is to identify a small subset of individuals such that they can trigger the largest number of members in the network. In real-world social networks, the propagation of information from a node to another may incur a certain amount of time delay; moreover, the value of information may decrease over time. So not only the coverage size, but also the propagation speed matters. In this paper, we propose the Time-Sensitive Influence Maximization (TSIM) problem, which takes into account the time dependence of the information value. Considering the time delay aspect, we develop two diffusion models, namely the Delayed Independent Cascade model and the Delayed Linear Threshold model. We show that the TSIM problem is NP-hard under these models but the spread function is monotone and submodular. Thus, a greedy approximation algorithm can achieve a 1 − 1/ e approximation ratio. Moreover, we propose two time-sensitive centrality measures and compare their performance with the greedy algorithm. We evaluate our methods on four real-world datasets. Experimental results show that the proposed algorithms outperform existing methods, which ignore the decay of information value over time.