Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and...

18
Milad Eftekhar, Yashar Ganjali, Nick Koudas

Transcript of Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and...

Page 1: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Milad Eftekhar, Yashar Ganjali, Nick Koudas

Page 2: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Introduction

• Identifying the 𝑘 most influential individuals is a well-

studied problem.

• We generalize this problem to identify the 𝑙 most

influential groups.

• Application:

• Companies often target groups of people

• E.g. by billboards, TV commercials, newspaper ads, etc.

2

Page 3: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Group targeting

• Groups

• Advantages

• Improved performance

• Natural targets for advertising

• An economical choice

3

Billboard

Page 4: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Fine-Grained Diffusion (FGD)

• Determine how advertising to a group translates into

individual adopters.

• Run individual diffusion process on these adopters.

4

Page 5: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

FGD Modeling

• Graph 𝐺′: add a node for each group, add edges between

a node corresponding to a group 𝑔𝑖 and its members with

weight 𝑤𝑖 that depends on

• Advertising budget, size of group, the escalation factor, and the

budget needed to convince an individual

5

Page 6: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

FGD Modeling (Cont’d)

• Escalation Factor 𝛽: how many more initial adaptors we

can get by group targeting rather than individual targeting.

6

Advertising budget

$1000Advertising budget

$1000

Cost of convincing an individual

$100

10 initial adopters

Billboard

Cost = $1000 Audience = 10000

individuals

20 initial adopters

𝛽 =20

10= 2

Individual Targeting Group Targeting

Page 7: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

FGD Modeling (Cont’d)

• Escalation Factor 𝛽

• Based on the problem structure, the size and shape of the network,

the initial advertising method, etc.

• Individual advertising: 𝛽 = 1

• Billboard advertising: 𝛽 = 200

• Online advertising: 𝛽 = 400

7

Page 8: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Problem statement

• Goal: Find the 𝑙 most influential groups (blue group-

nodes)

• NP-hard under FGD model

8

Top-2

influential

groups

Top-2

influential

groups

Page 9: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

topfgd algorithm

• Diffusion in FGD is monotone and submodular

• topfgd: a greedy algorithm provides a (1-1/e)

approximation factor.

• In each iteration, add the group resulting to the maximum marginal

increase in the final influence.

• Time: 𝑂(𝑙×𝑚×|𝐸𝑖𝑛𝑑|×𝑅)

9

Page 10: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Coarse-Graind Diffusion (CGD)

• FGD is not practical for large social networks

• Idea: incorporate information about individuals without

running explicitly on the level of individuals

• A graph to model inter-group influences

10

Group 1

Page 11: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

CGD Modeling

• Differences with “Individual Diffusion” models

• No binary decisions

• Progress fraction for each group

• Two types of diffusion

• Inter-group diffusion

• Intra-group diffusion

• Submodularity?

11

Progress fraction = 0.6

Page 12: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

CGD Diffusion Model

• Each newly activated fraction of a group can activate its

neighboring groups

• As a result of an activation attempt from A to B, some activation

attempts also occur between members of B

• Continue for several iterations to converge

12

Group 1Group 1

0 → 0.2

0.2

0 0 → 0.04

0.2

0.04 → 0.05

0

0

0 0

Page 13: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

topcgd algorithm

• Goal: Find the 𝑙 most influential groups

• NP-hard under CGD model

• Diffusion in CGD is monotone and submodular

• topcgd: a greedy algorithm provides a (1-1/e)

approximation factor.

• Time: 𝑂( 𝐸𝑖𝑛𝑑 +𝑚𝑙 𝑚𝑡 + 𝑛 )• 𝑡 is the number of iterations to converge (~10)

13

Page 14: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Experimental setup

• Datasets:

• DBLP: 800K nodes, 6.3M edges, 3200 groups

• Comparison

• Spend same advertising budget on all algorithms

• Measure the final influence (the number of convinced individuals)

• Run Individual Diffusion process on the initial convinced individuals

14

Page 15: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Results

• DBLP-1980: 8000 nodes, 69 groups

• Compare topid vs. topfgd vs. topcgd

• Final influence: topfgd and topcgd outperform topid for 𝛽 > 3

• Time: topid (30 days), topfgd (an hour), topcgd (0.2 sec)

15

0

1000

2000

3000

4000

5000

6000

0 10 20 30 40 50 60 70 80 90 100

fin

al in

flu

en

ce

β

topfgd topcgd topid

Page 16: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Results (Cont’d)

• DBLP: topcgd vs. Baselines

• rnd, small, big, degree

• Time of topcgd: 100 minutes

• topfgd and topid not practical

16

0

10000

20000

30000

40000

50000

60000

70000

10 30 50 70 90

fin

al in

flu

en

ce

β

topcgd degree big rnd small

Page 17: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Conclusion and Future Works

• Focus on groups rather than individuals

• Wider diffusion

• Improved performance

• More less influential individuals vs. less more influential individuals

• Although CGD aggregates the information about

individuals (hence improved performance), it results to

final influence comparable to FGD.

• We are interested in a generalized model where

• Groups are allowed to receive different budgets

• The cost of advertising to each group is predetermined

17

Page 18: Milad Eftekhar, Yashar Ganjali, Nick Koudasmilad/paper/KDD-presentation.pdf · Conclusion and Future Works •Focus on groups rather than individuals • Wider diffusion • Improved

Thanks!

(Questions?)

18