© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Stemming the spread of rumors in a social network SocioElite.

Slides:



Advertisements
Similar presentations
Diffuse Musings James Moody Duke University, Sociology Duke Network Analysis Center SAMSI Complex Networks Workshop Aug/Sep.
Advertisements

Single Source Shortest Paths
Outline LP formulation of minimal cost flow problem
Social network partition Presenter: Xiaofei Cao Partick Berg.
Size-estimation framework with applications to transitive closure and reachability Presented by Maxim Kalaev Edith Cohen AT&T Bell Labs 1996.
* Bellman-Ford: single-source shortest distance * O(VE) for graphs with negative edges * Detects negative weight cycles * Floyd-Warshall: All pairs shortest.
De-anonymizing social networks Arvind Narayanan, Vitaly Shmatikov.
Influence and Passivity in Social Media Daniel M. Romero, Wojciech Galuba, Sitaram Asur, and Bernardo A. Huberman Social Computing Lab, HP Labs.
Peer-to-Peer and Social Networks Centrality measures.
Michael Ghoorchian. Edsger W. Dijkstra ( ) Dutch Computer Scientist Received Turing Award for contribution to developing programming languages.
Relationship Mining Network Analysis Week 5 Video 5.
Cristian Lumezanu Dave Levin Neil Spring PeerWise Discovery and Negotiation of Faster Paths.
CIKM’2008 Presentation Oct. 27, 2008 Napa, California
A Statistical Model for Domain- Independent Text Segmentation Masao Utiyama and Hitoshi Isahura Presentation by Matthew Waymost.
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Centrality and Prestige HCC Spring 2005 Wednesday, April 13, 2005 Aliseya Wright.
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
CS294-6 Reconfigurable Computing Day 16 October 15, 1998 Retiming.
More Graph Algorithms Weiss ch Exercise: MST idea from yesterday Alternative minimum spanning tree algorithm idea Idea: Look at smallest edge not.
TelosCAM: Identifying Burglar Through Networked Sensor-Camera Mates with Privacy Protection Presented by Qixin Wang Shaojie Tang, Xiang-Yang Li, Haitao.
Routing Protocol Pertemuan 21 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
EDA (CS286.5b) Day 18 Retiming. Today Retiming –cycle time (clock period) –C-slow –initial states –register minimization.
Processor Pipelines and Their Properties for Static WCET Analysis Jakob Engblom and Bengt Jonsson Presented by Kiran Seth.
ECE 250 Algorithms and Data Structures Douglas Wilhelm Harder, M.Math. LEL Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Final Projects CIS /SYA Spring 2011.
Leveraging Big Data: Lecture 11 Instructors: Edith Cohen Amos Fiat Haim Kaplan Tova Milo.
Social Network Analytics Manage your campaign Obama-style Marketing, Advertising and Fundraising TORUX SNA
Opinion mining in social networks Student: Aleksandar Ponjavić 3244/2014 Mentor: Profesor dr Veljko Milutinović.
Presented by: Kamakhaya Argulewar Guided by: Prof. Shweta V. Jain
A Distributed and Privacy Preserving Algorithm for Identifying Information Hubs in Social Networks M.U. Ilyas, Z Shafiq, Alex Liu, H Radha Michigan State.
Spectral coordinate of node u is its location in the k -dimensional spectral space: Spectral coordinates: The i ’th component of the spectral coordinate.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Advanced Software Engineering PROJECT. 1. MapReduce Join (2 students)  Focused on performance analysis on different implementation of join processors.
MapReduce and Graph Data Chapter 5 Based on slides from Jimmy Lin’s lecture slides ( (licensed.
Alias Detection Using Social Network Analysis Ralf Holzer, Bradley Malin, Latanya Sweeney LinkKDD 2005 Advisor: Dr. Koh Jia-Ling Reporter: Che-Wei,
Social Network Analysis (1) LING 575 Fei Xia 01/04/2011.
Science: Graph theory and networks Dr Andy Evans.
Peer Centrality in Socially-Informed P2P Topologies Nicolas Kourtellis, Adriana Iamnitchi Department of Computer Science & Engineering University of South.
Shortest Path Algorithms. Definitions Variants  Single-source shortest-paths problem: Given a graph, finding a shortest path from a given source.
Finding Top-k Shortest Path Distance Changes in an Evolutionary Network SSTD th August 2011 Manish Gupta UIUC Charu Aggarwal IBM Jiawei Han UIUC.
1 Improving the Risk Management Capability of the Reliability and Maintainability Program An introduction to the philosophy behind the AIAA S-102 Performance-Based.
Slides are modified from Lada Adamic
Introduction to Graph Theory
Data Structures & Algorithms Shortest Paths Richard Newman based on book by R. Sedgewick and slides by S. Sahni.
Basic Linear Algebra Subroutines (BLAS) – 3 levels of operations Memory hierarchy efficiently exploited by higher level BLAS BLASMemor y Refs. FlopsFlops/
COS 420 Day 15. Agenda Finish Individualized Project Presentations on Thrusday Have Grading sheets to me by Friday Group Project Discussion Goals & Timelines.
1 NETWORKING 2012 Parallel and Distributed Systems Group, Delft University of Technology, the Netherlands May 22, 2012 Reducing the History in Decentralized.
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.
Networks are connections and interactions. Networks are present in every aspect of life. Examples include economics/social/political sciences. Networks.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Modeling and Visualizing Information Propagation in Microblogging Platforms Chien-Tung Ho, Cheng-Te Li, and Shou-De Lin National Taiwan University ASONAM.
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Root Cause Localization on Power Networks Zhen Chen, ECEE, Arizona State University Joint work with Kai Zhu and Lei Ying.
1 Discovering Web Communities in the Blogspace Ying Zhou, Joseph Davis (HICSS 2007)
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
1/54 Rumor Source Detection: monitor placement Ding-Zhu Du Department of Computer Science University of Texas at Dallas.
A Viewpoint-based Approach for Interaction Graph Analysis
MEIKE: Influence-based Communities in Networks
Nuffield Free-Standing Mathematics Activity
Tutorial 12 Biological networks.
Community detection in graphs
Peer-to-Peer and Social Networks
Centrality in Social Networks
Department of Computer Science University of York
Making Change Coins: 2 and
Detect rumor sources 2019/1/3
A Network Science Approach to Fake News Detection on Social Media
Networks Kruskal’s Algorithm
Navigation and Propagation in Networks
Presentation transcript:

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Stemming the spread of rumors in a social network SocioElite

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Social Media - Lots of upsides! 2

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Provides an excellent platform to share information

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Not all information is positive or reliable 4

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. What if ?  The Egyptian Government had a mechanism to limit the spread of the anti-campaign  Could the revolution have been avoided?  Nestle had a way to nullify GreenPeace’s campaign  Could Nestle have saved it’s reputation?

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Problem Statement Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism to control the spread. Objectives: Given a campaign, identify its potential origin/sources Determine the effect of the campaign across the nodes Identify nodes that can potentially stem the flow of the campaign Design mechanisms to limit the spread of the rumour

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Part 1: Diffusion modeling Part 3: Seeding and targeting positive campaigns Part 2: Campaign source and spread estimation Compute network edge weights Identify nodes at key locations as monitors (evangelists) Estimate campaign spread based on monitors’ status Extrapolate spread to find susceptible nodes in the network Identify key influencers to target these nodes with positive information Proposed Approach

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Demo

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Part 1: Diffusion modeling Part 3: Seeding and targeting positive campaigns Part 2: Campaign source and spread estimation Compute network edge weights Identify nodes at key locations as monitors (evangelists) Estimate campaign spread based on monitors’ status Extrapolate spread to find susceptible nodes in the network Identify key influencers to target these nodes with positive information Proposed Approach

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Part 1: Diffusion modeling Part 3: Seeding and targeting positive campaigns Part 2: Campaign source and spread estimation Compute network edge weights Identify nodes at key locations as monitors (evangelists) Estimate campaign spread based on monitors’ status Extrapolate spread to find susceptible nodes in the network Identify key influencers to target these nodes with positive information Proposed Approach

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Data Set  Twitter data (from MMI Social Media)  571 nodes  For each node:  Extract interests based on the tweets  Edge-weight  Reflects the interest overlap – based on topic models

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Part 1: Diffusion modeling Part 3: Seeding and targeting positive campaigns Part 2: Campaign source and spread estimation Compute network edge weights Identify nodes at key locations as monitors (evangelists) Estimate campaign spread based on monitors’ status Extrapolate spread to find susceptible nodes in the network Identify key influencers to target these nodes with positive information Proposed Approach

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Campaign Source Estimation: Monitor Nodes Monitor Selection Ping the monitors Seen the negative campaign Not seen the negative campaign Positive Monitors Negative Monitors

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Source Identification : Approach 1 Given: Graph topology, Positive Monitors, Negative Monitors All the nodes: potential sources Potential sources filtered on various factors Reachability to the Positive Monitors Distance from the Positive Monitors Reachability to the Negative Monitors Distance from the Negative Monitors

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Experiment 1: Error in Information Source Detection

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Source Identification : Approach 2 Given : Graph G, Positive Monitors, Negative Monitors Reverse the edges in the graph G Set1: Set of nodes that can be influenced by Positive Monitors Set2: set of nodes that can be influenced by Negative Monitors Potential Source: Set1 not in Set2

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Part 1: Diffusion modeling Part 3: Seeding and targeting positive campaigns Part 2: Campaign source and spread estimation Compute network edge weights Identify nodes at key locations as monitors (evangelists) Estimate campaign spread based on monitors’ status Extrapolate spread to find susceptible nodes in the network Identify key influencers to target these nodes with positive information Proposed Approach

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Measuring “Susceptibility” Susceptibility Define a notion of susceptibility of all the nodes Targets Identify nodes to target with our positive campaign Hypothesis: People who are most vulnerable need to be targeted Drivers Identify best drivers who can pass the positive information to the targets Infected and deadVulnerableNot Infected

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Susceptibility Score: Approach 1 Susceptibility Number of connections to infected nodes Influence Connectivity to uninfected from infected Ranked list

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Susceptibility Score: Approach 2 Graph Transformation Shortest Path to Source Rank based on the path length AB w pg A pg B A1A1 B1B1 A2A2 B2B2 w pg A

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Results and analysis

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Experiment1: Percentage Susceptible Nodes Saved

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Experiment2: Percentage Infections Avoided

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Papers and IDs Identify influential seeds in the presence of parallel campaigns, to be submitted to Siam Conference on Data Mining, 2014 (October deadline) Paper Identifying rumor sources in a social network Ranking nodes based on their importance to spread the infection Invention Disclosure

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Internship is not all about work!

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. We were travelling…

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. We were dancing and partying…

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential. Amidst all these, there was some time for serious work!?!?

© 2013 Adobe Systems Incorporated. All Rights Reserved. Adobe Confidential.