Water Leak Detection Survey: Challenges & Research Opportunities Using Data Fusion & Federated Learning
Bibliographic record
Abstract
With the increase in pipeline usage for fluid transportation, leak detection has become a major concern. More specifically, detecting water leaks has become a pressing challenge to both governmental and industrial stakeholders due to the financial losses it causes as well as the safety concerns associated with it. This issue is further highlighted in industrial and manufacturing environments such as the steel-making process in which a water leak into a furnace can cause a significant explosion that would threaten both the facility and its operators. Therefore, many different water leak detection methods belonging to different types (hardware-in-the-loop-based, simulation-in-the-loop-based, or hybrid) have been proposed in the literature. However, many of these methods either are computationally complex or only suitable for particular applications. Hence, there is a need to develop innovative and novel frameworks that offer effective and efficient water leak detection mechanisms. To that end, this article discusses two different paradigms, namely sensor data fusion and federated learning, that have the potential to further enhance water leak detection methods. Therefore, this article first surveys the different water leak detection methods proposed in the literature along with their merits and limitations. It then describes the sensor data fusion and federated learning paradigms in more detail. Moreover, it presents different research opportunities in which these paradigms can be implemented to offer a more effective and computationally efficient water leak detection framework.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".