Least cost rumor blocking in social networks
-
Upload
ping-yabin -
Category
Documents
-
view
45 -
download
0
Transcript of Least cost rumor blocking in social networks
![Page 1: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/1.jpg)
Least Cost Rumor Blocking in
Social networks
Lidan Fan
Computer Science Department
the University of Texas at Dallas
![Page 2: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/2.jpg)
Social networks
![Page 3: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/3.jpg)
Social Network
Social network is a social structure
made up of individuals and relations
between these individuals
Social network provides a
platform for influence diffusion
![Page 4: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/4.jpg)
Applications
Single cascade
Viral marketing
Recommender systems
Feed ranking
……
Multiple cascades
Political election
Multiple products promotion
Rumor/misinformation controlling
……
![Page 5: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/5.jpg)
Social network properties Small-world effect
The average distance between vertices in a network is short.
Power-law or exponential form
There are many nodes with low degree and a small number with
high degree.
Clustering or network transitivity
Two vertices that are both neighbors of the same third vertex have
a high probability of also being neighbors of one another.
Community structure
The connections within the same community are dense and
between communities are sparse.
![Page 6: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/6.jpg)
Influence spreads fast within the same
community while slow across different
communities.
![Page 7: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/7.jpg)
![Page 8: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/8.jpg)
It said that the president of
Syria is dead, which hit the
twitter greatly and was
circulated fast among the
population, leading to a sharp,
quick increase in the price of
oil.
![Page 9: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/9.jpg)
In August, 2012, thousands
of people in Ghazni
province left their houses in
the middle of the night in
panic after the rumor of
earthquake.
![Page 10: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/10.jpg)
![Page 11: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/11.jpg)
Problem SettingRumors generated in a community will influence the
members in the network.
Find protectors to reduce the influence of rumors or protect
the most members in the network.
Real-world limitation: the overhead spent on
protectors and protected members should be
balanced.Rumors spread very fast within their community---too much cost
Rumors spread slow across different communities---little cost
Find least number of protectors to reduce rumor influence
to the members in other communities.
![Page 12: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/12.jpg)
Our Tasks
Determine influence diffusion models.
Design efficient algorithms to find protectors to reduce
influence from rumors.
Obtain data of particular social networks to evaluate our
algorithms.
![Page 13: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/13.jpg)
Outline
Model of influence diffusion
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 14: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/14.jpg)
Outline
Model of influence diffusion
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 15: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/15.jpg)
Our Two Influence Diffusion Models
Two cascades: rumors and protectors;
Diffusion starts time: the same;
Tie breaking rule: protectors dominate rumors;
Status of each node: inactive, rumored, protected;
Monotonicity assumption: the status of rumored or protected
never change.
![Page 16: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/16.jpg)
Outline
Two influence diffusion models
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 17: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/17.jpg)
Deterministic One Activate Many Model
When a node becomes active (rumored or protected) , it has
a single chance to activate all of its currently inactive (not
rumored and not protected) neighbors.
The activation attempts succeed with a probability 1.
![Page 18: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/18.jpg)
Example
1
3
4
5
26
1 is a rumor, 6 is a protector.
step 1: 1--2,3; 6--2,4. 2 and 4 is protected, 3 is rumored.
![Page 19: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/19.jpg)
1
3
5
2
4
6
step 2: 4--5. 5 is protected.
Example
![Page 20: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/20.jpg)
Outline
Two influence diffusion models
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 21: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/21.jpg)
Opportunistic One Activate One Model
At each step, each active (rumored or protected) node u can
only choose one of its neighbors as its target, and each
neighbor can be chosen with a probability of 1/deg(u).
Each active (rumored or protected) node has unlimited
chance to select the same node as its target.
![Page 22: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/22.jpg)
Example
1
3
4
5
26
step 1:1--2, 6--2. 2 is protected.
1 is a rumor, 6 is a protector.
![Page 23: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/23.jpg)
1
3
4
5
26
step 2:1--3, 6--2. 3 is rumored.
Example
![Page 24: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/24.jpg)
1
3
4
5
26
step 3:1--2, 3--4, 6--4. 4 is protected.
Example
![Page 25: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/25.jpg)
1
3
4
5
26
step 4:1--3, 3--2, 6--4, 4--5. 5 is protected.
Example
![Page 26: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/26.jpg)
Outline
Two influence diffusion models
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 27: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/27.jpg)
Least Cost Rumor Blocking Problem (LCRB)
Bridge ends:
form a vertex set;
belong to neigborhood communities of rumor community;
each can be reached from the rumors before others in its
community.
C0
C2
C1
Red node is a rumor;
Yellow nodes are bridges ends.
![Page 28: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/28.jpg)
Outline
Two influence diffusion models
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 29: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/29.jpg)
LCRB-D problem for the DOAM model
Given the community structure and rumors with its
community, find least number of protectors to protect
all of the bridge ends .
![Page 30: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/30.jpg)
Set Cover Based Greedy (SCBG) Algorithm
Main idea
Convert to set cover problem using Breadth First
Search (BFS) method.
Three stages:
construct Rumor Forward Search Trees (RFST)--bridge
ends
construct Bridge End Backward Search Trees (BEBST)--
protector candidates
construct vertex sets used in set cover problem
![Page 31: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/31.jpg)
Construct Rumor Forward Search Trees (RFST)
67
5
1
34
2
8
9
10
11
12
14
Yellow nodes are bridge ends.
![Page 32: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/32.jpg)
Rumor 4 Forward Search Tree
4
1 2 5
123
8
The minimal hops:
1 hop between 4 and 5;
2 hops between 4 and 12;
3 hops between 4 and 8.
5,8,12 are the bridge ends.
![Page 33: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/33.jpg)
67
5
1
34
2
8
9
10
11
12
14
Blue nodes are
protector candidates.
![Page 34: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/34.jpg)
Bridge End Backward Search Trees
5
7 4
8 12
3 4
29 10 3
4
211
Record the protector candidate sets for each bridge end:5: {5,7}; 8:{2,3,8,9,10,11}; 12:{2,3,12}
![Page 35: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/35.jpg)
Construct vertex sets in set cover problem Find the bridge ends that each candidate can protect:
2:{8,12}; 3:{8,12} ; 5:{5}; 7:{5}; 8:{8}; 9:{8}; 10:{8};11{8}; 12{12}
Apply the Greedy algorithm
• choose 2 or 3 , bridge ends 8 and 12 are protected;
• choose 5 or 7, bridge end 5 is protected;
• the output is {2,5} or {2,7} or {3,5} or {3,7}.
![Page 36: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/36.jpg)
Theoretical Results
There is a polynomial time O(ln n)−approximation algorithm for the LCRB-
D problem, where n is the number of vertices in the bridge end set.
If the LCRB-D problem has an approximation algorithm with ratio k(n) if
and only if the set cover problem has an approximation algorithm with ratio
k(n).
![Page 37: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/37.jpg)
Experiments
Two Social networks
• Collaboration Network: is from the e-print arXiv and covers scientific
collaborations between authors with papers submitted to High Energy
Physics. If an author i co-authored a paper with author j, then the graph
contains an undirected directed edge between i to j,7.73 average degree.
• Email Network: covers all the email communications within a dataset of
around half million emails. Nodes of the network are email addresses and
if an address i sends at least one email to address j, a directed edge from i
to j is added in the graph, 10.0 average degree.
![Page 38: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/38.jpg)
Hep:
community size 308,
bridge end size 387.
Email:
• community size 80,
bridge end size 135.
• community size 2631,
bridge end size 2250.
Our algorithm performs the best,
especially in the third community.
![Page 39: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/39.jpg)
Outline
Two influence diffusion models
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 40: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/40.jpg)
LCRB-P problem for OPOAO model
Given the community structure and rumors with its community,
find least number of protectors to protect α fraction of the bridge
ends, where 0 <α <=1.
Influence function σ(A) of node set A:
expected number of nodes that would be rumored if set A is not selected
as the protector seed initially
![Page 41: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/41.jpg)
Results
properties: (to be proved)
Non-negative:
Monotone:
Submodular:
Let S be a finite set;
A set function is submodular iff satisfies diminishing
returns property. That is,
A
)(AvA
2: S
0A
BSvSBA \,
)()()()( BvBAvA
![Page 42: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/42.jpg)
The Greedy Algorithm Start with an empty set A;
While the number of protected bridge ends has not reach α fraction
of the number of all the bridge ends:
Add node v to S such that σ(A+v)-σ(A) is maximized.
![Page 43: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/43.jpg)
Proof of Submodularity
Timestamp assignment of rumor diffusion
x y
u v
w z
x y
vu
w z
1_x
2_x
4_x
3_x
1_y
2_y
3_y
4_y
2_y
4_y
3_y
2_x
3_x
4_x
4_y
4_x
3_x
1_y
3_y
3_x1_x
2_x
4_y4_x 2_y
3_x
![Page 44: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/44.jpg)
Proof of SubmodularityProve the submodularity of cardinality function |PB(A)|
PB(A): the protector blocking set on bridge ends, in which
individuals will be rumored if the protector seed set is empty but is
not rumored if the protector seed set is A.
Rumor/protector random diffusion graphs-Gr/Gp.
Find the oldest (smallest) timestamp among the incoming edges of
each bridge end u in Gr and Gp, and compare them, if the oldest
one in Gp is older than the one in Gr, then u can be protected,
otherwise, it will be rumored.
![Page 45: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/45.jpg)
Submodularity of function σ(A)
Fact: A non-negative linear combination of monotone and
submodular functions is still monotone and submodular.
Probabilities are non-negative;
|PB(A)| is submodular;
σ(A) is submodular.
)(),(
))((
,
),(
APBgeneratedrandomlyareGpGrprob
APBEA
GpGr
GpGr
![Page 46: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/46.jpg)
Experiments
![Page 47: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/47.jpg)
Outline
Two influence diffusion models
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 48: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/48.jpg)
Conclusions
Introduce two influence diffusion models
• Deterministic One Activate Many --DOAM
• Opportunistic One Activate One--OPOAO
The least cost rumor blocking (LCRB) problem in those two
models
• LCRB-D problem under the DOAM—protect all the bridge ends
Design set cover based greedy algorithm (SCBG)
Run experiments over collaboration network and email network
• LCRB-P problem under the OPOAO—protect α fraction of the bridge ends
Prove the submodularity of influence function σ(A);
using timestamp assaignment strategy
Design greedy algorithm
Run experiments over collaboration network and email network
![Page 49: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/49.jpg)
Outline
Two influence diffusion models
Deterministic One Activate Many (DOAM)
Opportunistic One Activate One (OPOAO)
Least cost rumor blocking problem
Algorithm and experimental results under the DOAM
Algorithm and experimental results under the OPOAO
Conclusions
Future works
![Page 50: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/50.jpg)
Future Works
The greedy algorithm in the OPOAO model is time consuming,
explore efficient algorithms for the LCRB-P problem.
Time is an important factor in rumor diffusion, consider the rumor
blocking problem with time constraint.
It is hard to locate rumor sources, find algorithms to estimate
rumor sources to control rumor diffusion efficiently.
![Page 51: Least cost rumor blocking in social networks](https://reader034.fdocuments.us/reader034/viewer/2022042715/559b55021a28ab760c8b4652/html5/thumbnails/51.jpg)