Analysis Method of Transformer Winding Looseness Fault Based on Chaos Theory and K-means Algorithm Optimized by Mayfly Optimization Algorithm

被引:0
|
作者
Xue, Jiantong [1 ]
Ma, Hongzhong [1 ]
Ni, Yiming [1 ]
Wan, Keli [1 ]
Ze, Hengpeng [1 ]
机构
[1] School of Electrical and Power Engineering, Hohai University, Nanjing,211100, China
来源
Gaodianya Jishu/High Voltage Engineering | 2024年 / 50卷 / 08期
关键词
K-means clustering;
D O I
10.13336/j.1003-6520.hve.20221828
中图分类号
学科分类号
摘要
In order to analyze the state of transformer windings more accurately and effectively, a method for analyzing the characteristics of transformer winding looseness fault based on the chaos theory and K-means algorithm optimized by mayfly optimization algorithm is proposed. Firstly, the phase space of transformer vibration signal is reconstructed using C-C method, and the chaotic characteristics of transformer vibration signal are analyzed. The correlation dimension and Kolmogorov entropy are obtained and taken as the chaotic features. Then, the mayfly optimization algorithm is introduced into K-means clustering analysis to optimize the cluster center selection of high-dimensional phase space trajectory, and the sum of cluster center distance of phase trajectory and vector offset are obtained and taken as geometric features. The experimental results show that the maximum Lyapunov exponents of transformer vibration signals are all greater than 0, which is suitable for the analysis of chaotic characteristics. The chaos features calculated by transformer vibration signals can characterize the states of transformer windings. At the same time, the cluster centers obtained by the mayfly optimized K-means algorithm can be used as feature points to extract the geometric features of the whole phase space trajectory, which distinguish whether the winding looseness fault occurs. The combination of the two features can realize the accurate monitoring of transformer winding states, thus providing a theoretical basis for the online maintenance of transformer windings. © 2024 Science Press. All rights reserved.
引用
收藏
页码:3783 / 3792
相关论文
共 50 条
  • [31] Order Batch Optimization Based on Improved K-Means Algorithm
    Zu, Qiaohong
    Feng, Rui
    HUMAN CENTERED COMPUTING, 2019, 11956 : 700 - 705
  • [32] Optimization study on k value of K-means algorithm
    Institute of Computer Network System, Hefei University of Technology, Hefei 230009, China
    Xitong Gongcheng Lilum yu Shijian, 2006, 2 (97-101):
  • [33] Distributed K-Means algorithm based on a Spark optimization sample
    Feng, Yongan
    Zou, Jiapeng
    Liu, Wanjun
    Lv, Fu
    PLOS ONE, 2024, 19 (12):
  • [34] Optimization of K-Means Algorithm: Ant Colony Optimization
    Reddy, T. Namratha
    Supreethi, K. P.
    2017 INTERNATIONAL CONFERENCE ON COMPUTING METHODOLOGIES AND COMMUNICATION (ICCMC), 2017, : 530 - 535
  • [35] Quantum Fuzzy K-Means Algorithm Based on Fuzzy Theory
    Hou, Min
    Zhang, Shibin
    Xia, Jinyue
    ARTIFICIAL INTELLIGENCE AND SECURITY, ICAIS 2022, PT I, 2022, 13338 : 348 - 356
  • [36] Optimized phase-coding method for absolute phase retrieval based on K-means algorithm
    Cai, Bolin
    Shen, Yuan
    Wu, Jun
    Yang, Yu
    Wang, Yuwei
    Wang, Mengyu
    Chen, Xiangcheng
    Zhang, Lei
    Wang, Keyi
    JOURNAL OF MODERN OPTICS, 2021, 68 (06) : 303 - 310
  • [37] Analysis and improvement for K-Means Algorithm
    Xiao Jing-zhong
    Xiao Li
    ADVANCES IN MECHANICAL ENGINEERING, PTS 1-3, 2011, 52-54 : 1976 - 1980
  • [38] Fault Location of Hybrid Transmission Lines Based on k-means Algorithm
    Shang Liqun
    Liu Zeyu
    Liu Xinru
    Liu Pei
    2018 CHINA INTERNATIONAL CONFERENCE ON ELECTRICITY DISTRIBUTION (CICED), 2018, : 1905 - 1910
  • [39] A k-means based clustering algorithm
    Bloisi, Domenico Daniele
    Locchi, Luca
    COMPUTER VISION SYSTEMS, PROCEEDINGS, 2008, 5008 : 109 - 118
  • [40] Clustering Research on Ship Fault Phenomena Based on K-means Algorithm
    Wei, Guo-dong
    Luo, Zhong
    Yu, Xiang
    PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019), 2019, : 4412 - 4415