Supervised temporal link prediction in large-scale real-world networks
Bibliographic Data
| ID | 4659000 |
|---|---|
| Authors | Gerrit Jan De Bruin (0000-0003-4936-879X, Leiden University, corresponding author), Cor J Veenman (0000-0002-2645-1198, Leiden University), H J van den Herik (0000-0001-9751-761X, Leiden University), Frank W Takes (0000-0001-5468-1030, Leiden University) |
| Year | 2021 |
| Volume | 11 |
| Issue | 1 |
| Publication date | 2021-12-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Social Network Analysis and Mining (JOURNAL) |
| Journal identifiers | ISSN: 1869-5450 • E-ISSN: 1869-5469 |
| Publisher | Springer Science and Business Media LLC (PUBLISHER) |
| DOI | 10.1007/s13278-021-00787-3 |
| OpenAlex | W3196249578 |
| Language | EN |
| Citations received | 1 |
| References cited | 54 |
Link prediction is a well-studied technique for inferring the missing edges between two nodes in some static representation of a network. In modern day social networks, the timestamps associated with each link can be used to predict future links between so-far unconnected nodes. In these so-called temporal networks, we speak of temporal link prediction. This paper presents a systematic investigation of supervised temporal link prediction on 26 temporal, structurally diverse, real-world networks ranging from thousands to a million nodes and links. We analyse the relation between global structural properties of each network and the obtained temporal link prediction performance, employing a set of well-established topological features commonly used in the link prediction literature. We report on four contributions. First, using temporal information, an improvement of prediction performance is observed. Second, our experiments show that degree disassortative networks perform better in temporal link prediction than assortative networks. Third, we present a new approach to investigate the distinction between networks modelling discrete events and networks modelling persistent relations. Unlike earlier work, our approach utilises information on all past events in a systematic way, resulting in substantially higher link prediction performance. Fourth, we report on the influence of the temporal activity of the node or the edge on the link prediction performance, and show that the performance differs depending on the considered network type. In the studied information networks, temporal information on the node appears most important. The findings in this paper demonstrate how link prediction can effectively be improved in temporal networks, explicitly taking into account the type of connectivity modelled by the temporal edge. More generally, the findings contribute to a better understanding of the mechanisms behind the evolution of networks
Data mining · Enhanced Data Rates for GSM Evolution · Machine learning · Predictive modelling · Temporal database · Timestamp · Advanced Graph Neural Networks · Complex Network Analysis Techniques · Computer Science · Opinion Dynamics and Social Influence · Artificial Intelligence
SciPy 1.0
The link‐prediction problem for social networks
Graph evolution
Assortative Mixing in Networks
DeepWalk
Exploring Network Structure, Dynamics, and Function using NetworkX
The origin of bursts and heavy tails in human dynamics
Link prediction in complex networks
Node2vec
Trust Management for the Semantic Web
Triadic closure in two-mode networks
Friends and neighbors on the Web
Spectral evolution with approximated eigenvalue trajectories for link prediction
| Citations per year | 0.25 |
|---|---|
| Citation span | 2022 - 2022 (1) |
| Highly cited | No |