Finding effective nodes to maximize the trusting behavior propagation in social networks

被引:2
|
作者
Abbaspour Orangi, Mina [1 ]
Hashemi Golpayegani, Alireza [1 ]
机构
[1] Amirkabir Univ Technol, Dept Comp Engn & Informat Technol, Tehran, Iran
关键词
Social network analysis; Behavior diffusion; Trust behavior; Trust propagation; INFLUENTIAL NODES; DYNAMICS;
D O I
10.1007/s00607-021-00949-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
It is generally accepted that trust is one of the main issues in the area of social networks. Trust values can be measured explicitly or implicitly. There are various approaches to compute the trust value of users implicitly. These approaches consider a uniform trusting behavior for all users of a social network. While it would be more accurate to acknowledge the differences between the users in terms of how they trust others and the factors that they consider in this regard. Trusting behavior of users can also be influenced by the behavior of others with whom they interact. The mechanism of these influences and the conditions for changing the trusting behavior are of great importance for this discussion. In this study, our goal is to model the differences between the trusting behaviors of social network users. For this purpose, we define three behavior modes for the way users trust each other. In each mode, trust calculations are based on behavioral and functional characteristics of users, which are shaped by their subjective beliefs. A dataset that has the interaction information between each pair of nodes is used to define the trusting behavior pattern between users. Also, three scenarios are defined for assessing the propagation of the behavior modes. Then, we attempt to maximize the influence and find the effective nodes for propagating the trusting behavior modes in the network. To this end, we focus on the structure of the social network users in different propagation scenarios. The results show differences between the trust level outcomes reached with each behavior mode. Also, the impacts of propagation source node selection methods differ in each propagation scenario.
引用
收藏
页码:2995 / 3016
页数:22
相关论文
共 50 条
  • [21] DeepFriend: finding abnormal nodes in online social networks using dynamic deep learning
    Wanda, Putra
    Jie, Huang J.
    [J]. SOCIAL NETWORK ANALYSIS AND MINING, 2021, 11 (01)
  • [22] CFIN: A community-based algorithm for finding influential nodes in complex social networks
    Khomami, Mohammad Mehdi Daliri
    Rezvanian, Alireza
    Meybodi, Mohammad Reza
    Bagheri, Alireza
    [J]. JOURNAL OF SUPERCOMPUTING, 2021, 77 (03): : 2207 - 2236
  • [23] CFIN: A community-based algorithm for finding influential nodes in complex social networks
    Mohammad Mehdi Daliri Khomami
    Alireza Rezvanian
    Mohammad Reza Meybodi
    Alireza Bagheri
    [J]. The Journal of Supercomputing, 2021, 77 : 2207 - 2236
  • [24] DeepFriend: finding abnormal nodes in online social networks using dynamic deep learning
    Putra Wanda
    Huang J. Jie
    [J]. Social Network Analysis and Mining, 2021, 11
  • [25] Combining intensification and diversification to maximize the propagation of social influence
    Fan, Xiaoguang
    Li, Victor O. K.
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2013, : 2995 - 2999
  • [26] Detection of top-r spreader influential nodes on the Social Internet of Things networks to maximize spreading influence
    Ma, Te
    Lan, Lan
    Zong, Yanxia
    Arebi, Peyman
    [J]. EUROPEAN PHYSICAL JOURNAL PLUS, 2024, 139 (09):
  • [27] Behavior Propagation in Cognitive Radio Networks: A Social Network Approach
    Li, Husheng
    Song, Ju Bin
    Chen, Chien-fei
    Lai, Lifeng
    Qiu, Robert C.
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (02) : 646 - 657
  • [28] Using Spectral Clustering for Finding Students' Patterns of Behavior in Social Networks
    Obadi, Gamila
    Drazdilova, Pavla
    Martinovic, Jan
    Slaninova, Katerina
    Snasel, Vaclav
    [J]. PROCEEDINGS OF THE DATESO 2010 WORKSHOP - DATESO DATABASES, TEXTS, SPECIFICATIONS, AND OBJECTS, 2010, 567 : 118 - 130
  • [29] Recommending Links to Maximize the Influence in Social Networks
    Coro, Federico
    D'Angelo, Gianlorenzo
    Velaj, Yllka
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 2195 - 2201
  • [30] A high-performance algorithm for finding influential nodes in large-scale social networks
    Mohsen Taherinia
    Mahdi Esmaeili
    Behrouz Minaei-Bidgoli
    [J]. The Journal of Supercomputing, 2022, 78 : 15905 - 15952