REVIEW 2 cited by
Predicting Positive and Negative Links in Online Social Networks
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
We study online social networks in which relationships can be either positive (indicating relations such as friendship) or negative (indicating relations such as opposition or antagonism). Such a mix of positive and negative links arise in a variety of online settings; we study datasets from Epinions, Slashdot and Wikipedia. We find that the signs of links in the underlying social networks can be predicted with high accuracy, using models that generalize across this diverse range of sites. These models provide insight into some of the fundamental principles that drive the formation of signed links in networks, shedding light on theories of balance and status from social psychology; they also suggest social computing applications by which the attitude of one user toward another can be estimated from evidence provided by their relationships with other members of the surrounding social network.
Forward citations
Cited by 2 Pith papers
-
Adaptive Spatiotemporal Augmentation for Improving Dynamic Graph Learning
STAA uses wavelet-based node activity scores to bias a time-aware random walk, producing an augmented adjacency matrix that improves dynamic GNN performance.
-
Efficient Kernelization Algorithm for Bipartite Graph Matching
MVM is a new kernelization algorithm for bipartite maximum matching that applies Karp-Sipser reduction rules with a claimed O(min(m log n, n^2)) time bound on CSR-style storage and faster measured runtimes than existi...
Discussion (0). Continue with ORCID to comment.