Structural Holes Theory-Based Influence Maximization in Social Network

Zhu, Jinghua; Yin, Xuming; Wang, Yake; Li, Jinbao; Zhong, Yingli; Li, Yingshu

doi:10.1007/978-3-319-60033-8_73

Cited by 6 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It should be noted that the circle not only expresses the information of cited frequency, but also conveys other information. Nodes with purple circles are nodes with centrality greater than 0.1, which means that this document is important in the co-cited network, and this article probably acts as Structural Hole ( Zhu et al, 2017 ). Structural Hole plays an important role in information dissemination, which has a better position in social networks to expand the scope of information dissemination ( Gong et al, 2020b ).…”

Section: Content Analysismentioning

confidence: 99%

Bibliometric analysis for economy in COVID-19 pandemic

Zhong

Lin

2022

Heliyon

View full text Add to dashboard Cite

Section: Content Analysismentioning

confidence: 99%

Bibliometric analysis for economy in COVID-19 pandemic

Zhong

Lin

2022

Heliyon

View full text Add to dashboard Cite

“…Since structural hole spanners in social networks could produce influences to users located in multiple communities, only using social influences of structural hole spanners for users in one community could not exactly approximate their social influences in the whole network. Existed studies have proposed to utilize structural holes for solving the influence maximization problem and finding influential users (Xiaoping & Yurong, 2015; Zhu, Liu, & Yin, 2017; Zhu, Yin, et al, 2017). These researches compute structural hole values for all structural hole spanners and combine these values into the traditional greedy‐based influence maximization algorithm.…”

Section: Introductionmentioning

confidence: 99%

Exploiting community and structural hole spanner for influence maximization in social networks

Li,

Chen

2023

Expert Systems

View full text Add to dashboard Cite

Viral marketing is a frequently used social marketing strategy which aims to promote products on various social media. In order to devise an efficient viral marketing strategy, influence maximization problem is widely studied in social networks. Influence maximization problem tries to find a set of influential users who could influence social users maximally. However, existed influence maximization algorithms could not satisfy the needs of social marketers well. In social networks, community structure is an important feature where social users are closely connected together in groups, and structural hole spanners are those users who bridge different communities. In order to balance the effectiveness and efficiency of viral marketing in social networks, in this paper, we present to exploit the community structure and structural hole spanners in social networks for solving the influence maximization problem. Different to traditional algorithms, we devise a strategy to approximate social influences of social users to find seeds efficiently. In particular, for an internal user inside a community in social networks, we utilize his social influence to members inside this community to approximate his social influence in the whole social network. For a structural hole spanner who bridges multiple communities, we utilize his social influence to members in these communities to approximate his social influence in the whole network. Based on the approximate social influence, information diffusion model and greedy framework, we propose a Community and Structural Hole Spanner based Greedy (CSHS‐G) algorithm which devises several influence lists to store social influences of users and fast computation scheme to find seeds. Besides, to further improve the efficiency, we propose a Community and Structural Hole Spanner based Heuristic (CSHS‐H) algorithm which approximates social influences of structural hole spanners by utilizing their 2‐hops influences. We conduct a comprehensive performance evaluation on the crawled real‐world data set. Experimental results show that, compared to all of the baseline algorithms, our proposed algorithms not only have high efficiency, but also could guarantee larger influence spread.

show abstract