Predicting Positive and Negative Links in Online Social Networks. Jure Leskovec Stanford university, Daniel Huttenlocher , Jon Kleinberg Cornell University www 2010 2010-07-09 Presented by Seong yun Lee. Outline. Introduction Dataset Description Predicting Edge Sign
Predicting Positive and Negative Links in Online Social Networks
Daniel Huttenlocher, Jon Kleinberg
Presented by Seongyun Lee
2 * 2 * 2 * 2 = 16
U <=+ W =>- V
Let G be a signed, undirectedcomplete graph in which each triangle has an odd number of positive edges. Then the nodes of G can be partitioned into two sets A and B (where one of A or B may be empty), such that all edges within A and B are positive, and all edges with one end in A and the other in B are negative.
Let G be a signed, directed tournament, and suppose that all sets of three nodes in G are status-consistent. Then it possible to order the nodes of G as v1, v2, . . . , vn in such a way that each positive edge (vi, vj) satisfies i < j, and each negative edge (vi, vj ) satisfies i > j.