期刊
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
卷 52, 期 8, 页码 5271-5283出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMC.2021.3120809
关键词
Costs; Clustering algorithms; Complexity theory; Decision making; Proposals; Linguistics; Extraterrestrial measurements; Adjustment cost; clustering analysis; consensus reaching process; large-scale group decision making (LSGDM)
资金
- National Natural Science Foundation of China [72071045, 71771051, 72071151, 71971115, 71701158]
- Natural Science Foundation of Jiangsu Province [BK20210293]
- Natural Science Foundation of Hubei Province [2020CFB773]
In this study, a new K-means clustering method is proposed to address the complexity of consensus reaching in large-scale group decision making. By considering preferences and preference adjustment costs, the clustering algorithm aims to improve the similarity among intracluster individuals while balancing the conflict between consensus reaching levels and total adjustment costs.
In large-scale group decision making (LSGDM), appropriate clustering analysis is important to consensus reaching since it can reduce the interactive complexity among individuals. According to the traditional clustering method, a conflict may arise between the consensus reaching levels and total adjustment costs within clusters when individuals have different unit adjustment cost, which reflects their willingness to make concessions. Since this conflict may aggravate the consensus complexity, we propose a new K-means clustering method that considers both preferences and the preference adjustment cost. The preference adjustment cost is attached to preferences with a parameter that can be determined by balancing this conflict. Because of such conflict, the proposed clustering algorithm can improve the similarity of intracluster individuals on the preference adjustment cost by offsetting some acceptable consensus reaching levels within clusters. According to the proposed clustering algorithm, individuals who have both similar preferences and adjustment willingness are classified into the same clusters. In this way, the moderator can provide similar compensation strategies for intracluster individuals, which will decrease the adjustment complexity. A practical case study of team construction examines the application of the proposed algorithm, and the related comparative analysis shows that it is convenient for managers to persuade individuals to reach a consensus under the improved clustering results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据