Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common Users

The influence maximization problem of a single social network is to find a set of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> seed nodes <inline-formula> <tex-math notation="LaTeX">$S$ </tex-math></inli...

Full description

Bibliographic Details
Main Authors: Yanhong Meng, Na Chen, Yunhui Yi, Shuanghong Wang, Changxing Pei
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9536717/
id doaj-993a9c135db24b7ca0d520a9625695f7
record_format Article
spelling doaj-993a9c135db24b7ca0d520a9625695f72021-09-20T23:00:51ZengIEEEIEEE Access2169-35362021-01-01912740712741910.1109/ACCESS.2021.31123449536717Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common UsersYanhong Meng0https://orcid.org/0000-0002-2469-601XNa Chen1https://orcid.org/0000-0002-5541-8442Yunhui Yi2https://orcid.org/0000-0001-7979-332XShuanghong Wang3Changxing Pei4School of Electronic and Information Engineering, Zhongyuan University of Technology, Zhengzhou, ChinaCollege of Electronic and Information Engineering, Shandong University of Science and Technology, Qingdao, ChinaState Key Laboratory of Integrated Services Networks, Xidian University, Xian, ChinaSchool of Electronic and Information Engineering, Zhongyuan University of Technology, Zhengzhou, ChinaState Key Laboratory of Integrated Services Networks, Xidian University, Xian, ChinaThe influence maximization problem of a single social network is to find a set of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> seed nodes <inline-formula> <tex-math notation="LaTeX">$S$ </tex-math></inline-formula> so that the spread of information from the seed set to the single network has the largest influence. This problem has attracted the attention of many researchers worldwide. In recent years, with the rapid development of the internet and the popularity of social networks, a variety of social platforms have appeared, allowing people to have multiple social accounts simultaneously; that is, one person will participate in multiple social networks and spread information on the various social platforms simultaneously. Consequently, the problem of influence maximization has been extended from a single social network to multiple social networks. However, many studies are based on static networks, and the critical challenge is that social networks usually have dynamic characteristics. At present, there is almost no research on dynamic multiple social networks. Therefore, based on common users, this paper establishes a dynamic multisocial network communication model to study the dynamic multisocial network influence maximization problem (DMNIMP). In this model, multiple dynamic networks are merged into a dynamic network, in which the self-propagating edges of common users are added to the snapshots of each frame of the integrated network. Experimental analysis shows that the proposed model can not only accurately and vividly represent dynamic characteristics but also reflect the mutual influence of common users on multiple social networks. If common users are chosen as the nodes with greater influence in each network, the communication range of the integrated network is obviously larger than that of a single network, and the interaction of dynamic multisocial networks is more obvious.https://ieeexplore.ieee.org/document/9536717/Common usersdynamic multisocial networksinfluence maximization
collection DOAJ
language English
format Article
sources DOAJ
author Yanhong Meng
Na Chen
Yunhui Yi
Shuanghong Wang
Changxing Pei
spellingShingle Yanhong Meng
Na Chen
Yunhui Yi
Shuanghong Wang
Changxing Pei
Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common Users
IEEE Access
Common users
dynamic multisocial networks
influence maximization
author_facet Yanhong Meng
Na Chen
Yunhui Yi
Shuanghong Wang
Changxing Pei
author_sort Yanhong Meng
title Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common Users
title_short Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common Users
title_full Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common Users
title_fullStr Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common Users
title_full_unstemmed Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common Users
title_sort research on the dynamic multisocial networks influence maximization problem based on common users
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2021-01-01
description The influence maximization problem of a single social network is to find a set of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> seed nodes <inline-formula> <tex-math notation="LaTeX">$S$ </tex-math></inline-formula> so that the spread of information from the seed set to the single network has the largest influence. This problem has attracted the attention of many researchers worldwide. In recent years, with the rapid development of the internet and the popularity of social networks, a variety of social platforms have appeared, allowing people to have multiple social accounts simultaneously; that is, one person will participate in multiple social networks and spread information on the various social platforms simultaneously. Consequently, the problem of influence maximization has been extended from a single social network to multiple social networks. However, many studies are based on static networks, and the critical challenge is that social networks usually have dynamic characteristics. At present, there is almost no research on dynamic multiple social networks. Therefore, based on common users, this paper establishes a dynamic multisocial network communication model to study the dynamic multisocial network influence maximization problem (DMNIMP). In this model, multiple dynamic networks are merged into a dynamic network, in which the self-propagating edges of common users are added to the snapshots of each frame of the integrated network. Experimental analysis shows that the proposed model can not only accurately and vividly represent dynamic characteristics but also reflect the mutual influence of common users on multiple social networks. If common users are chosen as the nodes with greater influence in each network, the communication range of the integrated network is obviously larger than that of a single network, and the interaction of dynamic multisocial networks is more obvious.
topic Common users
dynamic multisocial networks
influence maximization
url https://ieeexplore.ieee.org/document/9536717/
work_keys_str_mv AT yanhongmeng researchonthedynamicmultisocialnetworksinfluencemaximizationproblembasedoncommonusers
AT nachen researchonthedynamicmultisocialnetworksinfluencemaximizationproblembasedoncommonusers
AT yunhuiyi researchonthedynamicmultisocialnetworksinfluencemaximizationproblembasedoncommonusers
AT shuanghongwang researchonthedynamicmultisocialnetworksinfluencemaximizationproblembasedoncommonusers
AT changxingpei researchonthedynamicmultisocialnetworksinfluencemaximizationproblembasedoncommonusers
_version_ 1717373913877446656