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.

10 pages, color, accepted at WWW 2009

References in corpus (1)

• On Proximity Measures for Graph Vertices

Cited by in corpus (9)

• Predicting Community Evolution in Social Networks
• Glassy states of aging social networks
• Exploiting the Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications
• Coloring in the Links: Capturing Social Ties as They are Perceived
• Systems Applications of Social Networks
• Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks
• Understanding Social Networks using Transfer Learning
• Efficient Enumeration of the Optimal Solutions to the Correlation Clustering problem
• Link Polarity Prediction from Sparse and Noisy Labels via Multiscale Social Balance