Trace complexity of network inference

@inproceedings{Abrahao2013TraceCO,
  title={Trace complexity of network inference},
  author={Bruno D. Abrahao and Flavio Chierichetti and Robert D. Kleinberg and Alessandro Panconesi},
  booktitle={KDD},
  year={2013}
}
The network inference problem consists of reconstructing the edge set of a network given traces representing the chronology of infection times as epidemics spread through the network. This problem is a paradigmatic representative of prediction tasks in machine learning that require deducing a latent structure from observed patterns of activity in a network, which often require an unrealistically large number of resources (e.g., amount of available data, or computational time). A fundamental… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS

Citations

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

Inferring network topology from information cascades

2017 IEEE International Symposium on Information Theory (ISIT) • 2017
View 4 Excerpts
Highly Influenced

59 Citations

01020'14'15'16'17'18'19
Citations per Year
Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…