Development of Hypergraph Based Improved Random Forest Algorithm for Partial Discharge Pattern Classification
Precise partial discharge (PD) detection is a key factor in anticipating insulation failures. The continuous efforts of researchers have led to the design of a variety of algorithms focusing on PD pattern classification. However, the trade-off between features taken up for classification and the det...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9306776/ |
id |
doaj-7c133692c2fe4b33b313f6bbb5d45d00 |
---|---|
record_format |
Article |
spelling |
doaj-7c133692c2fe4b33b313f6bbb5d45d002021-03-30T15:28:59ZengIEEEIEEE Access2169-35362021-01-0199610910.1109/ACCESS.2020.30471259306776Development of Hypergraph Based Improved Random Forest Algorithm for Partial Discharge Pattern ClassificationSuganya Govindarajan0https://orcid.org/0000-0003-3776-367XJorge Alfredo Ardila-Rey1https://orcid.org/0000-0001-8811-2274Kannan Krithivasan2https://orcid.org/0000-0003-4182-7461Jayalalitha Subbaiah3https://orcid.org/0000-0002-6308-2141Nikhith Sannidhi4https://orcid.org/0000-0002-9600-3075M. Balasubramanian5https://orcid.org/0000-0002-1345-367XElectrical and Electronics Engineering Department, SASTRA Deemed University, Thanjavur, IndiaDepartamento de Ingeniería Eléctrica, Universidad Técnica Federico Santa María, Santiago de Chile, ChileElectrical and Electronics Engineering Department, SASTRA Deemed University, Thanjavur, IndiaElectrical and Electronics Engineering Department, SASTRA Deemed University, Thanjavur, IndiaZoho Corporation, Chennai, IndiaElectrical and Electronics Engineering Department, SASTRA Deemed University, Thanjavur, IndiaPrecise partial discharge (PD) detection is a key factor in anticipating insulation failures. The continuous efforts of researchers have led to the design of a variety of algorithms focusing on PD pattern classification. However, the trade-off between features taken up for classification and the detection rate continues to pose considerable challenges in terms of feature selection from acquired data, increased computing time, and so on. In this article, a Hypergraph (HG) based improved Random Forest (RF) algorithm by employing the Recursive Feature Elimination (RFE) algorithm (HG-RF-RFE), has been developed for PD source classification. HG representation of data is considered for obtaining statistical features, which turn out to be a subset of a set of all hyper edges called Hyper statistical features (Helly, Non-Helly, and Isolated hyper edges). HG-RF-RFE takes hyper statistical features and hyper edges as features for classification. The algorithm's efficiency is tested against noise-free PD data obtained from SASTRA High Voltage Laboratory, and large-sized noisy PD data obtained from High-Voltage Research and Test Laboratory at Universidad Técnica Federico Santa Maria (LIDAT). The robustness of the proposed algorithm is tested with both time and phase domain PD features using the Mathews Correlation Coefficient (MCC), harmonic mean-based feature Score (F1 Score) as evaluation metrics, and by k-fold validation technique. The proposed HG-RF-RFE achieved 98.8% accuracy with minimal features and significantly reduces computation time without compromising accuracy. It is worth mentioning that the HG-RF-RFE technique is superior to many state of the art algorithms in terms of feature elimination and classification accuracy.https://ieeexplore.ieee.org/document/9306776/Hypergraphpartial dischargepattern classificationrandom forestrecursive feature eliminationstatistical features |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Suganya Govindarajan Jorge Alfredo Ardila-Rey Kannan Krithivasan Jayalalitha Subbaiah Nikhith Sannidhi M. Balasubramanian |
spellingShingle |
Suganya Govindarajan Jorge Alfredo Ardila-Rey Kannan Krithivasan Jayalalitha Subbaiah Nikhith Sannidhi M. Balasubramanian Development of Hypergraph Based Improved Random Forest Algorithm for Partial Discharge Pattern Classification IEEE Access Hypergraph partial discharge pattern classification random forest recursive feature elimination statistical features |
author_facet |
Suganya Govindarajan Jorge Alfredo Ardila-Rey Kannan Krithivasan Jayalalitha Subbaiah Nikhith Sannidhi M. Balasubramanian |
author_sort |
Suganya Govindarajan |
title |
Development of Hypergraph Based Improved Random Forest Algorithm for Partial Discharge Pattern Classification |
title_short |
Development of Hypergraph Based Improved Random Forest Algorithm for Partial Discharge Pattern Classification |
title_full |
Development of Hypergraph Based Improved Random Forest Algorithm for Partial Discharge Pattern Classification |
title_fullStr |
Development of Hypergraph Based Improved Random Forest Algorithm for Partial Discharge Pattern Classification |
title_full_unstemmed |
Development of Hypergraph Based Improved Random Forest Algorithm for Partial Discharge Pattern Classification |
title_sort |
development of hypergraph based improved random forest algorithm for partial discharge pattern classification |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2021-01-01 |
description |
Precise partial discharge (PD) detection is a key factor in anticipating insulation failures. The continuous efforts of researchers have led to the design of a variety of algorithms focusing on PD pattern classification. However, the trade-off between features taken up for classification and the detection rate continues to pose considerable challenges in terms of feature selection from acquired data, increased computing time, and so on. In this article, a Hypergraph (HG) based improved Random Forest (RF) algorithm by employing the Recursive Feature Elimination (RFE) algorithm (HG-RF-RFE), has been developed for PD source classification. HG representation of data is considered for obtaining statistical features, which turn out to be a subset of a set of all hyper edges called Hyper statistical features (Helly, Non-Helly, and Isolated hyper edges). HG-RF-RFE takes hyper statistical features and hyper edges as features for classification. The algorithm's efficiency is tested against noise-free PD data obtained from SASTRA High Voltage Laboratory, and large-sized noisy PD data obtained from High-Voltage Research and Test Laboratory at Universidad Técnica Federico Santa Maria (LIDAT). The robustness of the proposed algorithm is tested with both time and phase domain PD features using the Mathews Correlation Coefficient (MCC), harmonic mean-based feature Score (F1 Score) as evaluation metrics, and by k-fold validation technique. The proposed HG-RF-RFE achieved 98.8% accuracy with minimal features and significantly reduces computation time without compromising accuracy. It is worth mentioning that the HG-RF-RFE technique is superior to many state of the art algorithms in terms of feature elimination and classification accuracy. |
topic |
Hypergraph partial discharge pattern classification random forest recursive feature elimination statistical features |
url |
https://ieeexplore.ieee.org/document/9306776/ |
work_keys_str_mv |
AT suganyagovindarajan developmentofhypergraphbasedimprovedrandomforestalgorithmforpartialdischargepatternclassification AT jorgealfredoardilarey developmentofhypergraphbasedimprovedrandomforestalgorithmforpartialdischargepatternclassification AT kannankrithivasan developmentofhypergraphbasedimprovedrandomforestalgorithmforpartialdischargepatternclassification AT jayalalithasubbaiah developmentofhypergraphbasedimprovedrandomforestalgorithmforpartialdischargepatternclassification AT nikhithsannidhi developmentofhypergraphbasedimprovedrandomforestalgorithmforpartialdischargepatternclassification AT mbalasubramanian developmentofhypergraphbasedimprovedrandomforestalgorithmforpartialdischargepatternclassification |
_version_ |
1724179421631348736 |