Key Node Discovery Algorithm Based on Multiple Relationships and Multiple Features in Social Networks
Xianyong Li,
Ying Tang,
Yajun Du and
Yanjie Li
Mathematical Problems in Engineering, 2021, vol. 2021, 1-12
Abstract:
The key nodes play important roles in the processes of information propagation and opinion evolution in social networks. Previous work rarely considered multiple relationships and features into key node discovery algorithms at the same time. Based on the relational networks including the forwarding network, replying network, and mentioning network in a social network, this paper first proposes an algorithm of the overlapping user relational network to extract different relational networks with same nodes. Integrated with these relational networks, a multirelationship network is established. Subsequently, a key node discovery (KND) algorithm is presented on the basis of the shortest path, degree centrality, and random walk features in the multirelationship network. The advantages of the proposed KND algorithm are proved by the SIR propagation model and the normalized discounted cumulative gain on the multirelationship networks and single-relation networks. The experiment’s results show that the proposed KND method for finding the key nodes is superior to other baseline methods on different networks.
Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/1956356.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/1956356.xml (text/xml)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:1956356
DOI: 10.1155/2021/1956356
Access Statistics for this article
More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().