Link Prediction in Networks with Nodes Attributes by Similarity Propagation

Ling Chen; Maosheng Jiang; Yonxiang Chen

Link Prediction in Networks with Nodes Attributes by Similarity Propagation

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1502.04380 v1 pith:RGII3W76 submitted 2015-02-15 cs.SI physics.soc-ph

Maosheng Jiang , Yonxiang Chen , Ling Chen This is my paper · ORCID

classification cs.SIphysics.soc-ph

keywords linkattributesnodessimilaritynetworkspredictionaccordingalgorithm

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

The problem of link prediction has attracted considerable recent attention from various domains such as sociology, anthropology, information science, and computer sciences. A link prediction algorithm is proposed based on link similarity score propagation by a random walk in networks with nodes attributes. In the algorithm, each link in the network is assigned a transmission probability according to the similarity of the attributes on the nodes connected by the link. The link similarity score between the nodes are then propagated via the links according to their transmission probability. Our experimental results show that it can obtain higher quality results on the networks with node attributes than other algorithms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Learning Peer Influence Probabilities with Linear Contextual Bandits
cs.LG 2025-10 conditional novelty 6.0 of 10

In a linear contextual bandit setting with k network interventions per round, cumulative regret and influence-probability estimation error obey a rate trade-off, and a new algorithm, InfluenceCB, can attain any point ...

Pith tools