Benchmarking machine learning algorithms for Non-Intrusive Water Monitoring

2020 ◽  
Author(s):  
Andrea Cominola ◽  
Marie-Philine Becker ◽  
Riccardo Taormina
Keyword(s):  
Machine Learning ◽  
Time Series ◽  
Water Use ◽  
Real World ◽  
State Of The Art ◽  
Demand Management ◽  
Machine Learning Algorithms ◽  
Urban Water ◽  
Real World Data ◽  
End Use

<p>As several cities all over the world face the exacerbating challenges posed by climate change, population growth, and urbanization, it becomes clear how increased water security and more resilient urban water systems can be achieved by optimizing the use of water resources and minimize losses and inefficient usage. In the literature, there is growing evidence about the potential of demand management programs to complement supply-side interventions and foster more efficient water use behaviors. A new boost to demand management is offered by the ongoing digitalization of the water utility sector, which facilitates accurate measuring and estimation of urban water demands down to the scale of individual end-uses of residential water consumers (e.g., showering, watering). This high-resolution data can play a pivotal role in supporting demand-side management programs, fostering more efficient and sustainable water uses, and prompting the detection of anomalous behaviors (e.g., leakages, faulty meters). The problem of deriving individual end-use consumption traces from the composite signal recorded by single-point meters installed at the inlet of each household has been studied for nearly 30 years in the electricity field (Non-Intrusive Load Monitoring). Conversely, the similar disaggregation problem in the water sector - here called Non-Intrusive Water Monitoring (NIWM) - is still a very open research challenge. Most of the state-of-the-art end-use disaggregation algorithms still need an intrusive calibration or time- consuming expert-based manual processing. Moreover, the limited availability of large-scale open datasets with end- use ground truth data has so far greatly limited the development and benchmarking of NIWM methods.</p><p>In this work, we comparatively test the suitability of different machine learning algorithms to perform NIWM. First, we formulate the NIWM problem both as a regression problem, where water consumption traces are processed as continuous time-series, and a classification problem, where individual water use events are associated to one or more end use labels. Second, a number of algorithms based on the last trends in Artificial Intelligence and Machine Learning are tested both on synthetic and real-world data, including state-of-the-art tree-based and Deep Learning methods. Synthetic water end-use time series generated with the STREaM stochastic simulation model are considered for algorithm testing, along with labelled real-world data from the Residential End Uses of Water, Version 2, database by the Water Research Foundation. Finally, the performance of the different NIWM algorithms is comparatively assessed with metrics that include (i) NIWM accuracy, (ii) computational cost, and (iii) amount of needed training data.</p>

scholarly journals Performance of Machine Learning Algorithms and Diversity in Data

2018 ◽  
Vol 210 ◽  
pp. 04019 ◽  
Author(s):  
Hyontai SUG
Keyword(s):  
Machine Learning ◽  
Neural Networks ◽  
Real World ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Training Data ◽  
Real World Data ◽  
Random Data ◽  
Data Set ◽  
World Data

Recent world events in go games between human and artificial intelligence called AlphaGo showed the big advancement in machine learning technologies. While AlphaGo was trained using real world data, AlphaGo Zero was trained using massive random data, and the fact that AlphaGo Zero won AlphaGo completely revealed that diversity and size in training data is important for better performance for the machine learning algorithms, especially in deep learning algorithms of neural networks. On the other hand, artificial neural networks and decision trees are widely accepted machine learning algorithms because of their robustness in errors and comprehensibility respectively. In this paper in order to prove that diversity and size in data are important factors for better performance of machine learning algorithms empirically, the two representative algorithms are used for experiment. A real world data set called breast tissue was chosen, because the data set consists of real numbers that is very good property for artificial random data generation. The result of the experiment proved the fact that the diversity and size of data are very important factors for better performance.

scholarly journals A survey on feature weighting based K-Means algorithms

2020 ◽  
Author(s):  
Renato Cordeiro de Amorim
Keyword(s):  
Machine Learning ◽  
Empirical Evidence ◽  
Real World ◽  
Clustering Algorithm ◽  
Machine Learning Algorithms ◽  
Feature Weighting ◽  
Future Research ◽  
Real World Data ◽  
Data Set ◽  
Partitional Clustering

In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting features in the data preprocessing phase. However, we maintain that even among relevant features there may be different degrees of relevance, and this should be taken into account during the clustering process. With over 50 years of history, K-Means is arguably the most popular partitional clustering algorithm there is. The first K-Means based clustering algorithm to compute feature weights was designed just over 30 years ago. Various such algorithms have been designed since but there has not been, to our knowledge, a survey integrating empirical evidence of cluster recovery ability, common flaws, and possible directions for future research. This paper elaborates on the concept of feature weighting and addresses these issues by critically analysing some of the most popular, or innovative, feature weighting mechanisms based in K-Means

scholarly journals Patient journey through cases of depression from claims database using machine learning algorithms

PLoS ONE ◽  
2021 ◽  
Vol 16 (2) ◽  
pp. e0247059
Author(s):  
Yoshitake Kitanishi ◽  
Masakazu Fujiwara ◽  
Bruce Binkowitz
Keyword(s):  
Machine Learning ◽  
Association Analysis ◽  
Real World ◽  
Machine Learning Algorithms ◽  
Topological Data Analysis ◽  
Real World Data ◽  
Patient Journey ◽  
World Data ◽  
Medicine Research

Health insurance and acute hospital-based claims have recently become available as real-world data after marketing in Japan and, thus, classification and prediction using the machine learning approach can be applied to them. However, the methodology used for the analysis of real-world data has been hitherto under debate and research on visualizing the patient journey is still inconclusive. So far, to classify diseases based on medical histories and patient demographic background and to predict the patient prognosis for each disease, the correlation structure of real-world data has been estimated by machine learning. Therefore, we applied association analysis to real-world data to consider a combination of disease events as the patient journey for depression diagnoses. However, association analysis makes it difficult to interpret multiple outcome measures simultaneously and comprehensively. To address this issue, we applied the Topological Data Analysis (TDA) Mapper to sequentially interpret multiple indices, thus obtaining a visual classification of the diseases commonly associated with depression. Under this approach, the visual and continuous classification of related diseases may contribute to precision medicine research and can help pharmaceutical companies provide appropriate personalized medical care.

scholarly journals Recurrent Adaptive Classifier Ensemble for Handling Recurring Concept Drifts

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Tinofirei Museba ◽  
Fulufhelo Nelwamondo ◽  
Khmaies Ouahada ◽  
Ayokunle Akinola
Keyword(s):  
Machine Learning ◽  
Real World ◽  
Concept Drift ◽  
Learning Algorithms ◽  
Learning Model ◽  
Machine Learning Algorithms ◽  
Classifier Ensemble ◽  
Series Data ◽  
Real World Data ◽  
World Data

For most real-world data streams, the concept about which data is obtained may shift from time to time, a phenomenon known as concept drift. For most real-world applications such as nonstationary time-series data, concept drift often occurs in a cyclic fashion, and previously seen concepts will reappear, which supports a unique kind of concept drift known as recurring concepts. A cyclically drifting concept exhibits a tendency to return to previously visited states. Existing machine learning algorithms handle recurring concepts by retraining a learning model if concept is detected, leading to the loss of information if the concept was well learned by the learning model, and the concept will recur again in the next learning phase. A common remedy for most machine learning algorithms is to retain and reuse previously learned models, but the process is time-consuming and computationally prohibitive in nonstationary environments to appropriately select any optimal ensemble classifier capable of accurately adapting to recurring concepts. To learn streaming data, fast and accurate machine learning algorithms are needed for time-dependent applications. Most of the existing algorithms designed to handle concept drift do not take into account the presence of recurring concept drift. To accurately and efficiently handle recurring concepts with minimum computational overheads, we propose a novel and evolving ensemble method called Recurrent Adaptive Classifier Ensemble (RACE). The algorithm preserves an archive of previously learned models that are diverse and always trains both new and existing classifiers. The empirical experiments conducted on synthetic and real-world data stream benchmarks show that RACE significantly adapts to recurring concepts more accurately than some state-of-the-art ensemble classifiers based on classifier reuse.

Deep Learning for text in limted data settings

2020 ◽  
Author(s):  
Pathikkumar Patel ◽  
Bhargav Lad ◽  
Jinan Fiaidhi
Keyword(s):  
Machine Learning ◽  
Time Series ◽  
Deep Learning ◽  
Sentiment Analysis ◽  
Transfer Learning ◽  
Text Classification ◽  
State Of The Art ◽  
Time Series Forecasting ◽  
Text Data ◽  
Performance Levels

During the last few years, RNN models have been extensively used and they have proven to be better for sequence and text data. RNNs have achieved state-of-the-art performance levels in several applications such as text classification, sequence to sequence modelling and time series forecasting. In this article we will review different Machine Learning and Deep Learning based approaches for text data and look at the results obtained from these methods. This work also explores the use of transfer learning in NLP and how it affects the performance of models on a specific application of sentiment analysis.

scholarly journals Predicting Future Occurrence of Acute Hypotensive Episodes Using Noninvasive and Invasive Features

2021 ◽  
Vol 186 (Supplement_1) ◽  
pp. 445-451
Author(s):  
Yifei Sun ◽  
Navid Rashedi ◽  
Vikrant Vaze ◽  
Parikshit Shah ◽  
Ryan Halter ◽  
...  
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Real World ◽  
Short Term Memory ◽  
Model Performance ◽  
Learning Technologies ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Continuous Map

ABSTRACT Introduction Early prediction of the acute hypotensive episode (AHE) in critically ill patients has the potential to improve outcomes. In this study, we apply different machine learning algorithms to the MIMIC III Physionet dataset, containing more than 60,000 real-world intensive care unit records, to test commonly used machine learning technologies and compare their performances. Materials and Methods Five classification methods including K-nearest neighbor, logistic regression, support vector machine, random forest, and a deep learning method called long short-term memory are applied to predict an AHE 30 minutes in advance. An analysis comparing model performance when including versus excluding invasive features was conducted. To further study the pattern of the underlying mean arterial pressure (MAP), we apply a regression method to predict the continuous MAP values using linear regression over the next 60 minutes. Results Support vector machine yields the best performance in terms of recall (84%). Including the invasive features in the classification improves the performance significantly with both recall and precision increasing by more than 20 percentage points. We were able to predict the MAP with a root mean square error (a frequently used measure of the differences between the predicted values and the observed values) of 10 mmHg 60 minutes in the future. After converting continuous MAP predictions into AHE binary predictions, we achieve a 91% recall and 68% precision. In addition to predicting AHE, the MAP predictions provide clinically useful information regarding the timing and severity of the AHE occurrence. Conclusion We were able to predict AHE with precision and recall above 80% 30 minutes in advance with the large real-world dataset. The prediction of regression model can provide a more fine-grained, interpretable signal to practitioners. Model performance is improved by the inclusion of invasive features in predicting AHE, when compared to predicting the AHE based on only the available, restricted set of noninvasive technologies. This demonstrates the importance of exploring more noninvasive technologies for AHE prediction.

scholarly journals Accelerating organic solar cell material's discovery: high-throughput screening and big data

2021 ◽  
Author(s):  
Xabier Rodríguez-Martínez ◽  
Enrique Pascual-San-José ◽  
Mariano Campoy-Quiles
Keyword(s):  
Machine Learning ◽  
Big Data ◽  
High Throughput ◽  
Organic Solar Cells ◽  
High Throughput Screening ◽  
Organic Solar Cell ◽  
State Of The Art ◽  
Review Article ◽  
Machine Learning Algorithms ◽  
Device Optimization

This review article presents the state-of-the-art in high-throughput computational and experimental screening routines with application in organic solar cells, including materials discovery, device optimization and machine-learning algorithms.

scholarly journals Automotive OEM Demand Forecasting: A Comparative Study of Forecasting Algorithms and Strategies

2021 ◽  
Vol 11 (15) ◽  
pp. 6787
Author(s):  
Jože M. Rožanec ◽  
Blaž Kažič ◽  
Maja Škrjanc ◽  
Blaž Fortuna ◽  
Dunja Mladenić
Keyword(s):  
Machine Learning ◽  
Automotive Industry ◽  
Demand Management ◽  
Demand Forecasting ◽  
Machine Learning Algorithms ◽  
Superior Performance ◽  
Forecast Errors ◽  
Manufacturing Companies ◽  
Case Scenario ◽  
Crucial Component

Demand forecasting is a crucial component of demand management, directly impacting manufacturing companies’ planning, revenues, and actors through the supply chain. We evaluate 21 baseline, statistical, and machine learning algorithms to forecast smooth and erratic demand on a real-world use case scenario. The products’ data were obtained from a European original equipment manufacturer targeting the global automotive industry market. Our research shows that global machine learning models achieve superior performance than local models. We show that forecast errors from global models can be constrained by pooling product data based on the past demand magnitude. We also propose a set of metrics and criteria for a comprehensive understanding of demand forecasting models’ performance.

scholarly journals Systematic literature review of machine learning methods used in the analysis of real-world data for patient-provider decision making

2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Alan Brnabic ◽  
Lisa M. Hess
Keyword(s):  
Machine Learning ◽  
Decision Making ◽  
Literature Review ◽  
Systematic Literature Review ◽  
Real World ◽  
Learning Algorithms ◽  
External Validation ◽  
Machine Learning Algorithms ◽  
Learning Methods ◽  
Machine Learning Methods

Abstract Background Machine learning is a broad term encompassing a number of methods that allow the investigator to learn from the data. These methods may permit large real-world databases to be more rapidly translated to applications to inform patient-provider decision making. Methods This systematic literature review was conducted to identify published observational research of employed machine learning to inform decision making at the patient-provider level. The search strategy was implemented and studies meeting eligibility criteria were evaluated by two independent reviewers. Relevant data related to study design, statistical methods and strengths and limitations were identified; study quality was assessed using a modified version of the Luo checklist. Results A total of 34 publications from January 2014 to September 2020 were identified and evaluated for this review. There were diverse methods, statistical packages and approaches used across identified studies. The most common methods included decision tree and random forest approaches. Most studies applied internal validation but only two conducted external validation. Most studies utilized one algorithm, and only eight studies applied multiple machine learning algorithms to the data. Seven items on the Luo checklist failed to be met by more than 50% of published studies. Conclusions A wide variety of approaches, algorithms, statistical software, and validation strategies were employed in the application of machine learning methods to inform patient-provider decision making. There is a need to ensure that multiple machine learning approaches are used, the model selection strategy is clearly defined, and both internal and external validation are necessary to be sure that decisions for patient care are being made with the highest quality evidence. Future work should routinely employ ensemble methods incorporating multiple machine learning algorithms.

scholarly journals Combining Outcome-Based and Preference-Based Matching: A Constrained Priority Mechanism

2021 ◽  
pp. 1-24
Author(s):  
Avidit Acharya ◽  
Kirk Bansak ◽  
Jens Hainmueller
Keyword(s):  
Machine Learning ◽  
Host Country ◽  
Real World ◽  
Test Scores ◽  
Standardized Test ◽  
Market Design ◽  
Standardized Test Scores ◽  
Real World Data ◽  
Refugee Families ◽  
Strategy Proof

Abstract We introduce a constrained priority mechanism that combines outcome-based matching from machine learning with preference-based allocation schemes common in market design. Using real-world data, we illustrate how our mechanism could be applied to the assignment of refugee families to host country locations, and kindergarteners to schools. Our mechanism allows a planner to first specify a threshold $\bar g$ for the minimum acceptable average outcome score that should be achieved by the assignment. In the refugee matching context, this score corresponds to the probability of employment, whereas in the student assignment context, it corresponds to standardized test scores. The mechanism is a priority mechanism that considers both outcomes and preferences by assigning agents (refugee families and students) based on their preferences, but subject to meeting the planner’s specified threshold. The mechanism is both strategy-proof and constrained efficient in that it always generates a matching that is not Pareto dominated by any other matching that respects the planner’s threshold.

Sign in / Sign up

Export Citation Format

Share Document