IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5231569.html
   My bibliography  Save this article

Transient Stability Assessment Model With Sample Selection Method Based on Spatial Distribution

Author

Listed:
  • Yongbin Li
  • Yiting Wang
  • Jian Li
  • Huanbei Zhao
  • Huaiyuan Wang
  • Litao Hu
  • Hiroki Sayama

Abstract

With the phasor measurement units (PMUs) being widely utilized in power systems, a large amount of data can be stored. If transient stability assessment (TSA) method based on the deep learning model is trained by this dataset, it requires high computation cost. Furthermore, the fact that unstable cases rarely occur would lead to an imbalanced dataset. Thus, power system transient stability status prediction has the bias problem caused by the imbalance of sample size and class importance. Faced with such a problem, a TSA model based on the sample selection method is proposed in this paper. Sample selection aims to optimize the training set to speed up the training process while improving the preference of the TSA model. The typical samples which can accurately express the spatial distribution of the raw dataset are selected by the proposed method. Primarily, based on the location of training samples in the feature space, the border samples are selected by trained support vector machine (SVM), and the edge samples are selected by the assistance of the approximated tangent hyperplane of a class surface. Then, the selected samples are input to stacked sparse autoencoder (SSAE) as the final classifier. Simulation results in the IEEE 39-bus system and the realistic regional power system of Eastern China show the high performance of the proposed method.

Suggested Citation

  • Yongbin Li & Yiting Wang & Jian Li & Huanbei Zhao & Huaiyuan Wang & Litao Hu & Hiroki Sayama, 2024. "Transient Stability Assessment Model With Sample Selection Method Based on Spatial Distribution," Complexity, Hindawi, vol. 2024, pages 1-12, October.
  • Handle: RePEc:hin:complx:5231569
    DOI: 10.1155/2024/5231569
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2024/5231569.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2024/5231569.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2024/5231569?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:5231569. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.