Access the full text.
Sign up today, get DeepDyve free for 14 days.
Eric Balkanski, A. Rubinstein, Yaron Singer (2015)
The limitations of optimization from samplesProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
Pedro Domingos, Matthew Richardson (2001)
Mining the network value of customers
Johan Håstad (1999)
Clique is hard to approximate within n1-ϵActa Mathematica 182 (1999), 182
Robert Chen, Brendan Lucier, Yaron Singer, Vasilis Syrgkanis (2017)
Robust Optimization for Non-Convex Objectives
B. Abrahao, Flavio Chierichetti, Robert Kleinberg, A. Panconesi (2013)
Trace complexity of network inferenceProceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
J. Håstad (1999)
Clique is hard to approximate withinn1−εActa Mathematica, 182
Amit Goyal, F. Bonchi, L. Lakshmanan (2011)
A Data-Based Approach to Social Influence MaximizationProc. VLDB Endow., 5
M. Gomez-Rodriguez, J. Leskovec, A. Krause (2010)
Inferring networks of diffusion and influenceProceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Youze Tang, Xiaokui Xiao, Yanchen Shi (2014)
Influence maximization: near-optimal time complexity meets practical efficiencyProceedings of the 2014 ACM SIGMOD International Conference on Management of Data
Paul Erdős, Alfréd Rényi (1960)
On the evolution of random graphsPublication of the Mathematical Institute of the Hungarian Academy of Sciences, 5
Kazumi Saito, M. Kimura, K. Ohara, H. Motoda (2009)
Learning Continuous-Time Information Diffusion Model for Social Behavioral Data Analysis
Seth Myers, J. Leskovec (2010)
On the Convexity of Latent Social Network InferenceArXiv, abs/1010.5504
A. Yadav, Bryan Wilder, E. Rice, R. Petering, Jaih Craddock, Amanda Yoshioka-Maxwell, M. Hemler, Laura Onasch-Vera, Milind Tambe, Darlene Woo (2017)
Influence Maximization in the Field: The Arduous Journey from Emerging to Deployed Application
J. Leskovec, Deepayan Chakrabarti, J. Kleinberg, C. Faloutsos, Zoubin Ghahramani (2008)
Kronecker Graphs: An Approach to Modeling NetworksArXiv, abs/0812.4905
Yu Wang, G. Cong, Guojie Song, Kunqing Xie (2010)
Community-based greedy algorithm for mining top-K influential nodes in mobile social networksProceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
(1990)
Asymptotics in High Dimension for Percolation
Kazumi Saito, M. Kimura, K. Ohara, H. Motoda (2010)
Generative Models of Information Diffusion with Asynchronous Timedelay
J. Goldenberg, B. Libai, E. Muller (2001)
Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-MouthMarketing Letters, 12
P. Erdos, A. Rényi (1984)
On the evolution of random graphsTransactions of the American Mathematical Society, 286
Amit Goyal, F. Bonchi, L. Lakshmanan, Suresh Venkatasubramanian (2012)
On minimizing budget and time in influence propagation over social networksSocial Network Analysis and Mining, 3
M. Gomez-Rodriguez, Le Song, Hadi Daneshmand, B. Scholkopf (2016)
Estimating Diffusion Networks: Recovery Conditions, Sample Complexity and Soft-thresholding AlgorithmJ. Mach. Learn. Res., 17
Manuel Gomez-Rodriguez, Jure Leskovec, Andrease Krause (2012)
Inferring networks of diffusion and influenceACM Transactions on Knowledge Discovery from Data, 5
Wei Chen, L. Lakshmanan, Carlos Castillo (2013)
Information and Influence Propagation in Social Networks
Nan Du, Le Song, M. Gomez-Rodriguez, H. Zha (2013)
Scalable Influence Estimation in Continuous-Time Diffusion NetworksAdvances in neural information processing systems, 26
Irit Dinur, David Steurer (2013)
Analytical approach to parallel repetitionProceedings of the forty-sixth annual ACM symposium on Theory of computing
Noam Berger, B. Bollobás, C. Borgs, J. Chayes, O. Riordan (2003)
Degree distribution of the FKP network model
J. Leskovec, Andreas Krause, Carlos Guestrin, C. Faloutsos, J. Vanbriesen, N. Glance (2007)
Cost-effective outbreak detection in networks
N. Alon, I. Benjamini, A. Stacey (2002)
Percolation on finite graphs and isoperimetric inequalitiesAnnals of Probability, 32
B. Bollobás (1984)
The evolution of random graphsTransactions of the American Mathematical Society, 286
Mark Granovetter (1978)
Threshold Models of Collective BehaviorAmerican Journal of Sociology, 83
D. Kempe, J. Kleinberg, É. Tardos (2003)
Maximizing the spread of influence through a social network
Chi Wang, Wei Chen, Yajun Wang (2018)
Data Mining and Knowledge DiscoveryMathematical Principles of the Internet
Praneeth Netrapalli, S. Sanghavi (2012)
Learning the graph of epidemic cascades
M. Gomez-Rodriguez, B. Scholkopf (2012)
Submodular Inference of Diffusion Networks from Multiple TreesArXiv, abs/1205.1671
G. Nemhauser, L. Wolsey, M. Fisher (1978)
An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 14
Abhijin Adiga, C. Kuhlman, H. Mortveit, A. Vullikanti (2013)
Sensitivity of Diffusion Dynamics to Network UncertaintyJ. Artif. Intell. Res., 51
Eric Balkanski, Nicole Immorlica, Yaron Singer (2017)
The Importance of Communities for Learning to InfluenceArXiv, abs/1801.07355
Wei Chen, Yajun Wang, Yang Yuan (2014)
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered ArmsJ. Mach. Learn. Res., 17
J. Bedő, Cheng Ong (2016)
Multivariate spearman's ρ for aggregating ranks using copulasJournal of Machine Learning Research, 17
Meghna Lowalekar, Pradeep Varakantham, Akshat Kumar (2016)
Robust Influence Maximization: (Extended Abstract)
Niv Buchbinder, Moran Feldman, J. Naor, Roy Schwartz (2014)
Submodular Maximization with Cardinality Constraints
Jacob Goldenberg, Barak Libai, Eitan Muller (2001)
Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automataAcademy of Marketing Science Review 2001 (2001), 2001
Youze Tang, Yanchen Shi, Xiaokui Xiao (2015)
Influence Maximization in Near-Linear Time: A Martingale ApproachProceedings of the 2015 ACM SIGMOD International Conference on Management of Data
Wei Chen, Yifei Yuan, Li Zhang (2010)
Scalable Influence Maximization in Social Networks under the Linear Threshold Model2010 IEEE International Conference on Data Mining
M. Gomez-Rodriguez, D. Balduzzi, B. Scholkopf (2011)
Uncovering the Temporal Dynamics of Diffusion Networks
S. Khanna, Brendan Lucier (2014)
Influence Maximization in Undirected Networks
Siyu Lei, S. Maniu, Luyi Mo, Reynold Cheng, P. Senellart (2015)
Online Influence MaximizationProceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
K. Campbell, Barrett Lee (1991)
Name generators in surveys of personal networksSocial Networks, 13
Hadi Daneshmand, M. Gomez-Rodriguez, Le Song, B. Scholkopf (2014)
Estimating Diffusion Network Structures: Recovery Conditions, Sample Complexity & Soft-thresholding AlgorithmProceedings of the ... International Conference on Machine Learning. International Conference on Machine Learning, 2014
Wei Chen, Yajun Wang, Siyu Yang (2009)
Efficient influence maximization in social networks
Wei Chen, Tian Lin, Zihan Tan, Mingfei Zhao, Xuren Zhou (2016)
Robust Influence MaximizationProceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
J. Leskovec, L. Backstrom, J. Kleinberg (2009)
Meme-tracking and the dynamics of the news cycle
Eric Balkanski, A. Rubinstein, Yaron Singer (2016)
The Power of Optimization from Samples
Elchanan Mossel, S. Roch (2006)
On the Submodularity of Influence in Social Networks
Andreas Krause, H. McMahan, Carlos Guestrin, Anupam Gupta (2008)
Robust Submodular Observation SelectionJournal of Machine Learning Research, 9
Elchanan Mossel, Sebastien Roch (2010)
Submodularity of influence in social networks: From local to globalSIAM Journal on Computing 39 (2010), 39
Nan Du, Yingyu Liang, Maria-Florina Balcan, Le Song (2014)
Influence Function Learning in Information Diffusion NetworksProceedings of the ... International Conference on Machine Learning. International Conference on Machine Learning, 2014
Chi Wang, Wei Chen, Yajun Wang (2012)
Scalable influence maximization for independent cascade model in large-scale social networksData Mining and Knowledge Discovery 25 (2012), 25
H. Narasimhan, D. Parkes, Yaron Singer (2015)
Learnability of Influence in Networks
J. Goldenberg, B. Libai, E. Muller (2001)
Using Complex Systems Analysis to Advance Marketing Theory Development
A. Hassidim, Yaron Singer (2016)
Submodular Optimization under NoiseArXiv, abs/1601.03095
C. Borgs, Mickey Brautbar, J. Chayes, Brendan Lucier (2012)
Maximizing Social Influence in Nearly Optimal Time
In the well-studied Influence Maximization problem, the goal is to identify a set of k nodes in a social network whose joint influence on the network is maximized. A large body of recent work has justified research on Influence Maximization models and algorithms with their potential to create societal or economic value. However, in order to live up to this potential, the algorithms must be robust to large amounts of noise, for they require quantitative estimates of the influence, which individuals exert on each other; ground truth for such quantities is inaccessible, and even decent estimates are very difficult to obtain. We begin to address this concern formally. First, we exhibit simple inputs on which even very small estimation errors may mislead every algorithm into highly suboptimal solutions. Motivated by this observation, we propose the Perturbation Interval model as a framework to characterize the stability of Influence Maximization against noise in the inferred diffusion network. Analyzing the susceptibility of specific instances to estimation errors leads to a clean algorithmic question, which we term the Influence Difference Maximization problem. However, the objective function of Influence Difference Maximization is NP-hard to approximate within a factor of O(n1) for any > 0. Given the infeasibility of diagnosing instability algorithmically, we focus on finding influential users robustly across multiple diffusion settings. We define a Robust Influence Maximization framework wherein an algorithm is presented with a set of influence functions. The algorithm’s goal is to identify a set of k nodes who are simultaneously influential for all influence functions, compared to the (function-specific) optimum solutions. We show strong approximation hardness results for this problem unless the algorithm gets to select at least a logarithmic factor more seeds than the optimum solution. However, when enough extra seeds may be selected, we show that techniques of Krause et al. can be used to approximate the optimum robust influence to within a factor of 11/e. We evaluate this bicriteria approximation algorithm against natural heuristics on several real-world datasets. Our experiments indicate that the worst-case hardness does not necessarily translate into bad performance on real-world datasets; all algorithms perform fairly well.
ACM Transactions on Knowledge Discovery from Data (TKDD) – Association for Computing Machinery
Published: Aug 31, 2018
Keywords: Social networks
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.