MétaCan
Menu
Back to cohort
Record W4402901213 · doi:10.3390/modelling5040069

Novel Adaptive Hidden Markov Model Utilizing Expectation–Maximization Algorithm for Advanced Pipeline Leak Detection

2024· article· en· W4402901213 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueModelling—International Open Access Journal of Modelling in Engineering Science · 2024
Typearticle
Languageen
FieldEngineering
TopicWater Systems and Optimization
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceLeak detectionPipeline (software)Expectation–maximization algorithmLeakMaximizationMarkov chainHidden Markov modelAlgorithmForward algorithmMarkov modelMachine learningArtificial intelligenceMaximum likelihoodVariable-order Markov modelMathematical optimizationEngineeringMathematicsStatisticsProgramming language

Abstract

fetched live from OpenAlex

In the oil industry, the leakage of pipelines containing hydrocarbon fluids causes significant environmental and economic damage. Recently, there has been a growing trend in employing data mining techniques for detecting leaks. Among these methods is the Hidden Markov Model, which, despite good results with stationary data, becomes inefficient when a leak causes a drop in the pressure or flow, reducing its accuracy. This paper presents an adaptive Hidden Markov method. Previous methods had low accuracy due to insufficient information for accurate leak detection. They often classified the size and location of leaks broadly. In contrast, the proposed model extracts hidden features to accurately identify the location and size of leaks, even in noisy conditions. Simulating a leak in a section of an oil pipeline in the Iranian Oil Export Corridor demonstrates the proposed method’s superiority over common methods like K-NN, SVM, Naive Bayes, and logistic regression.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.622
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.006
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.051
GPT teacher head0.307
Teacher spread0.256 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it