Influence Maximization

Slides:



Advertisements
Similar presentations
University of Texas at Dallas
Advertisements

Approximation Algorithms
Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.
Spread of Influence through a Social Network Adapted from :
Maximizing the Spread of Influence through a Social Network
Maximizing the Spread of Influence through a Social Network
Guest lecture II: Amos Fiat’s Social Networks class Edith Cohen TAU, December 2014.
Least Cost Rumor Blocking in Social networks Lidan Fan Computer Science Department the University of Texas at Dallas.
Ding-Zhu Du │ University of Texas at Dallas │ Lecture 7 Rumor Blocking 0.
Maximizing the Spread of Influence through a Social Network By David Kempe, Jon Kleinberg, Eva Tardos Report by Joe Abrams.
Based on “Cascading Behavior in Networks: Algorithmic and Economic Issues” in Algorithmic Game Theory (Jon Kleinberg, 2007) and Ch.16 and 19 of Networks,
Lecture 3 Power Law Structure Ding-Zhu Du Univ of Texas at Dallas.
Influence Maximization
Maximizing the Spread of Influence through a Social Network
Simpath: An Efficient Algorithm for Influence Maximization under Linear Threshold Model Amit Goyal Wei Lu Laks V. S. Lakshmanan University of British Columbia.
Maximizing Product Adoption in Social Networks
Models of Influence in Online Social Networks
1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.
1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.
Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang, Xiaoming Sun.
December 7-10, 2013, Dallas, Texas
Jing (Selena) He and Hisham M. Haddad Department of Computer Science, Kennesaw State University Shouling Ji, Xiaojing Liao, and Raheem Beyah School of.
Chapter 2 Greedy Strategy I. Independent System Ding-Zhu Du.
Maximizing the Spread of Influence through a Social Network David Kempe, Jon Kleinberg, Eva Tardos Cornell University KDD 2003.
Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, É va Tardos KDD 2003.
Lecture 1-5 Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas.
Problem Setting :Influence Maximization A new product is available in the market. Whom to give free samples to maximize the purchase of the product ? 1.
Online Social Networks and Media
Lecture 3-1 Independent Cascade Weili Wu Ding-Zhu Du University of Texas at Dallas.
On Bharathi-Kempe-Salek Conjecture about Influence Maximization Ding-Zhu Du University of Texas at Dallas.
1 Latency-Bounded Minimum Influential Node Selection in Social Networks Incheol Shin
Algorithms For Solving History Sensitive Cascade in Diffusion Networks Research Proposal Georgi Smilyanov, Maksim Tsikhanovich Advisor Dr Yu Zhang Trinity.
Lecture 5-1 Positive Influence Dominating Set Ding-Zhu Du Univ of Texas at Dallas.
Instructor: Shengyu Zhang 1. Location change for the final 2 classes Nov 17: YIA 404 (Yasumoto International Academic Park 康本國際學術園 ) Nov 24: No class.
Lecture 2-1 Submodular Maximization Weili Wu Ding-Zhu Du University of Texas at Dallas.
1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.
Lecture 2-3 Deterministic Difussion Weili Wu Ding-Zhu Du University of Texas at Dallas.
1/54 Rumor Source Detection: monitor placement Ding-Zhu Du Department of Computer Science University of Texas at Dallas.
Social Networks Some content from Ding-Zhu Du, Lada Adamic, and Eytan Adar.
Inferring Networks of Diffusion and Influence
Seed Selection.
Wenyu Zhang From Social Network Group
Nanyang Technological University
Independent Cascade Model and Linear Threshold Model
Heuristic & Approximation
Chapter 7 Linear Programming
Greedy & Heuristic algorithms in Influence Maximization
Modularity Maximization
Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas
│ University of Texas at Dallas │
Independent Cascade Model and Linear Threshold Model
Influence Maximization
Maximizing the Spread of Influence through a Social Network
The Importance of Communities for Learning to Influence
Influence-Based Community Detection
Coverage Approximation Algorithms
Detect rumor sources 2019/1/3
Cost-effective Outbreak Detection in Networks
Bharathi-Kempe-Salek Conjecture
General Threshold and Cascade Models
Kempe-Kleinberg-Tardos Conjecture A simple proof
Influence Maximization
Viral Marketing over Social Networks
Discovering Influential Nodes From Social Trust Network
Independent Cascade Model and Linear Threshold Model
And Competitive Influence
Lecture 2-6 Complexity for Computing Influence Spread
Multiple Products.
Noncooperative Rumor Blocking
Data-Dependent Approximation
Presentation transcript:

Influence Maximization Lecture 2-1 Influence Maximization Ding-Zhu Du University of Texas at Dallas

What is Social Network? Wikipedia Definition: Social Structure Nodes: Social actors (individuals or organizations) Links: Social relations a social structure made of social actors (individuals or organizations) called “nodes”, which are tied by one or more specific Social relations, such as friendship, kinship, religions, knowledge or prestige. The nodes or actors as part of network data would seem to be pretty straight-forward. Our study mainly focus on the relations among actors.

What is Social Influence? Social influence occurs when one's opinions, emotions, or behaviors are affected by others, intentionally or unintentionally.[1] Informational social influence: to accept information from another; Normative social influence: to conform to the positive expectations of others. [1] http://en.wikipedia.org/wiki/Social_influence

Kate Middleton effect “Kate Middleton effect The trend effect that Kate, Duchess of Cambridge has on others, from cosmetic surgery for brides, to sales of coral-colored jeans.” “Kate Middleton effect Duchess of Cambridge, Kate, is a fashion icon who leads in fashion circles. she seems to become more and more beautiful after she married Prince William. Many articles referred her nose as “adorable,” “perky,” and “feminine.” Women in the New York and Long Island areas are rushing out to seek a plastic surgeon. There are approximately 100 young women a month so far that are requesting cosmetic surgery on their nose to get an exact duplicate of Kate’s.

Hike in Sales of Special Products According to Newsweek, "The Kate Effect may be worth £1 billion to the UK fashion industry." Tony DiMasso, L. K. Bennett’s US president, stated in 2012, "...when she does wear something, it always seems to go on a waiting list." The fashion choices of the Duchess of Cambridge, Kate Middleton, have already brought $1 billion into the British economy. Reiss, the High Street store that Kate loves, is planning to open 13 outposts in the U.S. within this year.

How to Find Kate? Influential persons often have many friends. Kate is one of the persons that have many friends in this social network. For more Kates, it’s not as easy as you might think!

Influence Maximization Given a digraph and k>0, Find k seeds (Kates) to maximize the number of influenced persons (possibly in many steps). Market salesman

Theorem Proof

Modularity of Influence

What is a submodular function? Consider a function f on all subsets of a set E. f is submodular if

What is monotone increasing f is monotone increasing if

Property of Decreasing Marginal Value 1 2

Modularity of Influence

Theorem

Submadular Function Max

Greedy Algorithm

Performance Ratio Theorem (Nemhauser et al. 1978) Proof

Proof Monotone increasing Submodular! Why?

Diffusion Model Deterministic diffusion model Independent Cascade (IC) Linear Threshold (LT)

Deterministic Model 6 2 1 5 Two kinds of influence cascades: rumors and protectors. Each individual has three status: inactive, rumored, protected. The active individual activates all of its neighbors successfully. When rumors and protectors influence an individual at the same time, then the individual is protected. Each individual only has one chance to influence their neighbors. A node will never change its status if it has been activated. 3 4 both 1 and 6 are source nodes. Step 1: 1--2,3; 6--2,4. . 7/17/2018 20

Example 6 2 1 5 3 4 Step 2: 4--5. 7/17/2018

Influence Maximization Problem Influence spread of node set S: σ(S) expected number of active nodes at the end of diffusion process, if set S is the initial active set. Problem Definition (by Kempe et al., 2003): (Influence Maximization). Given a directed and edge-weighted social graph G = (V,E, p) , a diffusion model m, and an integer k ≤ |V |, find a set S ⊆ V , |S| = k, such that the expected influence spread σm(S) is maximum. the influence of a set of nodes A: the expected number of active nodes at the end of the process.

References

THANK YOU!