Abstract
This paper studies the problem of identifying a single contagion source when partial timestamps of a contagion process are available. We formulate the source localization problem as a ranking problem on graphs, where infected nodes are ranked according to their likelihood of being the source. Two ranking algorithms, cost-based ranking and tree-based ranking, are proposed in this paper. Experimental evaluations with synthetic and real-world data show that our algorithms significantly improve the ranking accuracy compared with four existing algorithms.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1217-1248 |
| Number of pages | 32 |
| Journal | Data Mining and Knowledge Discovery |
| Volume | 30 |
| Issue number | 5 |
| DOIs | |
| State | Published - Sep 1 2016 |
Keywords
- Contagion process
- Information source localization
- Partial timestamps
- Ranking on graphs
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Computer Networks and Communications
Fingerprint
Dive into the research topics of 'Locating the contagion source in networks with partial timestamps'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS