Analysis of Variance Combined with Optimized Gradient Boosting Machines for Enhanced Load Recognition in Home Energy Management Systems.

Load recognition remains not comprehensively explored in Home Energy Management Systems (HEMSs). There are gaps in current approaches to load recognition, such as enhancing appliance identification and increasing the overall performance of the load-recognition system through more robust models. To address this issue, we propose a novel approach based on the Analysis of Variance (ANOVA) F-test combined with SelectKBest and gradient-boosting machines (GBMs) for load recognition. The proposed approach improves the feature selection and consequently aids inter-class separability. Further, we optimized GBM models, such as the histogram-based gradient-boosting machine (HistGBM), light gradient-boosting machine (LightGBM), and XGBoost (extreme gradient boosting), to create a more reliable load-recognition system. Our findings reveal that the ANOVA-GBM approach achieves greater efficiency in training time, even when compared to Principal Component Analysis (PCA) and a higher number of features. ANOVA-XGBoost is approximately 4.31 times faster than PCA-XGBoost, ANOVA-LightGBM is about 5.15 times faster than PCA-LightGBM, and ANOVA-HistGBM is 2.27 times faster than PCA-HistGBM. The general performance results expose the impact on the overall performance of the load-recognition system. Some of the key results show that the ANOVA-LightGBM pair reached 96.42% accuracy, 96.27% F1, and a Kappa index of 0.9404; the ANOVA-HistGBM combination achieved 96.64% accuracy, 96.48% F1, and a Kappa index of 0.9434; and the ANOVA-XGBoost pair attained 96.75% accuracy, 96.64% F1, and a Kappa index of 0.9452; such findings overcome rival methods from the literature. In addition, the accuracy gain of the proposed approach is prominent when compared straight to its competitors. The higher accuracy gains were 13.09, 13.31, and 13.42 percentage points (pp) for the pairs ANOVA-LightGBM, ANOVA-HistGBM, and ANOVA-XGBoost, respectively. These significant improvements highlight the effectiveness and refinement of the proposed approach.

Load Recognition in Home Energy Management Systems Based on Neighborhood Components Analysis and Regularized Extreme Learning Machine.

Efficient energy management in residential environments is a constant challenge, in which Home Energy Management Systems (HEMS) play an essential role in optimizing consumption. Load recognition allows the identification of active appliances, providing robustness to the HEMS. The precise identification of household appliances is an area not completely explored. Gaps like improving classification performance through techniques dedicated to separability between classes and models that achieve enhanced reliability remain open. This work improves several aspects of load recognition in HEMS applications. In this research, we adopt Neighborhood Component Analysis (NCA) to extract relevant characteristics from the data, seeking the separability between classes. We also employ the Regularized Extreme Learning Machine (RELM) to identify household appliances. This pioneering approach achieves performance improvements, presenting higher accuracy and weighted F1-Score values-97.24% and 97.14%, respectively-surpassing state-of-the-art methods and enhanced reliability according to the Kappa index, i.e., 0.9388, outperforming competing classifiers. Such evidence highlights the promising potential of Machine Learning (ML) techniques, specifically NCA and RELM, to contribute to load recognition and energy management in residential environments.

An Interpretable Digital Twin for Self-Aware Industrial Machines.

This paper presents a proposed three-step methodology designed to enhance the performance and efficiency of industrial systems by integrating Digital Twins with particle swarm optimization (PSO) algorithms while prioritizing interpretability. Digital Twins are becoming increasingly prevalent due to their capability to offer a comprehensive virtual representation of physical systems, thus facilitating detailed simulations and optimizations. Concurrently, PSO has demonstrated its effectiveness for real-time parameter estimation, especially in identifying both standard and unknown components that influence the dynamics of a system. Our methodology, as exemplified through DC Motor and Hydraulic Actuator simulations, underscores the potential of Digital Twins to augment the self-awareness of industrial machines. The results indicate that our approach can proficiently optimize system parameters in real-time and unveil previously unknown components, thereby enhancing the adaptive capacities of the Digital Twin. While the reliance on accurate data to develop Digital Twin models is a notable consideration, the proposed methodology serves as a promising framework for advancing the efficiency of industrial applications. It further extends its relevance to fault detection and system control. Central to our approach is the emphasis on interpretability, ensuring a more transparent understanding and effective usability of such systems.

PALLAS: Penalized mAximum LikeLihood and pArticle Swarms for Inference of Gene Regulatory Networks From Time Series Data.

We present PALLAS, a practical method for gene regulatory network (GRN) inference from time series data, which employs penalized maximum likelihood and particle swarms for optimization. PALLAS is based on the Partially-Observable Boolean Dynamical System (POBDS) model and thus does not require ad-hoc binarization of the data. The penalty in the likelihood is a LASSO regularization term, which encourages the resulting network to be sparse. PALLAS is able to scale to networks of realistic size under no prior knowledge, by virtue of a novel continuous-discrete Fish School Search particle swarm algorithm for efficient simultaneous maximization of the penalized likelihood over the discrete space of networks and the continuous space of observational parameters. The performance of PALLAS is demonstrated by a comprehensive set of experiments using synthetic data generated from real and artificial networks, as well as real time series microarray and RNA-seq data, where it is compared to several other well-known methods for gene regulatory network inference. The results show that PALLAS can infer GRNs more accurately than other methods, while being capable of working directly on gene expression data, without need of ad-hoc binarization. PALLAS is a fully-fledged program, written in python, and available on GitHub (https://github.com/yukuntan92/PALLAS).

Severe Dengue Prognosis Using Human Genome Data and Machine Learning.

Dengue has become one of the most important worldwide arthropod-borne diseases. Dengue phenotypes are based on laboratorial and clinical exams, which are known to be inaccurate. OBJECTIVE: We present a machine learning approach for the prediction of dengue fever severity based solely on human genome data. METHODS: One hundred and two Brazilian dengue patients and controls were genotyped for 322 innate immunity single nucleotide polymorphisms (SNPs). Our model uses a support vector machine algorithm to find the optimal loci classification subset and then an artificial neural network (ANN) is used to classify patients into dengue fever or severe dengue. RESULTS: The ANN trained on 13 key immune SNPs selected under dominant or recessive models produced median values of accuracy greater than 86%, and sensitivity and specificity over 98% and 51%, respectively. CONCLUSION: The proposed classification method, using only genome markers, can be used to identify individuals at high risk for developing the severe dengue phenotype even in uninfected conditions. SIGNIFICANCE: Our results suggest that the genetic context is a key element in phenotype definition in dengue. The methodology proposed here is extendable to other Mendelian based and genetically influenced diseases.