{'fraction_non_alphanumeric': 0.015765765765765764, 'fraction_numerical': 0.00563063063063063, 'mean_word_length': 5.173611111111111, '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}}
Coherency identification based on maximum spanning tree partitioning

This paper presents a novel method for finding coherent groups of generators in large power systems, based on graph partitioning and clustering methods commonly used in other areas like image processing and gene expression analysis. First, the power system is modeled as a graph in order to obtain a maximum spanning tree that represents the strongest connections between generators in the system. Then, inconsistent edges are removed from the tree according to proposed criteria. This leads to the identification of the coherent groups of generators. Two algorithms are proposed for the elimination of the edges in the maximum spanning tree, both based on Fukuyama-Sugeno validity index. The method is tested on 68-bus test system and 678-bus Italian equivalent system. Results are compared with classical approaches.