Nonparametric Link Prediction in Dynamic Networks
Abstract
We propose a nonparametric link prediction algorithm for a sequence of graph snapshots over time. The model predicts links based on the features of its endpoints, as well as those of the local neighborhood around the endpoints. This allows for different types of neighborhoods in a graph, each with its own dynamics (e.g, growing or shrinking communities). We prove the consistency of our estimator, and give a fast implementation based on locality-sensitive hashing. Experiments with simulated as well as five real-world dynamic graphs show that we outperform the state of the art, especially when sharp fluctuations or nonlinearities are present.
Cite
Text
Sarkar et al. "Nonparametric Link Prediction in Dynamic Networks." International Conference on Machine Learning, 2012.Markdown
[Sarkar et al. "Nonparametric Link Prediction in Dynamic Networks." International Conference on Machine Learning, 2012.](https://mlanthology.org/icml/2012/sarkar2012icml-nonparametric/)BibTeX
@inproceedings{sarkar2012icml-nonparametric,
title = {{Nonparametric Link Prediction in Dynamic Networks}},
author = {Sarkar, Purnamrita and Chakrabarti, Deepayan and Jordan, Michael I.},
booktitle = {International Conference on Machine Learning},
year = {2012},
url = {https://mlanthology.org/icml/2012/sarkar2012icml-nonparametric/}
}