Real-Time Targeted-Influence Queries over Large Graphs

Social networks are important communication and information media. Individuals in a social network share information and influence each other through their social connections. Understanding social influence and information diffusion is a fundamental research endeavor and it has important applications in online social advertising and viral marketing. In this work, we introduce the Targeted-Influence problem (TIP): Given a network G = (V, ε) and a model of influence, we want to be able to estimate in real-time (e.g. a few seconds per query) the influence of a subset of users S over another subset of users T, for any possible query (S; T), S, T ⊆ V. To do so, we allow an efficient preprocessing. We provide the first scalable real-time algorithm for TIP. Our algorithm requires Õ(|V| + |ε|) space and preprocessing time, and it provides a provable approximation of the influence of S over T, for every subsets of nodes S, T ⊆ V in the query with large enough influence. The running time for answering each query (a.k.a query stage) is theoretically guaranteed to be Õ(|S| + |T|) in general undirected and for directed graphs under certain assumptions, supported by experiments. We also introduce the Snapshot model as our model of influence, which extends and includes as special case both the Independent Cascade and the Linear Threshold models. The analysis and the theoretical guarantees of our algorithms hold under the more general Snapshot model. Finally, we perform an extensive experimental analysis, demonstrating the accuracy, efficiency, and scalability of our methods.

[1]  Mi-Yen Yeh,et al.  On influence maximization to target users in the presence of multiple acceptances , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[2]  Qing Zhu,et al.  Reachability Querying: Can It Be Even Faster? , 2017, IEEE Transactions on Knowledge and Data Engineering.

[3]  Joel Oren,et al.  Influence at Scale: Distributed Computation of Complex Contagion in Networks , 2015, KDD.

[4]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[5]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.

[6]  Edith Cohen,et al.  Sketch-based Influence Maximization and Computation: Scaling up with Guarantees , 2014, CIKM.

[7]  E. Rogers,et al.  Diffusion of innovations , 1964, Encyclopedia of Sport Management.

[8]  Charu C. Aggarwal,et al.  Querying and Tracking Influencers in Social Streams , 2016, WSDM.

[9]  Kian-Lee Tan,et al.  Real-time Targeted Influence Maximization for Online Advertisements , 2015, Proc. VLDB Endow..

[10]  Peter H. Reingen,et al.  Social Ties and Word-of-Mouth Referral Behavior , 1987 .

[11]  Yang Xiang,et al.  Efficiently answering reachability queries on very large directed graphs , 2008, SIGMOD Conference.

[12]  Nicola Barbieri,et al.  Online Topic-aware Influence Maximization Queries , 2014, EDBT.

[13]  Le Song,et al.  Scalable Influence Estimation in Continuous-Time Diffusion Networks , 2013, NIPS.

[14]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[15]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[16]  Haixun Wang,et al.  Distance-Constraint Reachability Computation in Uncertain Graphs , 2011, Proc. VLDB Endow..

[17]  Jong-Ryul Lee,et al.  A Query Approach for Influence Maximization on Specific Users in Social Networks , 2015, IEEE Transactions on Knowledge and Data Engineering.

[18]  Jacob Goldenberg,et al.  Using Complex Systems Analysis to Advance Marketing Theory Development , 2001 .

[19]  Lei Chen,et al.  The Reachability Query over Distributed Uncertain Graphs , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[20]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[21]  Chuan Zhou,et al.  Personalized influence maximization on social networks , 2013, CIKM.

[22]  Enhong Chen,et al.  Diversified social influence maximization , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[23]  Bernhard Schölkopf,et al.  Influence Maximization in Continuous Time Diffusion Networks , 2012, ICML.

[24]  Aristides Gionis,et al.  Fast Reliability Search in Uncertain Graphs , 2014, EDBT.

[25]  Edith Cohen,et al.  Distance-Based Influence in Networks: Computation and Maximization , 2014 .

[26]  Takuya Akiba,et al.  Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths , 2013, CIKM.

[27]  Vijay Mahajan,et al.  New Product Diffusion Models in Marketing: A Review and Directions for Research: , 1990 .

[28]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[29]  Li Guo,et al.  A Note on Influence Maximization in Social Networks from Local to Global and Beyond , 2014 .

[30]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[31]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[32]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..