eprintid: 4073
rev_number: 10
eprint_status: archive
userid: 302
dir: disk0/00/00/40/73
datestamp: 2020-10-13 08:18:56
lastmod: 2020-10-13 08:20:11
status_changed: 2020-10-13 08:18:56
type: article
metadata_visibility: show
creators_name: Hoang, Xuan Huan
creators_name: Pham, Van Canh
creators_name: Ha, K.T. Dung
creators_name: Vu, C Quang
creators_name: Nguyen, Su Anh
creators_id: huanhx@vnu.edu.vn
corp_creators: Canh V. Pham
corp_creators: Dung K. T. Ha
corp_creators: Quang C. Vu
corp_creators: Anh N. Su
title: Influence Maximization with Priority in Online
Social Networks
ispublished: pub
subjects: IT
subjects: Scopus
abstract: The Influence Maximization (IM) problem, which finds a set of k nodes (called seedset)
in a social network to initiate the influence spread so that the number of influenced nodes after
propagation process is maximized, is an important problem in information propagation and social
network analysis. However, previous studies ignored the constraint of priority that led to inefficient
seed collections. In some real situations, companies or organizations often prioritize influencing
potential users during their influence diffusion campaigns. With a new approach to these existing
works, we propose a new problem called Influence Maximization with Priority (IMP) which finds out
a set seed of k nodes in a social network to be able to influence the largest number of nodes subject
to the influence spread to a specific set of nodes U (called priority set) at least a given threshold T in
this paper. We show that the problem is NP-hard under well-known IC model. To find the solution,
we propose two efficient algorithms, called Integrated Greedy (IG) and Integrated Greedy Sampling (IGS)
with provable theoretical guarantees. IG provides a �
1 − (1 − 1
k
)
t
�
-approximation solution with t
is an outcome of algorithm and t ≥ 1. The worst-case approximation ratio is obtained when t = 1
and it is equal to 1/k. In addition, IGS is an efficient randomized approximation algorithm based
on sampling method that provides a �
1 − (1 − 1
k
)
t − e
�
-approximation solution with probability
at least 1 − δ with e > 0, δ ∈ (0, 1) as input parameters of the problem. We conduct extensive
experiments on various real networks to compare our IGS algorithm to the state-of-the-art algorithms
in IM problem. The results indicate that our algorithm provides better solutions interns of influence
on the priority sets when approximately give twice to ten times higher than threshold T while running
time, memory usage and the influence spread also give considerable results compared to the others.
date: 2020
date_type: published
publisher: MDPI
id_number: 10.3390/a13080183
full_text_status: public
publication: MDPI algorithms
volume: 13
number: 8 (183
pagerange: 1-23
refereed: TRUE
issn: 1999-4893
citation:   Hoang, Xuan Huan and Pham, Van Canh and Ha, K.T. Dung and Vu, C Quang and Nguyen, Su Anh  (2020) Influence Maximization with Priority in Online Social Networks.  MDPI algorithms, 13  (8 (183).   pp. 1-23.  ISSN 1999-4893     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4073/1/B54.pdf