Advanced search
1 file | 4.72 MB Add to list

Exploring the performance of continuous-time dynamic link prediction algorithms

Raphaël Romero (UGent) , Maarten Buyl (UGent) , Tijl De Bie (UGent) and Jefrey Lijffijt (UGent)
Author
Organization
Project
Abstract
Dynamic Link Prediction (DLP) addresses the prediction of future links in evolving networks. However, accurately portraying the performance of DLP algorithms poses challenges that might impede progress in the field. Importantly, common evaluation pipelines usually calculate ranking or binary classification metrics, where the scores of observed interactions (positives) are compared with those of randomly generated ones (negatives). However, a single metric is not sufficient to fully capture the differences between DLP algorithms, and is prone to overly optimistic performance evaluation. Instead, an in-depth evaluation should reflect performance variations across different nodes, edges, and time segments. In this work, we contribute tools to perform such a comprehensive evaluation. (1) We propose Birth-Death diagrams, a simple but powerful visualization technique that illustrates the effect of time-based train-test splitting on the difficulty of DLP on a given dataset. (2) We describe an exhaustive taxonomy of negative sampling methods that can be used at evaluation time. (3) We carry out an empirical study of the effect of the different negative sampling strategies. Our comparison between heuristics and state-of-the-art memory-based methods on various real-world datasets confirms a strong effect of using different negative sampling strategies on the test area under the curve (AUC). Moreover, we conduct a visual exploration of the prediction, with additional insights on which different types of errors are prominent over time.
Keywords
dynamic graphs, link prediction, evaluation, SERIES

Downloads

  • Ds756.pdf
    • full text (Published version)
    • |
    • open access
    • |
    • PDF
    • |
    • 4.72 MB

Citation

Please use this url to cite or link to this publication:

MLA
Romero, Raphaël, et al. “Exploring the Performance of Continuous-Time Dynamic Link Prediction Algorithms.” APPLIED SCIENCES-BASEL, vol. 14, no. 8, 2024, doi:10.3390/app14083516.
APA
Romero, R., Buyl, M., De Bie, T., & Lijffijt, J. (2024). Exploring the performance of continuous-time dynamic link prediction algorithms. APPLIED SCIENCES-BASEL, 14(8). https://doi.org/10.3390/app14083516
Chicago author-date
Romero, Raphaël, Maarten Buyl, Tijl De Bie, and Jefrey Lijffijt. 2024. “Exploring the Performance of Continuous-Time Dynamic Link Prediction Algorithms.” APPLIED SCIENCES-BASEL 14 (8). https://doi.org/10.3390/app14083516.
Chicago author-date (all authors)
Romero, Raphaël, Maarten Buyl, Tijl De Bie, and Jefrey Lijffijt. 2024. “Exploring the Performance of Continuous-Time Dynamic Link Prediction Algorithms.” APPLIED SCIENCES-BASEL 14 (8). doi:10.3390/app14083516.
Vancouver
1.
Romero R, Buyl M, De Bie T, Lijffijt J. Exploring the performance of continuous-time dynamic link prediction algorithms. APPLIED SCIENCES-BASEL. 2024;14(8).
IEEE
[1]
R. Romero, M. Buyl, T. De Bie, and J. Lijffijt, “Exploring the performance of continuous-time dynamic link prediction algorithms,” APPLIED SCIENCES-BASEL, vol. 14, no. 8, 2024.
@article{01HY2ZFH91PMP6Y5RK2B3J5FKB,
  abstract     = {{Dynamic Link Prediction (DLP) addresses the prediction of future links in evolving networks. However, accurately portraying the performance of DLP algorithms poses challenges that might impede progress in the field. Importantly, common evaluation pipelines usually calculate ranking or binary classification metrics, where the scores of observed interactions (positives) are compared with those of randomly generated ones (negatives). However, a single metric is not sufficient to fully capture the differences between DLP algorithms, and is prone to overly optimistic performance evaluation. Instead, an in-depth evaluation should reflect performance variations across different nodes, edges, and time segments. In this work, we contribute tools to perform such a comprehensive evaluation. (1) We propose Birth-Death diagrams, a simple but powerful visualization technique that illustrates the effect of time-based train-test splitting on the difficulty of DLP on a given dataset. (2) We describe an exhaustive taxonomy of negative sampling methods that can be used at evaluation time. (3) We carry out an empirical study of the effect of the different negative sampling strategies. Our comparison between heuristics and state-of-the-art memory-based methods on various real-world datasets confirms a strong effect of using different negative sampling strategies on the test area under the curve (AUC). Moreover, we conduct a visual exploration of the prediction, with additional insights on which different types of errors are prominent over time.}},
  articleno    = {{3516}},
  author       = {{Romero, Raphaël and Buyl, Maarten and De Bie, Tijl and Lijffijt, Jefrey}},
  issn         = {{2076-3417}},
  journal      = {{APPLIED SCIENCES-BASEL}},
  keywords     = {{dynamic graphs,link prediction,evaluation,SERIES}},
  language     = {{eng}},
  number       = {{8}},
  pages        = {{23}},
  title        = {{Exploring the performance of continuous-time dynamic link prediction algorithms}},
  url          = {{http://doi.org/10.3390/app14083516}},
  volume       = {{14}},
  year         = {{2024}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: