An increasing number of methods for control and analysis of power systems relies on representing power networks as weighted undirected graphs. Unfortunately, the presence of outliers in power system graphs may have a negative impact on many of these methods. In addition, detecting outliers can be a relevant task on its own. Motivated by the low number of outlier detection algorithms focusing on weighted undirected graphs, this paper proposes an efficient and effective method to detect loosely connected graph clusters below a certain number of nodes. The essence of the method lies in the efficient examination of the spectral minimal spanning tree of the input graph. The obtained results on several large test power networks validate the high outlier detection performance of the proposed method and its high computational efficiency.
|Title of host publication||20th Power Systems Computation Conference (PSCC)|
|Number of pages||8|
|Publication status||Published - 2018|
|Event||20th Power Systems Computation Conference, PSCC 2018 - Dublin, Ireland|
Duration: 11 Jun 2018 → 15 Jun 2018
|Conference||20th Power Systems Computation Conference, PSCC 2018|
|Period||11/06/18 → 15/06/18|
Bibliographical noteGreen Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
- Graph outlier detection
- Power network partitioning
- Power system analysis computing