Pith. sign in

REVIEW

Link Prediction with Persistent Homology: An Interactive View

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

arxiv 2102.10255 v2 pith:VPHX52UU submitted 2021-02-20 cs.LG

classification cs.LG
keywords proposetopologicalalgorithmextendedfeaturegraphhomologylearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Link prediction is an important learning task for graph-structured data. In this paper, we propose a novel topological approach to characterize interactions between two nodes. Our topological feature, based on the extended persistent homology, encodes rich structural information regarding the multi-hop paths connecting nodes. Based on this feature, we propose a graph neural network method that outperforms state-of-the-arts on different benchmarks. As another contribution, we propose a novel algorithm to more efficiently compute the extended persistence diagrams for graphs. This algorithm can be generally applied to accelerate many other topological methods for graph learning tasks.

Discussion (0). Sign in to comment.

Pith tools