Consensus reaching in LSGDM: Overlapping community detection and bounded confidence-driven feedback mechanism

被引:5
作者
Wang, Ying-Ming [1 ]
Song, Hui -Hui [1 ,2 ]
Dutta, Bapi [2 ]
Garcia-Zamora, Diego [2 ]
Martinez, Luis [2 ]
机构
[1] Fuzhou Univ, Decis Sci Inst, Fuzhou 350116, Fujian, Peoples R China
[2] Univ Jaen, Dept Comp Sci, Jaen 23071, Spain
基金
中国国家自然科学基金;
关键词
Maximum consensus and minimum adjustment; ELICIT information; Overlapping community detection; Page-Rank; Bounded confidence; Feedback mechanism; GROUP DECISION-MAKING; MINIMUM ADJUSTMENT; MODEL; NETWORKS; COST;
D O I
10.1016/j.ins.2024.121104
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The surge of social media has made large-scale group decision-making (LSGDM) crucial in real -world decision-making. The intricacies of trust relationships within social networks that emerged from relations in social media affect both the clustering and the consensus of large groups. However, existing research often neglects the impact of overlapping social trust networks on group consensus. To fill this gap, this study introduces a novel consensus-reaching process (CRP) that integrates overlapping community detection and ELICIT-based optimization models under bounded confidence. Initially, the Lancichinetti-Fortunato method (LFM) is employed to identify overlapping community structures within social trust networks, delineating several subgroups and identifying corresponding non -overlapping and overlapping decision-makers (DMs). Subsequently, the PageRank (PR) algorithm is utilized to compute both global and local weights for individuals, facilitating a rational aggregation of collective and subgroup opinions. Next, two-stage Extended Comparative Linguistic Expressions With Symbolic Translation (ELICIT)based optimization consensus models under bounded confidence are designed, aiming to provide optimal feedback for guiding DMs' preference adjustments. Since overlapping DMs may belong to multiple subgroups, a weighted influence feedback mechanism is introduced to mitigate conflicting guidance from these multiple affiliations. Finally, we demonstrate the effectiveness and superiority of our proposed method through numerical validation and comparative analysis against existing approaches.
引用
收藏
页数:27
相关论文
共 45 条
  • [1] A Survey on PageRank Computing
    Berkhin, Pavel
    [J]. INTERNET MATHEMATICS, 2005, 2 (01) : 73 - 120
  • [2] Fast unfolding of communities in large networks
    Blondel, Vincent D.
    Guillaume, Jean-Loup
    Lambiotte, Renaud
    Lefebvre, Etienne
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
  • [3] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117
  • [4] Carvalho G, 2011, J UNIVERS COMPUT SCI, V17, P261
  • [5] Optimized decision support for BIM maturity assessment
    Chen, Zhen-Song
    Zhou, Meng-Die
    Chin, Kwai-Sang
    Darko, Amos
    Wang, Xian-Jia
    Pedrycz, Witold
    [J]. AUTOMATION IN CONSTRUCTION, 2023, 149
  • [6] A trust-similarity analysis-based clustering method for large-scale group decision-making under a social network
    Du, Zhi-jiao
    Luo, Han-yang
    Lin, Xu-dong
    Yu, Su-min
    [J]. INFORMATION FUSION, 2020, 63 : 13 - 29
  • [7] A comprehensive loss analysis-based decision support method for e-democratic multi-agent cooperative decision-making
    Du, Zhijiao
    Yu, Sumin
    Wang, Jing
    Luo, Hanyang
    Lin, Xudong
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2024, 238
  • [8] A Linguistic Metric for Consensus Reaching Processes Based on ELICIT Comprehensive Minimum Cost Consensus Models
    Garcia-Zamora, Diego
    Labella, Alvaro
    Rodriguez, Rosa M.
    Martinez, Luis
    [J]. IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2023, 31 (05) : 1676 - 1688
  • [9] Finding overlapping communities in networks by label propagation
    Gregory, Steve
    [J]. NEW JOURNAL OF PHYSICS, 2010, 12
  • [10] Hegselmann R, 2002, JASSS-J ARTIF SOC S, V5