Spectral MST-Based Graph Outlier Detection With Application to Clustering of Power Networks

Conference paper (2018)

Authors

I. Tyuryukanov Intelligent Electrical Power Grids -

M. Popov Intelligent Electrical Power Grids -

M.A.M.M. van der Meijden TenneT TSO B.V.

V Terzija The University of Manchester

Research Group

Intelligent Electrical Power Grids () (TU Delft)

DOI: https://doi.org/10.23919/PSCC.2018.8442671

Power network partitioning Outliers Graph outlier detection Power system analysis computing

More Info

expand_more

To reference this document use:

http://resolver.tudelft.nl/uuid:82afae5a-151d-4a3b-9a53-b533f70b9ef1

Published Date

2018

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Electrical Sustainable Energy

Research Group

Intelligent Electrical Power Grids

Abstract

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.

Files

08442671.pdf

(.pdf | 0.559 Mb)