The Interplay of Social Influence and Own Preference in Social Networks

Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=z9VWYtH8uAk



Duration: 1:01:25
90 views
1


Social media features such as social explanations of recommendations (e.g., "Amit liked this") and feeds of activity around items (e.g., listening to songs, visiting URLs, reading books) mean that we are often exposed to our friends' preferences online. This raises the question of how those preferences interact with our own, both at the individual level – how do people influence each other's choices – and globally – how do these preferences affect the diffusion of items through networks? In this talk, I will describe a set of micro-experiments and large-scale observational studies that shed some light on this question. First, I will demonstrate the existence of preference locality – friends having similar item preferences – in social networks that makes recommendations computed from friends' activities comparable in accuracy to those computed from all users' data. To understand how such locality emerges, I will describe two studies: one investigating the influence of social explanations using a randomized experiment, and another studying the influence of feeds on users' actions using activity data from multiple social networks. Both studies conclude that social influence plays only a secondary role: models of people's decision making indicate that a majority of people's actions can be explained by a process where they follow their own preference for items. These results point toward the value of accounting for individual preference when modeling diffusion and suggest ways for incorporating social influence in recommendation algorithms.




Other Videos By Microsoft Research


2016-06-21Advances in Quantum Algorithms and Devices: Welcome and Distributed Denstity Matrices
2016-06-21Circle Packing and Its Applications
2016-06-21Advances in Quantum Algorithms & Devices: Quantum Monte Carlo versus Quantum Adiabatic Optimization
2016-06-21Fast Algorithms for Online Stochastic Convex Programming
2016-06-21Research on Concert Hall Acoustics at Aalto University
2016-06-21Fixed-Energy Harmonic Functions
2016-06-21RDFox — A Modern Materialisation-Based RDF System
2016-06-21Competitive erosion is conformally invariant
2016-06-21A Simple O(loglog(rank))-Competitive Algorithm for the Matroid Secretary Problem
2016-06-21Recent Advances in Deep Learning at Microsoft: A Selected Overview
2016-06-21The Interplay of Social Influence and Own Preference in Social Networks
2016-06-21A Fast Distributed Algorithm for α-Fair Packing Problems
2016-06-21Theory Day Session 3
2016-06-21Provable Submodular Minimization via Wolfe’s Algorithm
2016-06-21A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
2016-06-21Stochastic Methods for Complex Performance Measures: A Tale of Two Families
2016-06-21Parallel Bayesian Network Structure Learning for Genome-Scale Gene Networks
2016-06-21Empirical Inference for Intelligent Systems
2016-06-21Ordered Stick-breaking Prior for Sequential MCMC Inference of Bayesian Non-Parametric Models
2016-06-21Effective-Resistance-Reducing Flows, Spectrally Thin Trees and Asymmetric TSP
2016-06-21Non-Convex Robust PCA



Tags:
microsoft research
algorithms