Real-time influence maximization on dynamic social streams
Influence maximization (IM), which selects a set of k users(called seeds) to maximize the influence spread over a social network, is a fundamental problem in a wide range of applications such as viral marketing and network monitoring.Existing IM solutions fail to consider the highly dynamic nature o...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4027 https://ink.library.smu.edu.sg/context/sis_research/article/5029/viewcontent/p805_wang.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-5029 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-50292018-11-07T06:51:03Z Real-time influence maximization on dynamic social streams WANG, Yanhao FAN, Qi LI, Yuchen TAN, Kian-Lee Influence maximization (IM), which selects a set of k users(called seeds) to maximize the influence spread over a social network, is a fundamental problem in a wide range of applications such as viral marketing and network monitoring.Existing IM solutions fail to consider the highly dynamic nature of social influence, which results in either poor seed qualities or long processing time when the network evolves.To address this problem, we define a novel IM query named Stream Influence Maximization (SIM) on social streams.Technically, SIM adopts the sliding window model and maintains a set of k seeds with the largest influence value over the most recent social actions. Next, we propose the Influential Checkpoints (IC) framework to facilitate continuous SIM query processing. The IC framework creates a checkpoint for each window shift and ensures an ε-approximate solution.To improve its efficiency, we further devise a Sparse Influential Checkpoints (SIC) framework which selectively keeps O(log Nβ) checkpoints for a sliding window of size N and maintains an ε(1−β)2-approximate solution. Experimental results on both real-world and synthetic datasets confirm the effectiveness and efficiency of our proposed frameworks against the state-of-the-art IM approaches. 2017-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/4027 info:doi/10.14778/3067421.3067429 https://ink.library.smu.edu.sg/context/sis_research/article/5029/viewcontent/p805_wang.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Databases and Information Systems Social Media |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Databases and Information Systems Social Media |
spellingShingle |
Databases and Information Systems Social Media WANG, Yanhao FAN, Qi LI, Yuchen TAN, Kian-Lee Real-time influence maximization on dynamic social streams |
description |
Influence maximization (IM), which selects a set of k users(called seeds) to maximize the influence spread over a social network, is a fundamental problem in a wide range of applications such as viral marketing and network monitoring.Existing IM solutions fail to consider the highly dynamic nature of social influence, which results in either poor seed qualities or long processing time when the network evolves.To address this problem, we define a novel IM query named Stream Influence Maximization (SIM) on social streams.Technically, SIM adopts the sliding window model and maintains a set of k seeds with the largest influence value over the most recent social actions. Next, we propose the Influential Checkpoints (IC) framework to facilitate continuous SIM query processing. The IC framework creates a checkpoint for each window shift and ensures an ε-approximate solution.To improve its efficiency, we further devise a Sparse Influential Checkpoints (SIC) framework which selectively keeps O(log Nβ) checkpoints for a sliding window of size N and maintains an ε(1−β)2-approximate solution. Experimental results on both real-world and synthetic datasets confirm the effectiveness and efficiency of our proposed frameworks against the state-of-the-art IM approaches. |
format |
text |
author |
WANG, Yanhao FAN, Qi LI, Yuchen TAN, Kian-Lee |
author_facet |
WANG, Yanhao FAN, Qi LI, Yuchen TAN, Kian-Lee |
author_sort |
WANG, Yanhao |
title |
Real-time influence maximization on dynamic social streams |
title_short |
Real-time influence maximization on dynamic social streams |
title_full |
Real-time influence maximization on dynamic social streams |
title_fullStr |
Real-time influence maximization on dynamic social streams |
title_full_unstemmed |
Real-time influence maximization on dynamic social streams |
title_sort |
real-time influence maximization on dynamic social streams |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2017 |
url |
https://ink.library.smu.edu.sg/sis_research/4027 https://ink.library.smu.edu.sg/context/sis_research/article/5029/viewcontent/p805_wang.pdf |
_version_ |
1770574134812606464 |