The Slashdot Zoo: Mining a Social Network with Negative Edges

Abstract

We analyse the corpus of user relationships of the Slashdot technology news site. The data was collected from the Slashdot Zoo feature where users of the website can tag other users as friends and foes, providing positive and negative endorsements. We adapt social network analysis techniques to the problem of negative edge weights. In particular, we consider signed variants of global network characteristics such as the clustering coefficient, node-level characteristics such as centrality and popularity measures, and link-level characteristics such as distances and similarity measures. We evaluate these measures on the task of identifying unpopular users, as well as on the task of predicting the sign of links and show that the network exhibits multiplicative transitivity which allows algebraic methods based on matrix multiplication to be used. We compare our methods to traditional methods which are only suitable for positively weighted edges.

arXiv comment10 pages, color, accepted at WWW 2009

References in corpus (1)

• On Proximity Measures for Graph Vertices

Cited by in corpus (22)

• A Comprehensive Survey on Community Detection with Deep Learning
• Dynamical Models Explaining Social Balance and Evolution of Cooperation
• Deep Network Embedding for Graph Representation Learning in Signed Networks
• Model-based clustering of large networks
• Predicting Community Evolution in Social Networks
• Different Approaches to Community Evolution Prediction in Blogosphere
• Glassy states of aging social networks
• Exploiting the Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications
• Polarization and multiscale structural balance in signed networks
• Coloring in the Links: Capturing Social Ties as They are Perceived
• Dynamics of Disagreement: Large-Scale Temporal Network Analysis Reveals Negative Interactions in Online Collaboration
• A Network Science perspective of Graph Convolutional Networks: A survey
• Systems Applications of Social Networks
• CSNE: Conditional Signed Network Embedding
• Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks
• Improving Recommendation Quality by Merging Collaborative Filtering and Social Relationships
• Advances in Scaling Community Discovery Methods for Signed Graph Networks
• Understanding Social Networks using Transfer Learning
• A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks
• Link Polarity Prediction from Sparse and Noisy Labels via Multiscale Social Balance
• Efficient Enumeration of the Optimal Solutions to the Correlation Clustering problem
• Stable Configurations in Social Networks