Abstract
The rapid development of information technology has made social network large-scale group decision-making (SN-LSGDM) a focus of the field of decision science. Clustering and consensus-reaching process (CRP) are widely used methods in SN-LSGDM. In this paper, we propose an improved affinity propagation (AP) clustering algorithm that fully consider the trust and similarity attributes to obtain clustering results that are more in line with the expert preferences. Furthermore, we propose an adjustable minimum-cost consensus (MCC) model that considers trust-polymerization degree, which takes into account variations in expert weights and cluster diversity. And the cuckoo search (CS) algorithm is utilized to solve the model. Finally, the applicability and advantages of the proposed methods are demonstrated through a case and comparative analysis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
