Reducing controversy by connecting opposing views

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Date: 2014/05/06 Author: Michael Schuhmacher, Simon Paolo Ponzetto Source: WSDM’14 Advisor: Jia-ling Koh Speaker: Chen-Yu Huang Knowledge-based Graph Document.
Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.
Reducing DFA’s Section 2.4. Reduction of DFA For any language, there are many DFA’s that accept the language Why would we want to find the smallest? Algorithm:
Mauro Sozio and Aristides Gionis Presented By:
Community Detection Laks V.S. Lakshmanan (based on Girvan & Newman. Finding and evaluating community structure in networks. Physical Review E 69,
Putting genetic interactions in context through a global modular decomposition Jamal.
Evaluating, Combining and Generalizing Recommendations with Prerequisites Aditya Parameswaran Stanford University (with Profs. Hector Garcia-Molina and.
Trust and Profit Sensitive Ranking for Web Databases and On-line Advertisements Raju Balakrishnan (Arizona State University)
Ming Yan, Jitao Sang, Tao Mei, ChangSheng Xu
Matchin: Eliciting User Preferences with an Online Game Severin Hacker, and Luis von Ahn Carnegie Mellon University SIGCHI 2009.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
1 Network Coding: Theory and Practice Apirath Limmanee Jacobs University.
G ROUP PROXIMITY MEASURE FOR RECOMMENDING GROUPS IN ONLINE SOCIAL NETWORKS Barna Saha and Lise Getoor University of Maryland SNA-KDD Workshop ‘08 Presented.
Maggie Zhou COMP 790 Data Mining Seminar, Spring 2011
A scalable multilevel algorithm for community structure detection
Social Networks: Advertising, Pricing and All That Zvi Topol & Itai Yarom.
Applications of Depth-First Search
Computability and Complexity 24-1 Computability and Complexity Andrei Bulatov Approximation.
The community-search problem and how to plan a successful cocktail party Mauro SozioAris Gionis Max Planck Institute, Germany Yahoo! Research, Barcelona.
(hyperlink-induced topic search)
New Algorithm DOM for Graph Coloring by Domination Covering
1 Modularity and Community Structure in Networks* Final project *Based on a paper by M.E.J Newman in PNAS 2006.
Systems Biology, April 25 th 2007Thomas Skøt Jensen Technical University of Denmark Networks and Network Topology Thomas Skøt Jensen Center for Biological.
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
Maximizing Product Adoption in Social Networks
Models of Influence in Online Social Networks
1 Applications of Relative Importance  Why is relative importance interesting? Web Social Networks Citation Graphs Biological Data  Graphs become too.
Optimal serverless networks attacks, complexity and some approximate algorithms Carlos Aguirre Maeso Escuela Politécnica Superior Universidad Autónoma.
Mehdi Kargar Aijun An York University, Toronto, Canada Discovering Top-k Teams of Experts with/without a Leader in Social Networks.
Learning to Question: Leveraging User Preferences for Shopping Advice Author : Mahashweta Das, Aristides Gionis, Gianmarco De Francisci Morales, and Ingmar.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Jing (Selena) He and Hisham M. Haddad Department of Computer Science, Kennesaw State University Shouling Ji, Xiaojing Liao, and Raheem Beyah School of.
Optimal Link Bombs are Uncoordinated Sibel Adali Tina Liu Malik Magdon-Ismail Rensselaer Polytechnic Institute.
Query Suggestion Naama Kraus Slides are based on the papers: Baeza-Yates, Hurtado, Mendoza, Improving search engines by query clustering Boldi, Bonchi,
Graph Theory Techniques in Model-Based Testing
Minimal Spanning Tree Problems in What is a minimal spanning tree An MST is a tree (set of edges) that connects all nodes in a graph, using.
Measuring Behavioral Trust in Social Networks
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
Supervised Random Walks: Predicting and Recommending Links in Social Networks Lars Backstrom (Facebook) & Jure Leskovec (Stanford) Proc. of WSDM 2011 Present.
On Frequent Chatters Mining Claudio Lucchese 1 st HPC Lab Workshop 6/15/12 1st HPC Workshp - Claudio Lucchese.
Informatics tools in network science
A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures Arthur Carvalho
Monte Carlo Simulation of Folding Processes for 2D Linkages Modeling Proteins with Off-Grid HP-Chains Ileana Streinu Smith College Leo Guibas Rachel Kolodny.
Progress Report ekker. Problem Definition In cases such as object recognition, we can not include all possible objects for training. So transfer learning.
Graph Concepts Illustrated Using The Leda Library Amanuel Lemma CS252 Algorithms.
Network applications Sushmita Roy BMI/CS 576 Dec 9 th, 2014.
1 CS270 Project Overview Maximum Planar Subgraph Danyel Fisher Jason Hong Greg Lawrence Jimmy Lin.
1 3/21/2016 MATH 224 – Discrete Mathematics First we determine if a graph is connected.
Topics In Social Computing (67810) Module 1 (Structure) Centrality Measures, Graph Clustering Random Walks on Graphs.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Modular organization.
The Effect of Collective Attention on Controversial Debates on Social media Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis And Michael.
Tracing An Algorithm for Strongly Connected Components that uses Depth First Search Graph obtained from Text, page a-al: Geetika Tewari.
Community detection in graphs
Dieudo Mulamba November 2017
Graph Algorithm.
Deliberative democracy or agonism?
Network of Twitter interactions.
Finding a Eulerian Cycle in a Directed Graph
Functional analysis of duplicate pair CIK1–VIK1 (A) Genetic interaction profile similarity. Functional analysis of duplicate pair CIK1–VIK1 (A) Genetic.
Add Heuristic a b C D E Switch Cost
Example: Academic Search
Graph and Link Mining.
Euler and Hamilton Paths
Interactive analysis of a simulated patient flow network.
Lecture 6 Dynamic Programming
Chapter 10 Graphs and Trees
Global and focused views of human interaction map.
Dominating Set By Eric Wengert.
Advanced Topics in Data Mining Special focus: Social Networks
Presentation transcript:

Reducing controversy by connecting opposing views kiran garimella Gianmarco De Francisci Morales Aristides Gionis Michael Mathioudakis

Controversies are everywhere!

Twitter Garimella et al. WSDM 2016

Blogs

Instagram

US Senate VOTes

How can we bridge the divide? This Paper How can we bridge the divide?

How Can we bridge the divide? Reducing controversy by connecting opposing views How Can we bridge the divide? Connect the two sides Twitter Model interactions as a graph Retweet graph  Nodes: users, Edges: retweets Measure of Polarization How well does information flow between the two sides? Based on random walks Edges: Recommendations

Problem: Given a graph and two sides, find the k best edges that maximize the reduction in polarization

Reducing Controversy by Connecting Opposing Views Side 1 Side 2

Algorithms Look for all pairs of nodes Reducing controversy by connecting opposing views Algorithms Greedy Look for all pairs of nodes Find the k pairs that give the highest reduction in the polarization score O(n2), n: number of nodes

The best edges are between the highest degree nodes Reducing controversy by connecting opposing views Our algorithm Side 1 Side 2 The best edges are between the highest degree nodes

Our algorithm The best edges are between the highest degree nodes Reducing controversy by connecting opposing views Our algorithm Side 1 Side 2 The best edges are between the highest degree nodes O(p2), p << n

But it Might not materialize Reducing controversy by connecting opposing views But it Might not materialize High degree users  Highly retweeted users We can not recommend @realDonaldTrump to retweet @BarackObama Not practical, not likely to materialize

Acceptance probability Reducing controversy by connecting opposing views Acceptance probability Take into account the probability of the user accepting the recommendation Learn probabilities from the data

Visit the posteR… Details about the polarization score Acceptance probability model How we combine polarization minimization and acceptance probability Experiments and findings