Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Approximating k-Spanner Problems for k2
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Mining knowledge-sharing sites for viral marketing
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Information diffusion through blogspace
Proceedings of the 13th international conference on World Wide Web
Tracking Information Epidemics in Blogspace
WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
The dynamics of viral marketing
ACM Transactions on the Web (TWEB)
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time
Information Processing and Management: an International Journal
Prediction of Information Diffusion Probabilities for Independent Cascade Model
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Discovering leaders from community actions
Proceedings of the 17th ACM conference on Information and knowledge management
Efficient influence maximization in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Meme-tracking and the dynamics of the news cycle
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Debugging complex software systems by means of pathfinder networks
Information Sciences: an International Journal
Two flow network simplification algorithms
Information Processing Letters
Learning influence probabilities in social networks
Proceedings of the third ACM international conference on Web search and data mining
Inferring networks of diffusion and influence
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
The Meme Ranking Problem: Maximizing Microblogging Virality
ICDMW '10 Proceedings of the 2010 IEEE International Conference on Data Mining Workshops
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing
Patterns of influence in a recommendation network
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A framework for path-oriented network simplification
IDA'10 Proceedings of the 9th international conference on Advances in Intelligent Data Analysis
Proceedings of the fifth ACM international conference on Web search and data mining
Finding influential seed successors in social networks
Proceedings of the 21st international conference companion on World Wide Web
Dynamic selection of activation targets to boost the influence spread in social networks
Proceedings of the 21st international conference companion on World Wide Web
Proceedings of the 15th International Conference on Extending Database Technology
Proceedings of the 21st ACM international conference on Information and knowledge management
Viral marketing for product cross-sell through social networks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Information propagation in microblog networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
StaticGreedy: solving the scalability-accuracy dilemma in influence maximization
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Ranking mechanisms for interaction networks
Proceedings of the 17th International Conference on Management of Data
| Hi-index | 0.00 |
We present Spine, an efficient algorithm for finding the "backbone" of an influence network. Given a social graph and a log of past propagations, we build an instance of the independent-cascade model that describes the propagations. We aim at reducing the complexity of that model, while preserving most of its accuracy in describing the data. We show that the problem is inapproximable and we present an optimal, dynamic-programming algorithm, whose search space, albeit exponential, is typically much smaller than that of the brute force, exhaustive-search approach. Seeking a practical, scalable approach to sparsification, we devise Spine, a greedy, efficient algorithm with practically little compromise in quality. We claim that sparsification is a fundamental data-reduction operation with many applications, ranging from visualization to exploratory and descriptive data analysis. As a proof of concept, we use Spine on real-world datasets, revealing the backbone of their influence-propagation networks. Moreover, we apply Spine as a pre-processing step for the influence-maximization problem, showing that computations on sparsified models give up little accuracy, but yield significant improvements in terms of scalability.