REVIEW 1 cited by
Link Prediction in Complex Networks: A Survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving mechanisms, and so on. This article summaries recent progress about link prediction algorithms, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods. We also introduce three typical applications: reconstruction of networks, evaluation of network evolving mechanism and classification of partially labelled networks. Finally, we introduce some applications and outline future challenges of link prediction algorithms.
Forward citations
Cited by 1 Pith paper
-
Learnable Spatial-Temporal Positional Encoding for Link Prediction
L-STEP learns time-evolving positional encodings for graph nodes via a learnable spectral filter and predicts links with MLPs only, matching or beating attention-based baselines on 13 temporal datasets.
Discussion (0). Continue with ORCID to comment.