A Centrality Maximization Approach for Link Recommendation
Dublin Core
Title
A Centrality Maximization Approach for Link Recommendation
Subject
social networks; link recommendation; node centrality; submodular function maximization
Description
In social networks, the goal of link recommendation is to recommend links for nodes and add them to the network, thereby satisfying the potential link interests of the nodes. The centrality of nodes in social networks typically quantifies the importance of nodes in the network. Some nodes may desire to increase their centrality by adding links. First, a multi-community centrality measurement method is proposed, and based on harmonic centrality, a hybrid centrality measurement method is introduced. Next, the link recommendation problem is regarded as a problem of maximizing node hybrid centrality, which can be formally modeled as a submodular function maximization problem. A greedy algorithm with performance guarantees can be directly applied to select the best links. Compared to existing link prediction and link recommendation algorithms, our algorithm recommends links that better improve the hybrid centrality of users.
Creator
Qi Zhang, Hao Zhong
Source
www.ijcit.com
Date
March 2025
Contributor
peri irawan
Format
pdf
Language
english
Type
text
Files
Collection
Citation
Qi Zhang, Hao Zhong, “A Centrality Maximization Approach for Link Recommendation,” Repository Horizon University Indonesia, accessed June 5, 2025, https://repository.horizon.ac.id/items/show/9195.