Ensemble model-based method for time series sensors’ data validation and imputation applied to a real waste water treatment plant

Intelligent Decision Support Systems (IDSSs) integrate different Artificial Intelligence (AI) techniques with the aim of taking or supporting human-like decisions. To this end, these techniques are based on the available data from the target process. This implies that invalid or missing data could trigger incorrect decisions and therefore, undesirable situations in the supervised process. This is even more important in environmental systems, which incorrect malfunction could jeopardise related ecosystems. In data-driven applications such as IDSS, data quality is a basal problem that should be addressed for the sake of the overall systems’ performance. In this paper, a data validation and imputation methodology for time-series is presented. This methodology is integrated in an IDSS software tool which generates suitable control set-points to control the process. The data validation and imputation approach presented here is focused on the imputation step, and it is based on an ensemble of different prediction models obtained for the sensors involved in the process. A Case-Based Reasoning (CBR) approach is used for data imputation, i.e., similar past situations to the current one can propose new values for the missing ones. The CBR model is complemented with other prediction models such as Auto Regressive (AR) models or Artificial Neural Network (ANN) models. Then, the different obtained predictions are ensembled to obtain a better prediction performance than the obtained by each individual prediction model separately. Furthermore, the use of a meta-prediction model, trained using the predictions of all individual models as inputs, is proposed and compared with other ensemble methods to validate its performance. Finally, this approach is illustrated in a real Waste Water Treatment Plant (WWTP) case study using one of the most relevant measures for the correct operation of the WWTPs IDSS, i.e., the ammonia sensor, and considering real faults, showing promising results with improved performance when using the ensemble approach presented here compared against the prediction obtained by each individual model separately.The authors acknowledge the partial support of this work by the Industrial Doctorate Programme (2017DI-006) and the Research Consolidated Groups/Centres Grant (2017 SGR 574) from the Catalan Agency of University and Research Grants Management (AGAUR), from Catalan Government.Peer ReviewedPostprint (published version

Forward checking in the primal and dual constraint graphs.

Constraint Satisfaction Problems (CSPs) have been a subject of research in Artificial Intelligence for many years. CSPs are a general way of describing problems that can be used to represent many different types of real-world problems, including scheduling, planning, timetabling, and other combinatorial problems. The primal and dual constraint graphs are two ways of representing a CSP. Some CSPs have features that can be exploited by algorithms trying to find solutions. In this work, results from solving CSPs using forward-checking algorithms that use the primal- and dual-graph representations will be presented, and regions where one representation performs better than the other will be identified. 1t will be shown that the dual representation performs better than the primal representation on CSPs with tight constraints.Dept. of Computer Science. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .P75. Source: Masters Abstracts International, Volume: 44-03, page: 1411. Thesis (M.Sc.)--University of Windsor (Canada), 2005

The Schulze Method of Voting

We propose a new single-winner election method ("Schulze method") and prove that it satisfies many academic criteria (e.g. monotonicity, reversal symmetry, resolvability, independence of clones, Condorcet criterion, k-consistency, polynomial runtime). We then generalize this method to proportional representation by the single transferable vote ("Schulze STV") and to methods to calculate a proportional ranking ("Schulze proportional ranking"). Furthermore, we propose a generalization of the Condorcet criterion to multi-winner elections. This paper contains a large number of examples to illustrate the proposed methods