Loading [a11y]/accessibility-menu.js
Identify Connected Positive Influence Dominating Set in Social Networks Using Two-Hop Coverage | IEEE Journals & Magazine | IEEE Xplore
Scheduled Maintenance: On Tuesday, 25 February, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC). During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Identify Connected Positive Influence Dominating Set in Social Networks Using Two-Hop Coverage


Abstract:

Online social networks (OSNs) have become effective platforms for influence diffusion. Finding a positive influence dominating set (PIDS) in OSNs can be used to help miti...Show More

Abstract:

Online social networks (OSNs) have become effective platforms for influence diffusion. Finding a positive influence dominating set (PIDS) in OSNs can be used to help mitigate social problems such as adolescent drinking and smoking. A set is positive influence dominating if each node in the network is either in the set or has half neighbors in the set. In this article, we propose an efficient greedy algorithm to identify connected PIDS (CPIDS) in large-scale social networks, which utilize two hop coverage information of nodes in the network. Our simulation results show that the proposed approach outperforms existing algorithms in real-world large-scale networks in terms of time cost. Our approach can be potentially used in designing efficient influence diffusion algorithms in OSNs.
Published in: IEEE Transactions on Computational Social Systems ( Volume: 6, Issue: 5, October 2019)
Page(s): 956 - 967
Date of Publication: 18 September 2019

ISSN Information:

Funding Agency:


References

References is not available for this document.