Open Access System for Information Sharing

Login Library

 

Article
Cited 6 time in webofscience Cited 0 time in scopus
Metadata Downloads

Influence maximization based on reachability sketches in dynamic graphs

Title
Influence maximization based on reachability sketches in dynamic graphs
Authors
Dongeun KimDongmin HyeonJinoh OhHan, W.-SYU, HWANJO
POSTECH Authors
Han, W.-SYU, HWANJO
Date Issued
Jul-2017
Publisher
ELSERVIER
Abstract
Influence maximization is the problem of selecting the most influential nodes in a given graph. The problem is applicable to viral marketing and is actively researched as social networks become the media of information propagation. To solve the challenges of influence maximization, previous works approximate the influence evaluationt to reduce the running time and to simultaneously guarantee the quality of those evaluations. We propose a new influence maximization algorithm that overcomes the limitations of the state of the art algorithms. We also devise our algorithm to process update operations of dynamic graphs. Our algorithm outperforms the state of the art algorithms TIM+ and SKIM in running time, and its influence spread is also comparable to the others. Our experiments show that processing update operations is faster than executing baselines each time. Additional experiments with synthetic graphs show that the process preserves the quality of influence spread. (C) 2017 Elsevier Inc. All rights reserved.
Keywords
Social network; Influence maximization; Dynamic graph
URI
http://oasis.postech.ac.kr/handle/2014.oak/38043
DOI
10.1016/J.INS.2017.02.023
ISSN
0020-0255
Article Type
Article
Citation
Information Sciences, vol. 394-395, page. 217 - 231, 2017-07
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

 YU, HWANJO
Dept of Computer Science & Enginrg
Read more

Views & Downloads

Browse