J. Leskovec, D. Huttenlocher, J. Kleinberg Paper Review by Rachel Katz S IGNED N ETWORKS IN S OCIAL M EDIA.

Slides:



Advertisements
Similar presentations
CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu Lecture 27 – Overview of probability concepts 1.
Advertisements

Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Positive and Negative Relationships Chapter 5, from D. Easley and J. Kleinberg book.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Strong and Weak Ties Chapter 3, from D. Easley and J. Kleinberg book.
Jure Leskovec, CMU Lars Backstrom, Cornell Ravi Kumar, Yahoo! Research Andrew Tomkins, Yahoo! Research.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 3 Ýmir Vigfússon.
Chapter 10: Estimating with Confidence
Chapter 8: Estimating with Confidence
Based on chapter 3 in Networks, Crowds and markets (by Easley and Kleinberg) Roy Mitz Supervised by: Prof. Ronitt Rubinfeld November 2014 Strong and weak.
EE462 MLCV Lecture Introduction of Graphical Models Markov Random Fields Segmentation Tae-Kyun Kim 1.
1 Yuxiao Dong *$, Jie Tang $, Sen Wu $, Jilei Tian # Nitesh V. Chawla *, Jinghai Rao #, Huanhuan Cao # Link Prediction and Recommendation across Multiple.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
By: Roma Mohibullah Shahrukh Qureshi
Friends and social networks. Strong and Weak Ties Strong ties: Intense attachment Often reinforced by other ties Weak ties: Acquaintances May link otherwise.
Computing Trust in Social Networks
Cascading Behavior in Large Blog Graphs: Patterns and a model offence.
CHAPTER 8 Estimating with Confidence
PSY 307 – Statistics for the Behavioral Sciences Chapter 8 – The Normal Curve, Sample vs Population, and Probability.
CHAPTER 23 Inference for Means.
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
Introduction to Hypothesis Testing
The Erdös-Rényi models
Modeling Information Diffusion in Networks with Unobserved Links Quang Duong Michael P. Wellman Satinder Singh Computer Science and Engineering University.
Why study educational psychology?
CHAPTER 8 Estimating with Confidence
+ The Practice of Statistics, 4 th edition – For AP* STARNES, YATES, MOORE Chapter 8: Estimating with Confidence Section 8.1 Confidence Intervals: The.
Single- Subject Research Designs
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
Statistics and Quantitative Analysis U4320 Segment 8 Prof. Sharyn O’Halloran.
Two Approaches to Calculating Correlated Reserve Indications Across Multiple Lines of Business Gerald Kirschner Classic Solutions Casualty Loss Reserve.
F INDING B ALANCE IN S OCIAL N ETWORKS What is BALANCE ? These are BALANCED TRIADS. They are considered less stressful arrangements. The first is balanced.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Predicting Positive and Negative Links in Online Social Networks
B ELLWORK 10-3/6 What roles do you fulfill in your life? School, family, friends, work, etc. Which of these did you choose?
Online Social Networks and Media
Micro-Simulation of Diffusion of Warnings Cindy Hui Mark Goldberg Malik Magdon-Ismail William A. Wallace Rensselaer Polytechnic Institute This material.
The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Applied Quantitative Analysis and Practices LECTURE#31 By Dr. Osman Sadiq Paracha.
DeepDive Model Dongfang Xu Ph.D student, School of Information, University of Arizona Dec 13, 2015.
Arc Consistency CPSC 322 – CSP 3 Textbook § 4.5 February 2, 2011.
Jure Leskovec (Stanford), Daniel Huttenlocher and Jon Kleinberg (Cornell)
Simulation. Simulation is a way to model random events, such that simulated outcomes closely match real-world outcomes. By observing simulated outcomes,
Unit 4 Lesson 3 (5.3) Summarizing Bivariate Data 5.3: LSRL.
D EPARTMENT /S EMESTER (ECE – III SEM) NETWORK THEORY SECTION-D Manav Rachna University 1.
C OMMUNITIES AND B ALANCE IN S IGNED N ETWORKS : S PECTRAL A PPROACH -Pranay Anchuri*, Malik Magdon Ismail Rensselaer Polytechnic Institute, NY.
Chapter 5 Lesson 5.2 Summarizing Bivariate Data 5.2: LSRL.
Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University
The simultaneous evolution of author and paper networks
MGT 307 Week 4 Learning Team Evaluating Performance Through Motivation and Conflict Management Discussion To purchase this material click on below link.
Inference about the slope parameter and correlation
CHAPTER 8 Estimating with Confidence
Effects of User Similarity in Social Media Ashton Anderson Jure Leskovec Daniel Huttenlocher Jon Kleinberg Stanford University Cornell University Avia.
Social Networks Analysis
CHAPTER 8 Estimating with Confidence
Predicting Positive and Negative Links in Online Social Networks
Networks with Signed Edges
CHAPTER 8 Estimating with Confidence
Why Social Graphs Are Different Communities Finding Triangles
+ – If we look at any two people in the group in isolation,
CHAPTER 8 Estimating with Confidence
Emotions in Social Networks: Distributions, Patterns, and Models
Networks with Signed Edges
CHAPTER 8 Estimating with Confidence
GANG: Detecting Fraudulent Users in OSNs
CHAPTER 8 Estimating with Confidence
CHAPTER 8 Estimating with Confidence
CHAPTER 8 Estimating with Confidence
CHAPTER 8 Estimating with Confidence
CHAPTER 8 Estimating with Confidence
Presentation transcript:

J. Leskovec, D. Huttenlocher, J. Kleinberg Paper Review by Rachel Katz S IGNED N ETWORKS IN S OCIAL M EDIA

N ETWORK S TRUCTURES

S TRUCTURAL B ALANCE T HEORY  Considers undirected signed triads of three individuals  Apply to signed networks: disregard the directions of the links Triad T 3 : mutual friends Triad T 1 : common enemy Triad T 2 : common friend Triad T 0 : mutual enemies  T 3 (balanced) and T 1  More plausible  Should be more prevalent in networks (overrepresented relative to chance)  Weak Structural Balance  Only T 2 triads are implausible in real networks

T HEORY OF S TATUS  Considers directed networks of signed links  Positive cycles are directed triads with positive links from A to B to C back to A Note: The sign of a link from A to B is generated by A

B ALANCE VS. S TATUS ? ?

U NDIRECTED N ETWORKS

Structural Balance Theory Weak Structural Balance Theory Network Observations T 3 Triads Over- represented Over- represented, by 40% T 2 Triads Under- represented Under- represented, by 50-75% T 1 Triads Over- represented No reason to favor one over the other Relative abundances vary between datasets T 0 Triads Under- represented

E VOLVING D IRECTED N ETWORKS ABC Generative Baseline 101 Receptive Baseline 1/210

E VOLVING D IRECTED N ETWORKS  Balance Theory Conflicts  Positive cycles are underrepresented  When A  B and B  C links are positive, negative C  A links are overrepresented (predicted by status in previous example)  In the case of joint positive endorsement (where X links positively to A and B), the link closing the triad (from A to B) is more likely to be positive than the generative baseline of A, but less likely to be positive than the receptive baseline of B Balance theory simply suggests the link should be positive  Theory of Status  More effective at explaining local patterns of signed links  Extends to capture richer behavior (ie: evolution over time)

S TATUS T HEORY : M OTIVATING E XAMPLE

 Suppose A and B have each received a positive evaluation from a third player X  Since B has been positively evaluated by another team member, B is more likely to have above-average skill So, the evaluation that A gives B should be more likely to be positive than an evaluation given by A to a random team member  Since A has been positively evaluated by another team member, A is more likely to have above-average skill So, the evaluation that A gives B should be less likely to be positive than an evaluation received by B from a random team member  Context causes the sign of the A-B link to deviate from the random baseline in different directions depending on point of view

S TATUS T HEORY : C ONTEXTUALIZED L INKS  For a type t of c-link, look at the set of all c-links of this type  Generative Baseline for type t Sum of the generative baselines for all nodes A i  Generative Surprise s g (t) Signed number of standard deviations by which the actual number of positive A i -B i edges differs from the expectation  Receptive Baseline for type t Sum of the receptive baselines for all nodes B i  Receptive Surprise s r (t) Signed number of standard deviations of difference

S TATUS T HEORY : C ONTEXTUALIZED L INKS t1t1 t3t3 t4t4 t6t6 t5t5 t2t2 t7t7 t8t8 t 11 t 12 t 14 t 13 t 15 t 16 t9t9 t 10

S TATUS T HEORY : R OLE OF S TATUS  Assign status values to c-links  Assign node X status 0  If X links positively to A, or if A links negatively to X Assign node A status 1  Otherwise, assign node A status -1  If X links positively to B, or if B links negatively to X Assign node A status 1  Otherwise, assign node B status -1

T HEORY E VALUATION

StatusBalance

T HEORY E VALUATION  Predictions of status perform much better than predictions of structural balance on the vast majority of c-types (13-14 out of 16 are consistent)  Joint endorsement (t 9 ) – X links positively to A and B  Counterpoint of joint endorsement (t 8 ) – A and B link negatively to X  Positive cycle (t 11 )  Cases where Status Theory fails  Types where A has low status relative to X and B  Types where A and B both have low status relative to X Suggests that users may be relying on balance-based reasoning in this situation (if we both like a third party, we should like each other)

R ECIPROCATION OF D IRECTED E DGES

E MBEDDEDNESS

S INGLE -S IGN N ETWORKS

C ONCLUSION  Different predictions for frequency of patterns of signed links  Balance: when considering relationships between three people, only one or all three should be positive  Status: when a person A makes a positive link to person B, A is asserting that B has higher status  Strong consistency in how models fit data across the datasets  Balance theory is a reasonable approximation to the structure of signed networks when they are viewed as undirected graphs A link is more likely to be positive when endpoints have multiple neighbors in common  Status theory better captures properties when the networks are viewed as directed graphs that grow over time Inferences about the sign of a link can be drawn from mutual relationships with third parties

T HANK Y OU !