Long-Term Monitoring for Leaks in Water Distribution Networks Using Association Rules Mining
Bibliographic record
Abstract
Early detection of small and large leaks in water distribution pipes allows for proactive maintenance and corrective actions to take place in a timely manner, thus mitigating significant water loss and increasing the longevity of the network. Most of the acoustic leak detection methods today are geared toward inspections—focused on probing periodic short-term data acquired in the process of inspection—rather than dealing with large volumes of long-term data acquired from monitoring programs. The common challenge encountered in both the acoustic inspection methods and in long-term monitoring of acoustic signatures lies in delineating weak leak-induced signatures within the highly noisy and nonstationary acoustic environment typical of uncontrolled real-world operating water distribution systems. This paper focuses on addressing the problem of leak detection where long-term monitoring acoustic data is available to characterize the operating conditions, without relying on controlled experiments to acquire data or expert user knowledge. The key contribution of this paper is to present a new data-driven approach using association rules (ARs) to extract information from large volumes of monitored acoustic data which can enable identification of relatively small changes in the acoustic signatures due to leaks. ARs are employed to model and synthesize the information contained in long-term monitored acoustic data and associations between statistical features obtained from such measurements are identified and used to design a leak indicator that captures the deviation of leak-induced data from a reference leak-free model. It will be shown that the proposed indicator has a high detection rate, can detect relatively small leaks, and crucially, conducive to work in uncontrolled long-term monitoring situations.
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.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.005 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 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".