A survey of machine learning methods applied to anomaly detection on drinking-water quality data

Abstract: Traditional machine learning (ML) techniques such as support vector machine, logistic regression, and artificial neural network have been applied most frequently in water quality anomaly detection tasks. This paper presents a review of progress and advances made in detecting anomalies in water quality data using ML techniques. The review encompasses both traditional ML and deep learning (DL) approaches. Our findings indicate that: 1) Generally, DL approaches outperform traditional ML techniques in terms of feature learning accuracy and fewer false positive rates. However, is difficult to make a fair comparison between studies because of different datasets, models and parameters employed. 2) We notice that despite advances made and the advantages of the extreme learning machine (ELM), application of ELM is sparsely exploited in this domain. This study also proposes a hybrid DL-ELM framework as a possible solution that could be investigated further and used to detect anomalies in water quality data

A Wasserstein distance based multiobjective evolutionary algorithm for the risk aware optimization of sensor placement

Abstract In this paper we propose a new algorithm for the identification of optimal "sensing spots", within a network, for monitoring the spread of "effects" triggered by "events". This problem is referred to as "Optimal Sensor Placement" and many real-world problems fit into this general framework. In this paper sensor placement (SP) (i.e., location of sensors at some nodes) for the early detection of contaminants in water distribution networks (WDNs) will be used as a running example. Usually, we have to manage a trade-off between different objective functions, so that we are faced with a multi objective optimization problem. (MOP). The best trade-off between the objectives can be defined in terms of Pareto optimality. In this paper we model the sensor placement problem as a multi objective optimization problem with boolean decision variables and propose a Multi Objective Evolutionary Algorithm (MOEA) for approximating and analyzing the Pareto set. The evaluation of the objective functions requires the execution of a simulation model: to organize the simulation results in a computationally efficient way we propose a data structure collecting simulation outcomes for every SP which is particularly suitable for visualization of the dynamics of contaminant concentration and evolutionary optimization. This data structure enables the definition of information spaces, in which a candidate placement can be represented as a matrix or, in probabilistic terms as a histogram. The introduction of a distance between histograms, namely the Wasserstein (WST) distance, enables to derive new genetic operators, indicators of the quality of the Pareto set and criteria to choose among the Pareto solutions. The new algorithm MOEA/WST has been tested on two benchmark water distribution networks and a real world network. Preliminary results are compared with NSGA-II and show a better performance, in terms of hypervolume and coverage, in particular for relatively large networks and low generation counts

Water Contaminants Detection Using Sensor Placement Approach in Smart Water Networks

Incidents of water pollution or contamination have occurred repeatedly in recent years, causing significant disasters and negative health impacts. Water quality sensors need to be installed in the water distribution system (WDS) to allow real-time water contamination detection to reduce the risk of water contamination. Deploying sensors in WDS is essential to monitor and detect any pollution incident at the appropriate time. However, it is impossible to place sensors on all nodes of the network due to the relatively large structure of WDS and the high cost of water quality sensors. For that, it is necessary to reduce the cost of deployment and guarantee the reliability of the sensing, such as detection time and coverage of the whole water network. In this paper, a dynamic approach of sensor placement that uses an Evolutionary Algorithm (EA) is proposed and implemented. The proposed method generates a multiple set of water contamination scenarios in several locations selected randomly in the WDS. Each contamination scenario spreads in the water networks for several hours, and then the proposed approach simulates the various effect of each contamination scenario on the water networks. On the other hand, the multiple objectives of the sensor placement optimization problem, which aim to find the optimal locations of the deployed sensors, have been formulated. The sensor placement optimization solver, which uses the EA, is operated to find the optimal sensor placements. The effectiveness of the proposed method has been evaluated using two different case studies on the example of water networks: Battle of the Water Sensor Network (BWSN) and another real case study from Madrid (Spain). The results have shown the capability of the proposed method to adapt the location of the sensors based on the numbers and the locations of contaminant sources. Moreover, the results also have demonstrated the ability of the proposed approach for maximising the coverage of deployed sensors and reducing the time to detect all the water contaminants using a few numbers of water quality sensor

Greedy algorithms for sensor location in sewer systems

Wastewater quality monitoring is receiving growing interest with the necessity of developing new strategies for controlling accidental and intentional illicit intrusions. In designing a monitoring network, a crucial aspect is represented by the sensors’ location. In this study, a methodology for the optimal placement of wastewater monitoring sensors in sewer systems is presented. The sensor location is formulated as an optimization problem solved using greedy algorithms (GRs). The StormWater Management Model (SWMM) was used to perform hydraulic and water-quality simulations. Six different procedures characterized by different fitness functions are presented and compared. The performances of the procedures are tested on a real sewer system, demonstrating the suitability of GRs for the sensor-placement problem. The results show a robustness of the methodology with respect to the detection concentration parameter, and they suggest that procedures with multiple objectives into a single fitness function give better results. A further comparison is performed using previously developed multi-objective procedures with multiple fitness functions solved using a genetic algorithm (GA), indicating better performances of the GR. The existing monitoring network, realized without the application of any sensor design, is always suboptimal

Fibers and fabrics for chemical and biological sensing

Wearable sensors can be used to monitor many interesting parameters about the wearer’s physiology and environment, with important applications in personal health and well-being, sports performance and personal safety. Wearable chemical sensors can monitor the status of the wearer by accessing body fluids, such as sweat, in an unobtrusive manner. They can also be used to protect the wearer from hazards in the environment by sampling potentially harmful gas emissions such as carbon monoxide. Integrating chemical sensors into textile structures is a challenging and complex task. Issues which must be considered include sample collection, calibration, waste handling, fouling and reliability. Sensors must also be durable and comfortable to wear. Here we present examples of wearable chemical sensors that monitor the person and also their environment. We also discuss the issues involved in developing wearable chemical sensors and strategies for sensor design and textile integration

Optimal Placement of Water Quality Monitoring Stations in Sewer Systems: An Information Theory Approach

A core problem associated with the water quality monitoring in the sewer system is the optimal placement of a limited number of monitoring sites. A methodology is provided for optimally design water quality monitoring stations in sewer networks. The methodology is based on information theory, formulated as a multi-objective optimization problem and solved using NSGA-II. Computer code is written to estimate two entropy quantities, namely Joint Entropy, a measure of information content, and Total Correlation, a measure of redundancy, which are maximized and minimized, respectively. The test on a real sewer network suggests the effectiveness of the proposed methodology

Optimal and Objective Placement of Sensors in Water Distribution Systems Using Information Theory

Optimization-based deployment of contamination warning system in water distribution systems has been widely used in the literature, due to their superior performance compared to rule- and opinion-based approaches. However, optimization techniques impose an excessive computational burden, which in turn is compensated for by shrinking the problem’s decision space and/or using faster optimization algorithms with less accuracy. This imposes subjectivity in interpretation of the system and associated risks, and undermines model’s accuracy by not exploring the entire feasible space. We propose a framework that uses information theoretic techniques, including value of information and transinformation entropy, for optimal sensor placement. This can be used either as pre-selection, i.e. pinpointing best potential locations of sensors to be in turn used in optimization framework, or ultimate selection, i.e. single-handedly selecting sensor locations from the feasible space. The proposed framework is then applied to Lamerd water distribution system, in Fars province, Iran, and the results are compared to the suggested potential locations of sensors in previous studies and results of TEVA-SPOT model. The proposed information theoretic scheme enhances the decision space, provides more accurate results, significantly reduces the computational burden, and warrants objective selection of sensor placement