k-Nearest neighbour based approach for the protection of distribution network with renewable energy integration

被引:12
|
作者
Gangwar, Amit Kumar [1 ]
Shaik, Abdul Gafoor [1 ]
机构
[1] Indian Inst Technol, Dept Elect Engn, Jodhpur 342001, India
关键词
k-medoids clustering; k-Nearest neighbor classifier; Weighted k-Nearest neighbor regression; Fault location; Fault classification; Distribution system; Solar wind penetration; RADIAL-DISTRIBUTION SYSTEMS; FAULT LOCATION ALGORITHM; NEURAL-NETWORK; WAVELET; SCHEME; CLASSIFICATION; TRANSFORM; COMBINATION; LINES;
D O I
10.1016/j.epsr.2023.109301
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a novel protection algorithm based on K-medoids clustering and weighted k-Nearest neighbor regression. K-medoids clustering is used for fault detection and classification, while weighted k-Nearest neighbor regression is used to locate the fault. The three phase current signals are sampled at substation with frequency of 3.84 kHz and then decomposed with a db1 mother wavelet. Using the moving window of one cycle, k-medoids clustering is applied to wavelet approximate coefficients over a cycle to obtain two medoids. The difference of medoids is defined as fault index, which is compared with threshold to detect and classify the faults. Various statistical features are computed from post fault approximate wavelet coefficients obtained are fed to k-Nearest Neighbor classifier detect the two nearest buses. Followed by this detection the fault location between these two busses is estimated using weighted k-NN regression. The process of detection, classification and location of fault is accomplished within half a cycle. The various case studies used for established the robustness of the algorithm include type of fault, fault impedance and fault incidence angle and fault location. The proposed algorithm is proved to be not affected by DG trip, islanding and noise.
引用
收藏
页数:11
相关论文
共 50 条
  • [21] Hyperspectral Image Classification via a Joint Weighted K-Nearest Neighbour Approach
    Bo, Chunjuan
    Wang, Dong
    Lu, Huchuan
    COMPUTER VISION - ACCV 2016 WORKSHOPS, PT I, 2017, 10116 : 349 - 360
  • [22] Distribution of components in the k-nearest neighbour random geometric graph for k below the connectivity threshold
    Falgas-Ravry, Victor
    ELECTRONIC JOURNAL OF PROBABILITY, 2013, 18 : 1 - 22
  • [23] Continuous k-Nearest Neighbour Strategies Using the mqrtree
    Osborn, Wendy
    ADVANCES IN NETWORK-BASED INFORMATION SYSTEMS, NBIS-2018, 2019, 22 : 168 - 181
  • [24] k-Nearest Neighbour method in functional nonparametric regression
    Burba, Florent
    Ferraty, Frederic
    Vieu, Philippe
    JOURNAL OF NONPARAMETRIC STATISTICS, 2009, 21 (04) : 453 - 469
  • [25] An empirical analysis of the probabilistic K-nearest neighbour classifier
    Manocha, S.
    Girolami, M. A.
    PATTERN RECOGNITION LETTERS, 2007, 28 (13) : 1818 - 1824
  • [26] Outlier detection using k-nearest neighbour graph
    Hautamäki, V
    Kärkkäinen, I
    Fränti, P
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 3, 2004, : 430 - 433
  • [27] Central limit theorems for k-nearest neighbour distances
    Penrose, MD
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2000, 85 (02) : 295 - 320
  • [28] Modified K-nearest neighbour filters for simple implementation
    Gevorkian, D
    Egiazarian, K
    Astola, J
    ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL IV: EMERGING TECHNOLOGIES FOR THE 21ST CENTURY, 2000, : 565 - 568
  • [29] Hotspot prediction of e-commerce network users based on improved K-nearest neighbour algorithm
    Qiao, Gang
    INTERNATIONAL JOURNAL OF AUTONOMOUS AND ADAPTIVE COMMUNICATIONS SYSTEMS, 2022, 15 (03) : 202 - 219
  • [30] A multilevel k-nearest neighbour learning algorithm based on k-means clustering
    Ying, Xu
    2007 International Symposium on Computer Science & Technology, Proceedings, 2007, : 250 - 253