Suitable Algorithm Research Articles

Pioneering diabetes screening tool: machine learning driven optical vascular signal analysis

The escalating prevalence of diabetes mellitus underscores the critical need for non-invasive screening tools capable of early disease detection. Present diagnostic techniques depend on invasive procedures, which highlights the need for advancement of non-invasive alternatives for initial disease detection. Machine learning in integration with the optical sensing technology can effectively analyze the signal patterns associated with diabetes. The objective of this research is to develop and evaluate a non-invasive optical-based method combined with machine learning algorithms for the classification of individuals into normal, prediabetic, and diabetic categories. A novel device was engineered to capture real-time optical vascular signals from participants representing the three glycemic states. The signals were then subjected to quality assessment and preprocessing to ensure data reliability. Subsequently, feature extraction was performed using time-domain analysis and wavelet scattering techniques to derive meaningful characteristics from the optical signals. The extracted features were subsequently employed to train and validate a suite of machine learning algorithms. An ensemble bagged trees classifier with wavelet scattering features and random forest classifier with time-domain features demonstrated superior performance, achieving an overall accuracy of 86.6% and 80.0% in differentiating between normal, prediabetic, and diabetic individuals based on the optical vascular signals. The proposed non-invasive optical-based approach, coupled with advanced machine learning techniques, holds promise as a potential screening tool for diabetes mellitus. The classification accuracy achieved in this study warrants further investigation and validation in larger and more diverse populations.

The Calibration Conundrum

Even after solving calibration issues like non-convexity, a suitable minimization algorithm is needed, raising questions about the algorithms we hope to lead us to the promised land: the optimal parameter set of our chosen model.

Empowering Fuel Cell Electric Vehicles Towards Sustainable Transportation: An Analytical Assessment, Emerging Energy Management, Key Issues, and Future Research Opportunities

Fuel cell electric vehicles (FCEVs) have received significant attention in recent times due to various advantageous features, such as high energy efficiency, zero emissions, and extended driving range. However, FCEVs have some drawbacks, including high production costs; limited hydrogen refueling infrastructure; and the complexity of converters, controllers, and method execution. To address these challenges, smart energy management involving appropriate converters, controllers, intelligent algorithms, and optimizations is essential for enhancing the effectiveness of FCEVs towards sustainable transportation. Therefore, this paper presents emerging energy management strategies for FCEVs to improve energy efficiency, system reliability, and overall performance. In this context, a comprehensive analytical assessment is conducted to examine several factors, including research trends, types of publications, citation analysis, keyword occurrences, collaborations, influential authors, and the countries conducting research in this area. Moreover, emerging energy management schemes are investigated, with a focus on intelligent algorithms, optimization techniques, and control strategies, highlighting contributions, key findings, issues, and research gaps. Furthermore, the state-of-the-art research domains of FCEVs are thoroughly discussed in order to explore various research domains, relevant outcomes, and existing challenges. Additionally, this paper addresses open issues and challenges and offers valuable future research opportunities for advancing FCEVs, emphasizing the importance of suitable algorithms, controllers, and optimization techniques to enhance their performance. The outcomes and key findings of this review will be helpful for researchers and automotive engineers in developing advanced methods, control schemes, and optimization strategies for FCEVs towards greener transportation.

Automatic damage detection and segmentation using deep learning algorithms in reinforced concrete structure inspections

AbstractTraditional methods of detecting concrete damage, such as manual inspection, are typically slow, labor‐intensive, and subjective. Integrating deep learning algorithms has automated this process, representing a significant advance in building damage inspection. Semantic segmentation, a technique within deep learning, is increasingly recognized for its capability to identify the location and shape of concrete damage accurately. Unlike basic deep learning approaches like classification and object detection, semantic segmentation not only recognizes damage but also delineates its boundaries, and has great potential in facilitating dimension measurement. However, multi‐level, high‐precision detection for various structural damage assessments remains an area requiring further research. This study created a database of reinforced concrete surfaces with pixel‐level, multi‐category semantic segmentation annotations for various levels of component damage, including cracks and spalling of concrete, exposure, buckling, fracture of reinforcing bars, etc. The performance of advanced deep learning segmentation algorithms, including U‐Net, DeepLab, K‐Net, and FastSCNN, was consequently trained and evaluated in detecting various types of concrete damage. All models show good accuracy of more than 98%, but lower F1 scores around 70%. U‐Net and K‐Net demonstrate relatively stable performance, indicating a certain degree of consistency and a high‐performance peak. In contrast, DeepLabv3's F1 score fluctuates significantly, suggesting the model may suffer from overfitting or other stability issues during training, resulting in a relatively low average performance. FastSCNN exhibits the highest potential, achieving the highest F1 score. In addition, this study also tested the performance of each model on new damage images and explored the impact of the dataset proportion ratio (training set vs. validation set), contributing to providing insights into each algorithm's suitability for various inspection scenarios. Finally, perspectives on current challenges and future directions in the field have also been given.

Approximate and Exact Optimization Algorithms for the Beltway and Turnpike Problems with Duplicated, Missing, Partially Labeled, and Uncertain Measurements.

The Turnpike problem aims to reconstruct a set of one-dimensional points from their unordered pairwise distances. Turnpike arises in biological applications such as molecular structure determination, genomic sequencing, tandem mass spectrometry, and molecular error-correcting codes. Under noisy observation of the distances, the Turnpike problem is NP-hard and can take exponential time and space to solve when using traditional algorithms. To address this, we reframe the noisy Turnpike problem through the lens of optimization, seeking to simultaneously find the unknown point set and a permutation that maximizes similarity to the input distances. Our core contribution is a suite of algorithms that robustly solve this new objective. This includes a bilevel optimization framework that can efficiently solve Turnpike instances with up to 100,000 points. We show that this framework can be extended to scenarios with domain-specific constraints that include duplicated, missing, and partially labeled distances. Using these, we also extend our algorithms to work for points distributed on a circle (the Beltway problem). For small-scale applications that require global optimality, we formulate an integer linear program (ILP) that (i) accepts an objective from a generic family of convex functions and (ii) uses an extended formulation to reduce the number of binary variables. On synthetic and real partial digest data, our bilevel algorithms achieved state-of-the-art scalability across challenging scenarios with performance that matches or exceeds competing baselines. On small-scale instances, our ILP efficiently recovered ground-truth assignments and produced reconstructions that match or exceed our alternating algorithms. Our implementations are available at https://github.com/Kingsford-Group/turnpikesolvermm.

A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level

For more than two decades, pairings have been a fundamental tool for designing elegant cryptosystems, varying from digital signature schemes to more complex privacy-preserving constructions. However, the advancement of quantum computing threatens to undermine public-key cryptography. Concretely, it is widely accepted that a future large-scale quantum computer would be capable to break any public-key cryptosystem used today, rendering today's public-key cryptography obsolete and mandating the transition to quantum-safe cryptographic solutions. This necessity is enforced by numerous recognized government bodies around the world, including NIST which initiated the first open competition in standardizing post-quantum (PQ) cryptographic schemes, focusing primarily on digital signatures and key encapsulation/public-key encryption schemes. Despite the current efforts in standardizing PQ primitives, the landscape of complex, privacy-preserving cryptographic protocols, e.g., zkSNARKs/zkSTARKs, is at an early stage. Existing solutions suffer from various disadvantages in terms of efficiency and compactness and in addition, they need to undergo the required scrutiny to gain the necessary trust in the academic and industrial domains. Therefore, it is believed that the migration to purely quantum-safe cryptography would require an intermediate step where current classically secure protocols and quantum-safe solutions will co-exist. This is enforced by the report of the Commercial National Security Algorithm Suite version 2.0, mandating transition to quantum-safe cryptographic algorithms by 2033 and suggesting to incorporate ECC at 192-bit security in the meantime. To this end, the present paper aims at providing a comprehensive study on pairings at 192-bit security level. We start with an exhaustive review in the literature to search for all possible recommendations of such pairing constructions, from which we extract the most promising candidates in terms of efficiency and security, with respect to the advanced Special TNFS attacks. Our analysis is focused, not only on the pairing computation itself, but on additional operations that are relevant in pairing-based applications, such as hashing to pairing groups, cofactor clearing and subgroup membership testing. We implement all functionalities of the most promising candidates within the RELIC cryptographic toolkit in order to identify the most efficient pairing implementation at 192-bit security and provide extensive experimental results.

The ECP ALPINE project: In situ and post hoc visualization infrastructure and analysis capabilities for exascale

A significant challenge on an exascale computer is the speed at which we compute results exceeds by many orders of magnitude the speed at which we save these results. Therefore the Exascale Computing Project (ECP) ALPINE project focuses on providing exascale-ready visualization solutions including in situ processing. In situ visualization and analysis runs as the simulation is run, on simulations results are they are generated avoiding the need to save entire simulations to storage for later analysis. The ALPINE project made post hoc visualization tools, ParaView and VisIt, exascale ready and developed in situ algorithms and infrastructures. The suite of ALPINE algorithms developed under ECP includes novel approaches to enable automated data analysis and visualization to focus on the most important aspects of the simulation. Many of the algorithms also provide data reduction benefits to meet the I/O challenges at exascale. ALPINE developed a new lightweight in situ infrastructure, Ascent.

Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm

The ant colony optimization (ACO) algorithm is a metaheuristic initially designed to solve the travelling salesman problem (TSP). The design of experiments, finding the suitable ACO algorithm configuration, and calibrating the adaptive control parameters are exhaustive and time-consuming exercises, especially for TSPs where the number of cities can exceed 1000. This paper presents an evidence framework driven control parameter optimisation (EFCPO) algorithm for an ACO algorithm solving TSPs. EFCPO performs auto-tuning of the adaptive control parameters and makes recommendations about the ACO algorithms that are best suited for the TSPs in question using the log evidence. In addition, with this ability, the algorithm can take a solution provided by an ACO algorithm and improve the results. The EFCPO accomplishes this over a number of cycles through auto-tuning of the control parameters and re-running the ACO until the process is completed. The capabilities of EFCPO are compared to another configuration tool, irace, using benchmark ACO algorithms to test the efficiency of the framework. The benchmark algorithms make use of a local search strategy to solve TSPs. The results show that ACO algorithms are able to find new and improved solution tours within reasonable times. The improvements are also significant. In addition, ACO algorithms that are best suited for the TSP in question are preferred, making the EFCPO an effective tool for real-time configuration of ACO algorithms for solving TSPs .

Temperature-dependent mechanical properties and crystal plasticity parameters for additively manufactured Haynes-214 alloy: Experiments and numerical modeling

Our experimental mechanical testing data demonstrated that the additively manufactured (AM) laser powder bed fusion (L-PBF) Haynes-214 alloy exhibits non-linear mechanical properties as the temperature rises from ambient to 870 °C. To gain a deeper insight into the microstructure–property linkages under thermomechanical loading, it is essential to use crystal plasticity (CP) simulations. This approach can reduce the need to conduct expensive high-temperature experimental mechanical testing and account for crystallographic texture and grain morphology effects, which are known to be important in many AM processed materials. However, calibrating a CP model is time-consuming because individual simulations are computationally expensive and hundreds (or more) of iterations over parameter sets may be required. To address this issue, we have designed a machine learning - differential evolution (ML-DE) CP framework that can accurately interpolate the tensile properties of AM L-PBF Haynes-214 alloy across a wide temperature range from ambient to 870 °C, with minimal reliance on experimental data. The framework uses electron backscatter diffraction (EBSD) measurements to generate statistically equivalent microstructural volume elements to serve as inputs to the CP modeling framework. Stress–strain curves were generated from 1000 CP simulations, which serve as the training data set for the three ML regression algorithms explored: linear, extra-trees, and multi-layer perceptron. These three regression models were independently evaluated to compare their efficiency and identify the most suitable algorithm for the given problem. Results revealed that the extra-trees ML regressor outperforms the other models in both qualitative and quantitative aspects with an R2 of 0.98. Subsequently, the differential evolution optimization approach is employed to calibrate the ML-based CP material parameters with experimental results obtained at various temperatures. Finally, temperature-dependent CP material parameters are formulated. The effectiveness and efficiency of the designed framework are validated through comparison with experimental results, demonstrating a high degree of agreement. These calibrated parametric constitutive equations enable further use of the CP model to study the deformation behavior of this alloy under a wide range of thermo-mechanical loading and service conditions.

Increasing Parallelism in Forward-backward Distributed Algorithm for Finding Strongly Connected Components of Directed Graphs

The paper proposes a modification of the existing distributed forward-backward algorithm for finding strongly connected components in directed graphs. The modification aims at improving the parallelism of the algorithm by increasing the branching factor while dividing the workload. Instead of randomly picking the pivot vertex, a heuristic technique is used which allows more sub-tasks to be generated, on average, for the subsequent step of the algorithm. The work describes suitable algorithm modifications and presents empirical results, proving suitability of the approach in question.

A Space of Apt Product Designs Based on Market Information

This paper describes procedures that can be adopted during product development, so that there is a higher chance that new products are properly designed before being placed on the market. To implement the suggested procedures, market data are first obtained, then processed in a specified way for the new products to reflect relevant market information. This means putting into use suitable data-processing algorithms and information technologies, based on the type of collected information. The text deals with two information scenarios in this regard, the first assuming that not much is known about customers’ desires and the second working with larger amounts of more specific customer data. While the former requires a more sophisticated approach to product design, theoretically speaking, the latter is simpler to handle from the theoretical point of view, but potentially less so from a practical perspective, given the amounts of data. These theoretical and practical problems are discussed in what follows, and their possible solutions are presented.

A review of explainable AI in medical imaging: implications and applications

ABSTRACT Deep learning approaches have attained remarkable success across various artificial intelligence applications, spanning healthcare, finance, and autonomous vehicles, profoundly impacting human existence. However, their black-box nature, lack of transparency, and inability to elucidate conclusions have hindered their adoption in high-risk applications. Explainable Artificial Intelligence (XAI) encompasses a suite of tools, approaches, and algorithms aimed at furnishing highly accurate explanations while preserving robust accuracy. This research paper investigates the intricate and evolving domain of Explainable Artificial Intelligence (XAI), particularly its implications in healthcare, with the objective of fostering trust in AI utilization within this domain. It encompasses a spectrum of topics, including a compendium of tasks XAI should fulfil in medical imaging, an examination of current methodologies for yielding transparent and understandable outcomes in medical imaging, criteria for assessing AI system explainability, and recommendations for integrating XAI into medical imaging practices. This review facilitates the selection of suitable and efficient XAI techniques for medical imaging while aiding developers in grasping the fundamentals of these methodologies.

An optimized BERT fine-tuned model using an artificial bee colony algorithm for automatic essay score prediction

Background The Automatic Essay Score (AES) prediction system is essential in education applications. The AES system uses various textural and grammatical features to investigate the exact score value for AES. The derived features are processed by various linear regressions and classifiers that require the learning pattern to improve the overall score. Issues Moreover, the classifiers face catastrophic forgetting problems, which maximizes computation complexity and reduce prediction accuracy. The forgetting problem can be resolved using the freezing mechanism; however, the mechanism can cause prediction errors. Method Therefore, this research proposes an optimized Bi-directional Encoder Representation from Transformation (BERT) by applying the Artificial Bee Colony algorithm (ABC) and Fine-Tuned Model (ABC-BERT-FTM) to solve the forgetting problem, which leads to higher prediction accuracy. Therefore, the ABC algorithm reduces the forgetting problem by selecting optimized network parameters. Results Two AES datasets, ASAP and ETS, were used to evaluate the performance of the optimized BERT of the AES system, and a high accuracy of up to 98.5% was achieved. Thus, based on the result, we can conclude that optimizing the BERT with a suitable meta-heuristic algorithm, such as the ABC algorithm, can resolve the forgetting problem, eventually increasing the AES system’s prediction accuracy.

On the adaptive solution of phase‐field problems with A‐stable explicit last‐stage diagonally implicit Runge–Kutta (ELDIRK) methods

AbstractRunge–Kutta algorithms with adaptive step size control provide reliable tools for the solution of initial value problems with diagonally implicit Runge‐Kutta (DIRK) methods as the most common approach. In this contribution, the new low‐order explicit last‐stage diagonally implicit Runge–Kutta (ELDIRK) methods are investigated, combining implicit schemes with an additional explicit evaluation as an explicit last stage. This results in Butcher tableaus with two solutions of different convergence orders suitable for embedded methods, where the higher‐order solution is achieved by additional explicit evaluations. Thus, the iterative solution of non‐linear systems is omitted for the additional stage, presenting a major reduction in computational cost for the determination of a local error estimate. The key contribution is the application of the novel Butcher tableaux to phase‐field problems, solved with the finite‐element method, leading to substantial numerical investigations with an efficient approach for DIRK schemes. The most important aspects are the investigations of stability properties which lead to the novel class of A‐stable ELDIRK methods. In accordance, the study of the convergence orders is presented. A local error estimator is presented, such that adaptive step size control for the new low‐order embedded schemes based on an empirical approach for error estimation is achieved. A suitable parallel algorithm is presented with conclusive two‐dimensional phase‐field simulations based on a Kobayashi‐Warren‐Carter model. The higher‐order convergence suggested by the novel schemes is confirmed, and their effective results are demonstrated, resulting in a valuable semi‐explicit addition to the family of Runge–Kutta time integration schemes.

Analiza pełzania w przetwornikach momentu siły dla turbin wiatrowych

A crucial aspect to consider when assessing the effectiveness of wind turbines is the phenomenon of torque creep, both under load and without load. This phenomenon significantly affects the proper functioning of torque transducers, thus necessitating the utilization of suitable algorithms for analysing measurement data. The least squares method is well-suited for this type of analysis. Linear regression was employed to study the creep trend, while a third-degree non-linear polynomial curve enabled a more precise visualization of creep, yielding valuable insights.

Identification of Disulfidptosis-Related Genes in Ischemic Stroke by Combining Single-Cell Sequencing, Machine Learning Algorithms, and In Vitro Experiments

BackgroundIschemic stroke (IS) is a severe neurological disorder with a pathogenesis that remains incompletely understood. Recently, a novel form of cell death known as disulfidptosis has garnered significant attention in the field of ischemic stroke research. This study aims to investigate the mechanistic roles of disulfidptosis-related genes (DRGs) in the context of IS and to examine their correlation with immunopathological features.MethodsTo enhance our understanding of the mechanistic underpinnings of disulfidptosis in IS, we initially retrieved the expression profile of peripheral blood from human IS patients from the GEO database. We then utilized a suite of machine learning algorithms, including LASSO, random forest, and SVM-RFE, to identify and validate pivotal genes. Furthermore, we developed a predictive nomogram model, integrating multifactorial logistic regression analysis and calibration curves, to evaluate the risk of IS. For the analysis of single-cell sequencing data, we employed a range of analytical tools, such as "Monocle" and "CellChat," to assess the status of immune cell infiltration and to characterize intercellular communication networks. Additionally, we utilized an oxygen–glucose deprivation (OGD) model to investigate the effects of SLC7A11 overexpression on microglial polarization.ResultsThis study successfully identified key genes associated with disulfidptosis and developed a reliable nomogram model using machine learning algorithms to predict the risk of ischemic stroke. Examination of single-cell sequencing data showed a robust correlation between disulfidptosis levels and the infiltration of immune cells. Furthermore, "CellChat" analysis elucidated the intricate characteristics of intercellular communication networks. Notably, the TNF signaling pathway was found to be intimately linked with the disulfidptosis signature in ischemic stroke. In an intriguing finding, the OGD model demonstrated that SLC7A11 expression suppresses M1 polarization while promoting M2 polarization in microglia.ConclusionThe significance of our findings lies in their potential to shed light on the pathogenesis of ischemic stroke, particularly by underscoring the pivotal role of disulfidptosis-related genes (DRGs). These insights could pave the way for novel therapeutic strategies targeting DRGs to mitigate the impact of ischemic stroke.

A Machine Learning Framework for Condition-Based Maintenance of Marine Diesel Engines: A Case Study

The development of artificial intelligence-based tools is having a big impact on industry. In this context, the maintenance operations of important assets and industrial resources are changing, both from a theoretical and a practical perspective. Namely, conventional maintenance reacts to faults and breakdowns as they occur or schedules the necessary inspections of systems and their parts at fixed times by using statistics on component failures, but this can be improved by a predictive maintenance based on the real component’s health status, which is inspected by appropriate sensors. In this way, maintenance time and costs are saved. Improvements can be achieved even in the marine industry, in which complex ship propulsion systems are produced for operation in many different scenarios. In more detail, data-driven models, through machine learning (ML) algorithms, generate the expected values of monitored variables for comparison with real measurements on the asset, for a diagnosis based on the difference between expectations and observations. The first step towards realization of predictive maintenance is choosing the ML algorithm. This selection is often not the consequence of an in-depth analysis of the different algorithms available in the literature. For that reason, here the authors propose a framework to support an initial implementation stage of predictive maintenance based on a benchmarking of the most suitable ML algorithms. The comparison is tested to predict failures of the oil circuit in a diesel marine engine as a case study. The algorithms are compared by considering not only the mean squared error between the algorithm predictions and the data, but also the response time, which is a crucial variable for maintenance. The results clearly indicate the framework well supports predictive maintenance and the prediction error and running time are appropriate variables to choose the most suitable ML algorithm for prediction. Moreover, the proposed framework can be used to test different algorithms, on the basis of more performance indexes, and to apply predictive maintenance to other engine components.

Progress of machine learning-based biosensors for the monitoring of food safety: A review

Rapid urbanization and growing food demand caused people to be concerned about food safety. Biosensors have gained considerable attention for assessing food safety due to selectivity, and sensitivity but poor stability inherently limits their application. The emergence of machine learning (ML) has enhanced the efficiency of different sensors for food safety assessment. The ML combined with various noninvasive biosensors has been implemented efficiently to monitor food safety by considering the stability of bio-recognition molecules. This review comprehensively summarizes the application of ML-powered biosensors to investigate food safety. Initially, different detector-based biosensors using biological molecules with their advantages and disadvantages and biosensor-related various ML algorithms for food safety monitoring have been discussed. Next, the application of ML-powered biosensors to detect antibiotics, foodborne microorganisms, mycotoxins, pesticides, heavy metals, anions, and persistent organic pollutants has been highlighted for the last five years. The challenges and prospects have also been deliberated. This review provides a new prospect in developing various biosensors for multi-food contaminants powered by suitable ML algorithms to monitor in-situ food safety.

Optimizing Agricultural Data Analysis Techniques through AI-Powered Decision-Making Processes

The agricultural sector is undergoing a transformative paradigm shift with the integration of advanced technologies, particularly artificial intelligence (AI), to enhance data analysis techniques and streamline decision-making processes. This paper delves into the integration of advanced technologies in agriculture, focusing specifically on optimizing data analysis through artificial intelligence (AI) to strengthen decision-making processes in farming. We present a novel AI-powered model that leverages historical agricultural datasets, utilizing a comprehensive array of established machine learning algorithms to enhance the prediction and classification of agricultural data. This work provides tailored algorithm recommendations, bypassing the need to deploy and fine-tune numerous algorithms. We approximate the accuracy of suitable algorithms, highlighting those with the highest precision, thus saving time by leveraging pre-trained AI models on historical agricultural data. Our method involves three phases: collecting diverse agricultural datasets, applying multiple classifiers, and documenting their accuracy. This information is stored in a CSV file, which is then used by AI classifiers to predict the accuracy of new, unseen datasets. By evaluating feature information and various data segmentations, we recommend the configuration that achieves the highest accuracy. This approach eliminates the need for exhaustive algorithm reruns, relying on pre-trained models to estimate outcomes based on dataset characteristics. Our experimentation spans various configurations, including different training–testing splits and feature sets across multiple dataset sizes, meticulously evaluated through key performance metrics such as accuracy, precision, recall, and F-measure. The experimental results underscore the efficiency of our model, with significant improvements in predictive accuracy and resource utilization, demonstrated through comparative performance analysis against traditional methods. This paper highlights the superiority of the proposed model in its ability to systematically determine the most effective algorithm for specific agricultural data types, thus optimizing computational resources and improving the scalability of smart farming solutions. The results reveal that the proposed system can accurately predict a near-optimal machine learning algorithm and data structure for crop data with an accuracy of 89.38%, 87.61%, and 84.27% for decision tree, random forest, and random tree algorithms, respectively.

Anomaly Detection for Power Quality Analysis Using Smart Metering Systems.

The problem of Power Quality analysis is becoming crucial to ensuring the proper functioning of complex systems and big plants. In this regard, it is essential to rapidly detect anomalies in voltage and current signals to ensure a prompt response and maximize the system's availability with the minimum maintenance cost. In this paper, anomaly detection algorithms based on machine learning, such as One Class Support Vector Machine (OCSVM), Isolation Forest (IF), and Angle-Based Outlier Detection (ABOD), are used as a first tool for rapid and effective clustering of the measured voltage and current signals directly on-line on the sensing unit. If the proposed anomaly detection algorithm detects an anomaly, further investigations using suitable classification algorithms are required. The main advantage of the proposed solution is the ability to rapidly and efficiently detect different types of anomalies with low computational complexity, allowing the implementation of the algorithm directly on the sensor node used for signal acquisition. A suitable experimental platform has been established to evaluate the advantages of the proposed method. All the different models were tested using a consistent set of hyperparameters and an output dataset generated from the principal component analysis technique. The best results achieved included models reaching 100% recall and a 92% F1 score.