Sparsification of influence networks

@inproceedings{Mathioudakis2011SparsificationOI,
  title={Sparsification of influence networks},
  author={Michael Mathioudakis and Francesco Bonchi and Carlos Castillo and Aristides Gionis and Antti Ukkonen},
  booktitle={KDD},
  year={2011}
}
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… CONTINUE READING
Highly Cited
This paper has 139 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 88 extracted citations

A Graph Summarization: A Survey

View 9 Excerpts
Highly Influenced

A model-independent approach for efficient influence maximization in social networks

Social Network Analysis and Mining • 2015
View 5 Excerpts
Highly Influenced

Automatic Segmentation of Dynamic Network Sequences with Node Labels

IEEE Transactions on Knowledge and Data Engineering • 2018
View 2 Excerpts

139 Citations

0102030'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 139 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…