Uncovering the Mystery of Trust in An Online Social Network

Slides:



Advertisements
Similar presentations
Recommender Systems. Finding Trusted Information How many cows in Texas?
Advertisements

Analysis and Modeling of Social Networks Foudalis Ilias.
Yuan Yao Joint work with Hanghang Tong, Xifeng Yan, Feng Xu, and Jian Lu MATRI: A Multi-Aspect and Transitive Trust Inference Model 1 May 13-17, WWW 2013.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
1 Walking on a Graph with a Magnifying Glass Stratified Sampling via Weighted Random Walks Maciej Kurant Minas Gjoka, Carter T. Butts, Athina Markopoulou.
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.
Computing Trust in Social Networks
Minas Gjoka, UC IrvineWalking in Facebook 1 Walking in Facebook: A Case Study of Unbiased Sampling of OSNs Minas Gjoka, Maciej Kurant ‡, Carter Butts,
The Very Small World of the Well-connected. (19 june 2008 ) Lada Adamic School of Information University of Michigan Ann Arbor, MI
Recommender Systems. >1,000,000,000 Finding Trusted Information How many cows in Texas?
Modeling Relationship Strength in Online Social Networks Rongjing Xiang: Purdue University Jennifer Neville: Purdue University Monica Rogati: LinkedIn.
Using Transactional Information to Predict Link Strength in Online Social Networks Indika Kahanda and Jennifer Neville Purdue University.
By Chris Zachor.  Introduction  Background  Changes  Methodology  Data Collection  Network Topologies  Measures  Tools  Conclusion  Questions.
WALKING IN FACEBOOK: A CASE STUDY OF UNBIASED SAMPLING OF OSNS junction.
Network Characterization via Random Walks B. Ribeiro, D. Towsley UMass-Amherst.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Psychology 301 Chapters & Differences Between Two Means Introduction to Analysis of Variance Multiple Comparisons.
A Graph-based Friend Recommendation System Using Genetic Algorithm
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2013 Figures are taken.
Mining Social Network for Personalized Prioritization Language Techonology Institute School of Computer Science Carnegie Mellon University Shinjae.
Peer Centrality in Socially-Informed P2P Topologies Nicolas Kourtellis, Adriana Iamnitchi Department of Computer Science & Engineering University of South.
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Slides are modified from Lada Adamic
Network Community Behavior to Infer Human Activities.
Measuring Behavioral Trust in Social Networks
Socialbots and its implication On ONLINE SOCIAL Networks Md Abdul Alim, Xiang Li and Tianyi Pan Group 18.
Community-enhanced De-anonymization of Online Social Networks Shirin Nilizadeh, Apu Kapadia, Yong-Yeol Ahn Indiana University Bloomington CCS 2014.
KNN CF: A Temporal Social Network kNN CF: A Temporal Social Network Neal Lathia, Stephen Hailes, Licia Capra University College London RecSys ’ 08 Advisor:
Project 2 22C:021 Computer Science II : Data Structures.
1 Finding Spread Blockers in Dynamic Networks (SNAKDD08)Habiba, Yintao Yu, Tanya Y., Berger-Wolf, Jared Saia Speaker: Hsu, Yu-wen Advisor: Dr. Koh, Jia-Ling.
KAIST TS & IS Lab. CS710 Know your Neighbors: Web Spam Detection using the Web Topology SIGIR 2007, Carlos Castillo et al., Yahoo! 이 승 민.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
ITK. Ch 9 Segmentation Confidence Connected Isolated Connected Confidence Connected in Vector Images Jin-ju Yang.
Hao Ma, Dengyong Zhou, Chao Liu Microsoft Research Michael R. Lyu
Lecture 23: Structure of Networks
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Finding Dense and Connected Subgraphs in Dual Networks
Different Types of Data
Analysis of University Researcher Collaboration Network Using Co-authorship Jiadi Yao School of Electronic and Computer Science,
Greedy & Heuristic algorithms in Influence Maximization
Data Center Network Architectures
Jon Crowcroft Pan Hui Computer Laboratory University of Cambridge
Dijkstra’s shortest path Algorithm
Distributed voting application for handheld devices
Comparison of Social Networks by Likhitha Ravi
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Community detection in graphs
Significance analysis of microarrays (SAM)
Friend Recommendation with a Target User in Social Networking Services
Lecture 23: Structure of Networks
Generative Model To Construct Blog and Post Networks In Blogosphere
RankClus: Integrating Clustering with Ranking for Heterogeneous Information Network Analysis Yizhou Sun, Jiawei Han, Peixiang Zhao, Zhijun Yin, Hong Cheng,
Peer-to-Peer and Social Networks
Mayank Bhatt, Jayasi Mehar
Effective Social Network Quarantine with Minimal Isolation Costs
Apache Spark & Complex Network
The likelihood of linking to a popular website is higher
Performance Comparison of Tarry and Awerbuch Algorithms
Deep Belief Nets and Ising Model-Based Network Construction
Department of Computer Science University of York
Mining Collaboration Patterns
Lecture 23: Structure of Networks
Binghui Wang, Le Zhang, Neil Zhenqiang Gong
Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation Binghui Wang, Jinyuan Jia, and Neil.
GANG: Detecting Fraudulent Users in OSNs
Psych 231: Research Methods in Psychology
Topological Signatures For Fast Mobility Analysis
Advanced Topics in Data Mining Special focus: Social Networks
Presentation transcript:

Uncovering the Mystery of Trust in An Online Social Network Guangchi Liu, Qing Yang, Honggang Wang, Shaoen Wu and Mike P. Wittie Presentation By: Siddharth Pathak

What is Trust?

What is Trust? “Trust is a psychological state comprising the intention to accept vulnerability based upon positive expectations of the intentions or behaviors of another.”

3VSL & some terms.. OSN (Online Social Network) Direct Trust Indirect Trust Trustee – Trustor – Trust Opinion Individual Trust Public Trust Trust Community

Dataset OSN used is Advogato Trust levels: observer, apprentice, journeyer, & master

DIRECT TRUST

Public Trust Distribution While trust level is the edge attribute of the Advogato graph, public trust is the overall trust opinion a user received from the neighbors who give him certifications.

Trust Variance Trust variance defined as the average difference between a user’s received direct trust and his/her public trust. Compared to the null graph, the trust variance of advogato is smaller.

Assortativity There is a weak correlation between the public trust of a user and his/her neighbors Authors conclude that trust assortativity does not exist in Advogato, i.e., trustful and distrustful Advogato users are mixed together.

Asymmetry The mutual trust are asymmetric, but the difference is not substantial as randomly formed.

Public Trust & In Degree A moderate correlation between both

INDIRECT TRUST

Co-Citation, Coupling & Propogation Conclusion: the propagation model is the most applicable.

Individual Trust (Effect of Scope) First, randomly select 1000 trustor-trustee pairs which are directly connected. Then, compute the individual trust of each trustor-trustee pair by running 3VSL with various search scope, e.g., 1 hop, 2 hops and 3 hops Then, we compute the public trust of the trustee for each pair, and compare the absolute difference between the individual trust with various search scope) and public trust.

Individual Trust (Subjective vs Objective) First, randomly select 1000 trustor-trustee pairs which are directly connected. Then, we remove the direct trust edge and compute the individual trust for each trustor-trustee pair by running 3VSL with various search scope. Define the difference between the computed individual trust and removed direct trust as error.

G1: trustor-trustee pairs whose individual trust is accurate (error < 0.1) with a 2 hops search scope but inaccurate (error> 0.1) with a 4 hops search scope. G2: trustor-trustee pairs whose individual trust is accurate (error < 0.1) with a 4 hops search scope but inaccurate (error > 0.1) with a 2 hops search scope. Then, compute the public trust of the trustee for both G1 and G2. Finally, the differences between the public and individual trust, are computed, which are shown as a CDF plot.

Small Small World Phenomenon First, randomly select trustor-trustee pairs and group them based on their shortest paths ranging from 1 to 6 hops. Within each group, only keep 1000 pairs. Then, compute the individual trust from the trustor to the trustee by 3VSL. Finally, use public trust as the base line.

TRUST COMMUNITY DETECTION

Trust Community Detection by ACL First compute the mean direct trust in Advogato. Then run the ACL algorithm based on randomly selected seed node (from Advogato) Then compute the mean direct trust within this community, which is treated as the in community trust. Finally, repeat this process 1000 times and plot the CDF of the in community trust.

Trust of Out Community Nodes First randomly select a seed node from Advogato and generate a community around it (through executing ACL algorithm). Then, randomly pick two nodes: one is inside the community and the other one is outside the community. Finally, run 3VSL to compute the individual trust from the seed node (trustor) to these two nodes (trustees). Repeat 1000 times.

Ranking of In Community Nodes First randomly select a seed node, then generate a community and the ranking of its in community nodes by ACL. Then rank the nodes by their individual trust to the seed node. Then, three rankings (ACL, Individual and Public) are generated. Then compare the difference between the Individual and Public ranking (using pairwise Kendall tau coefficient) Repeat the process 1000 times.

CONCLUSION & RESULTS

The trust between users are asymmetric. High degree users are usually associated with high trust. Diversity in people’s opinions on the same person will affect indirect trust inference. Users live in many separate “small small worlds” from the perspective of trust and it is difficult to identify these “small small worlds” with existing random walk-based community detection algorithms, like, ACL.

Future Work Better algorithm for Trust Community Detection than random-walk ACL Exploring similar topologies in other OSNs

Thank You.