{'fraction_non_alphanumeric': 0.019184652278177457, 'fraction_numerical': 0.0, 'mean_word_length': 5.487046632124352, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Balance Dynamic Clustering Analysis and Consensus Reaching Process With Consensus Evolution Networks in Large-Scale Group Decision Making

Large-scale group decision-making (LSGDM) solution is usually based on the clustering analysis process (CAP) and consensus reaching process (CRP). However, CAP and CRP can be contradictory since CAP is performed based on the differences between potentially small groups and CRP is conducted to improve the overall similarity of a large group. To balance CAP and CRP, a dynamic clustering analysis process (DCAP) based on consensus evolution networks is proposed. A clustering algorithm proposed based on community detection method can be used to handle the diverse network structures with dynamic consensus thresholds. The clustering validity based on the intracluster consensus levels in subgroups and the intercluster consensus level among subgroups is evaluated. Then, the DCAP after each feedback adjustment round in CRP is reanalyzed. In such a way, effective clustering can also be found after a satisfying consensus is reached. Finally, a case study shows the availability of this approach and comparative analyses are provided to highlight the advantages from both theoretical and numerical perspectives.