Combining and comparing various machine‐learning algorithms to improve dissolved gas analysis interpretation
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Since the discovery of dissolved gas analysis (DGA), it is considered as a leading technique for the diagnosis of liquid insulated power equipment. However, accurate analysis results can only be achieved if the measured gases closely reflect the actual equipment condition to enable an appropriate interpretation of these gases. In general, conventional techniques such as the ratio method, key gases, and Duval triangle combined or not with artificial intelligence techniques such as machine‐learning algorithms are used for DGA interpretation. Here, four well‐known machine‐learning algorithms are compared in terms of DGA fault classification – Bayes network, multilayer perceptron, k ‐nearest neighbour, and J48 decision tree. Moreover, the effect of applying ensemble methods such as boosting through the Adaboost algorithm and bootstrap aggregation (bagging) is analysed, and the performances of these algorithms are evaluated. The data for developing classification models was transformed into three forms, other than the raw data. The obtained results clearly presented the efficiency and stability of some algorithms such as the J48 tree and Bayes networks for DGA fault classification, in particular, when the data is appropriately pre‐processed. Moreover, the performance of these algorithms was found to consistently improve by integrating the concepts of multiple models or ensemble methods.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it