# US 2021/0334658 A1 · Method for performing clustering on power system operation modes based on sparse autoencoder

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0334658 A1
- Document ID: US20210334658A1
- Status: Published application
- Kind: A1
- Application number: 17/368,864
- Filed: 2021-07-07
- Published: 2021-10-28
- Earliest claimed: 2019-01-08
- Assignees: Xi'an Jiaotong University; State Grid Jiangsu Electric Power Co., Ltd.
- Applicants: Xi'an Jiaotong University; State Grid Jiangsu Electric Power Co., Ltd.
- Inventors: Gengfeng LI; Yuxiao LEI; Chunlei XU; Xiaohu ZHANG; Di SHI; Jiangfeng JIANG; Yuxiong HUANG; Yuming PENG; Zhaohong BIE
- Web page: https://patentgrep.com/patent/US20210334658A1

## CPC

- G06N 3/088: Non-supervised learning, e.g. competitive learning
- G05B 19/042: using digital processors (G05B19/05 takes precedence)
- G06F 18/23: Clustering techniques
- G06N 3/045: Combinations of networks
- G06N 3/0455: Auto-encoder networks; Encoder-decoder networks
- G06N 3/0495: Quantised networks; Sparse networks; Compressed networks
- G06N 3/08: Learning methods
- G06N 3/082: modifying the architecture, e.g. adding, deleting or silencing nodes or connections
- G06N 3/084: Backpropagation, e.g. using gradient descent
- G06N 3/0895: Weakly supervised learning, e.g. semi-supervised or self-supervised learning
- G06Q 50/06: Energy or water supply
- G05B 2219/2639: Energy management, use maximum of cheap power, keep peak load low
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G05B: CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS (systems for controlling or regulating non-electric variables G05D; systems for regulating electric or magnetic variables G05F; control devices or systems insofar as characterised by mechanical features only G05G)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

The present disclosure provides a method for performing clustering on operation modes of a power system based on a sparse autoencoder. The method includes: obtaining related data of the power system; setting a training parameter, a number of hidden layers, and a number of neurons; training an autoencoder model using the related data and extracting a topological structure and a weight matrix from the model; performing cluster analysis to obtain a number of typical scenarios; and performing decoding to obtain original data at centers of respective scenarios. The present disclosure can achieve fast selection and dimensionality reduction of feature vectors representing operation modes of a power system. In view of this, the present disclosure provides a novel idea and method for selecting a feature vector representing an operation mode of a power system and generating a typical operation scenario.

## Claims

### Claim 1

A method for performing clustering on operation modes of a power system based on a sparse autoencoder, comprising:
obtaining related data of the power system;
setting a training parameter, a number of hidden layers, and a number of neurons;
training an autoencoder model using the related data and extracting a topological structure and a weight matrix from the model;
performing cluster analysis to obtain a number of typical scenarios; and
performing decoding to obtain original data at centers of respective scenarios.

### Claim 2 (depends on 1)

The method of claim 1, wherein the related data forms an input matrix Xnm having n rows and m columns, n being a vector, and m being a number of samples.

### Claim 3 (depends on 1)

The method of claim 1, wherein the related data comprises a voltage of each node in the power system, a voltage amplitude, data of active power and reactive power of an electric generator at each node, and time-series load data of the power system within research time.

### Claim 4 (depends on 1)

The method of claim 1, wherein said setting the training parameter, the number of hidden layers, and the number of neurons comprises:
setting related parameters α, η, and a maximum number of iterations as initialization training parameters, α being a coefficient of L2 regularization, and η being a coefficient of sparse regularization; setting l=1, l being the number of hidden layers; and setting hl=2, hl being the number of neurons of an l-th hidden layer, which is a dimension of a final feature vector.

### Claim 5 (depends on 1)

The method of claim 1, wherein said training the autoencoder model using the related data comprises steps of:
S201 of determining an input matrix Xnm having n rows and m columns formed by the related data as an input;
S202 of inputting an acceptable error e and a training time t for visual training, and observing the error and a training process;
S203 of extracting a lowest-layer feature vector featuresl, and performing the cluster analysis on featuresl;
S204 of finding k types of centers of scenarios, and decoding the k types of centers of scenarios to restore centers of the original data of the typical scenarios and restore all of the original data {circumflex over (X)}n; and
S205 of obtaining a desired result, and ending a cycle.

### Claim 6 (depends on 5)

The method of claim 5, wherein in step S202, in response to a Euclidean distance between restored input data and original input data being greater than e, a number of iterations is increased, and the model is retrained; and in response to training time of the model being longer than t, that is, in response to the error reaching a range in an early iteration, the number of iterations is decreased, and the model is retrained.

### Claim 7 (depends on 5)

The method of claim 5, wherein in step S203, K-means method is selected for the clustering, a number of cluster centers is set as k, an initial value is set as k=1, and a Silhouette value Silkh is calculated; the Silhouette value Silkh is calculated by taking k=k+1, and in response to k=h, the cycle exits; and a maximum Silhouette value Silkh and a number k of the typical scenarios are obtained.

### Claim 8 (depends on 7)

The method of claim 7, wherein in response to the maximum Silhouette value Silkh being smaller than 0.85, the number of neurons is reset when hl<hl−1, and the model is retrained when hl=hl+1; otherwise, the number of hidden layers is reset as l=l+1, and the model is retrained.

### Claim 9 (depends on 5)

The method of claim 5, wherein in step S204, a Euclidean distance Φd between the matrix Xnm and {circumflex over (X)}n is calculated, and an acceptance is made in response to Φd≤ε.

### Claim 10 (depends on 5)

The method of claim 5, wherein in step S204, in response to Φd>ε and l>1, the model is retrained by returning to l=l−1; otherwise, the model is retrained by returning to h=h−1.

### Claim 11 (depends on 2)

The method of claim 2, wherein the related data comprises a voltage of each node in the power system, a voltage amplitude, data of active power and reactive power of an electric generator at each node, and time-series load data of the power system within research time.
