Effectiveness of partition and graph theoretic clustering algorithms for multiple source partial discharge pattern classification using probabilistic neural network and its adaptive version: a critique based on experimental studies

  • Authors:
  • S. Venkatesh;S. Gopal;K. Kannan

  • Affiliations:
  • Department of Electrical and Electronics Engineering, School of Electrical and Electronics Engineering, SASTRA University, Tamil Nadu, Thanjavur, India;W.S. Test Systems Limited, Doddajalla, Karnataka, Bangalore, India;School of Humanities and Sciences, SASTRA University, Tamil Nadu, Thanjavur, India

  • Venue:
  • Journal of Electrical and Computer Engineering
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Partial discharge (PD) is amajor cause of failure of power apparatus and hence itsmeasurement and analysis have emerged as a vital field in assessing the condition of the insulation system. Several efforts have been undertaken by researchers to classify PD pulses utilizing artificial intelligence techniques. Recently, the focus has shifted to the identification of multiple sources of PD since it is often encountered in real-time measurements. Studies have indicated that classification of multi-source PD becomes difficult with the degree of overlap and that several techniques such as mixed Weibull functions, neural networks, and wavelet transformation have been attempted with limited success. Since digital PD acquisition systems record data for a substantial period, the database becomes large, posing considerable difficulties during classification. This research work aims firstly at analyzing aspects concerning classification capability during the discrimination ofmultisource PD patterns. Secondly, it attempts at extending the previous work of the authors in utilizing the novel approach of probabilistic neural network versions for classifying moderate sets of PD sources to that of large sets. The third focus is on comparing the ability of partition-based algorithms, namely, the labelled (learning vector quantization) and unlabelled (K-means) versions, with that of a novel hypergraph-based clustering method in providing parsimonious sets of centers during classification.