Recent Algorithms Research Articles

Fast hardware-aware matrix-free algorithms for higher-order finite-element discretized matrix multivector products on distributed systems

Recent hardware-aware matrix-free algorithms for higher-order finite-element (FE) discretized matrix-vector multiplications reduce floating point operations and data access costs compared to traditional sparse matrix approaches. In this work, we address a critical gap in existing matrix-free implementations which are not well suited for the action of FE discretized matrices on very large number of vectors. In particular, we propose efficient matrix-free algorithms for evaluating FE discretized matrix-multivector products on both multi-node CPU and GPU architectures. To this end, we employ batched evaluation strategies, with the batchsize tailored to underlying hardware architectures, leading to better data locality and enabling further parallelization. On CPUs, we utilize even-odd decomposition, SIMD vectorization, and overlapping computation and communication strategies. On GPUs, we develop strategies to overlap compute with data movement for achieving efficient pipelining and reduced data accesses through the use of GPU-shared memory, constant memory and kernel fusion. Our implementation outperforms the baselines for Helmholtz operator action on 1024 vectors, achieving up to 1.4x improvement on one CPU node and up to 2.8x on one GPU node, while reaching up to 4.4x and 1.5x improvement on multiple nodes for CPUs (3072 cores) and GPUs (24 GPUs), respectively. We further benchmark the performance of the proposed implementation for solving a model eigenvalue problem for 1024 smallest eigenvalue-eigenvector pairs by employing the Chebyshev Filtered Subspace Iteration method, achieving up to 1.5x improvement on one CPU node and up to 2.2x on one GPU node while reaching up to 3.0x and 1.4x improvement on multi-node CPUs (3072 cores) and GPUs (24 GPUs), respectively.

An enhanced cross-sectional HIV incidence estimator that incorporates prior HIV test results.

Incidence estimation of HIV infection can be performed using recent infection testing algorithm (RITA) results from a cross-sectional sample. This allows practitioners to understand population trends in the HIV epidemic without having to perform longitudinal follow-up on a cohort of individuals. The utility of the approach is limited by its precision, driven by the (low) sensitivity of the RITA at identifying recent infection. By utilizing results of previous HIV tests that individuals may have taken, we consider an enhanced RITA with increased sensitivity (and specificity). We use it to propose an enhanced estimator for incidence estimation. We prove the theoretical properties of the enhanced estimator and illustrate its numerical performance in simulation studies. We apply the estimator to data from a cluster-randomized trial to study the effect of community-level HIV interventions on HIV incidence. We demonstrate that the enhanced estimator provides a more precise estimate of HIV incidence compared to the standard estimator.

Performance analysis of an optimized PID-P controller for the position control of a magnetic levitation system using recent optimization algorithms

As industrial technology advances, there is an increasing need for very precise position control mechanisms for highly integrated and accurate products. Therefore, high precision positioning systems play an essential part in today's manufacturing processes. Piezoelectric actuators offer the requisite stiffness and positioning precision, but they have a limited traveling range. The combination of a linear motor with air bearings is a typical method for achieving long stroke movement at high speeds. However, to accomplish extensive and precise motion in several degrees of freedom with a linear motor and non-contact bearing, a sophisticated system setup is required. In this paper, a proportional-integral-derivative-proportional (PID-P) controller is presented for magnetic levitation system position control. Particle swarm optimization (PSO) and Black window optimization (BWO) algorithms are proposed for tuning the PID-P controller parameters. The PSO and BWO algorithms are employed by considering Integral Time Absolute Error (ITAE) as an objective function with rise-time and percentage peak overshoot as constraints. Furthermore, the performance of PSO and BWOA tuned PID-P controllers is compared to conventional PID-P and PID controllers using time response specifications such as rise time, settling time, and percentage peak overshoot. The graphical and numerical simulation results show that the PSO and BWOA tuned PID-P controller outperforms the conventional PID-P and PID controllers. The BWOA tuned PID-P controller outperformed the PSO tuned PID controller and the classical PID-P controller by 8.5 % in rise time, 46.77 % in settling time, and 86.6 % in percentage peak overshoot.

Novel Hybrid Mexican Axolotl Optimization with Fuzzy Logic for Maximum Power Point Tracker of Partially Shaded Photovoltaic Systems

Due to the nonlinear relation between the generated power and voltage of photovoltaic (PV) arrays, there is a need to stimulate PV arrays to operate at maximum possible power. Maximum power can be tracked using the maximum power point tracker (MPPT). Due to the presence of several peaks on the power–voltage (P–V) characteristics of the shaded PV array, conventional MPPT such as hill climbing may show premature convergence, which can significantly reduce the generated power. Metaheuristic optimization algorithms (MOAs) have been used to avoid this problem. The main shortcomings of MOAs are the low convergence speed and the high ripples in the waveforms. Several strategies have been introduced to shorten the convergence time (CT) and improve the accuracy of convergence. The proposed technique sequentially uses a recent optimization algorithm called Mexican Axolotl Optimization (MAO) to capture the vicinity of the global peak of the P–V characteristics and move the control to a fuzzy logic controller (FLC) to accurately track the maximum power point. The proposed strategy extracts both the benefits of the MAO and FLC and avoids their limitations with the use of the high exploration involved in the MOA at the beginning of optimization and uses the fine accuracy of the FLC to fine-track the MPP. The results obtained from the proposed strategy show a substantial reduction in the CT and the highest accuracy of the global peak, which easily proves its superiority compared to other MPPT algorithms.

An efficient intrusion detection technique for traffic pattern learning

Efficient intrusion detection algorithms are required for network traffic learning patterns in order to protect advanced network communication channels. These systems can be used to detect normal and unusual patterns, signatures, and rule violations. In recent years, conventional and deep machine learning algorithms have been utilized in the field of network intrusion detection for network traffic learning systems. The use of machine learning opens up new attack surfaces that are very intriguing to investigate. Attackers can introduce noisy data into training data to influence testing patterns in computer networks. The goal of this work is to create an efficient intrusion detection solution for network traffic learning patterns using a supervised and unsupervised technique. We developed an effective intrusion detection system (IDs) using an appropriate NSLKDD dataset for network traffic patterns. The model was trained and evaluated using the Genetic Optimization Algorithm (GOA) and the Niave Bayesian technique to recognize usual and unexpected network traffic patterns. We created a strategy that begins with a random population and subsequent iterates through the fitness function, returning the best parents with high detection accuracy. The best parents were determined using the n-parameters iterated by the crossover and mutation procedures. A cross over function was created to combine genes from two fitness parents by randomly selecting portions from each parent. The individual components of the crossover offsprings are randomly flipped to achieve the mutation. The fitness of the previous generation was obtained to generate a new generation, and this process was repeated n times. This was created to detect network intrusions using Nave Bayes' binary categorization problem and evolutionary algorithms. We accomplished this task by aggregating noise into training set before broadcasting the average number, and it is critical not to have that public average too frequently. The experimental results reveal that our proposed GA fared better than the NB technique, with a detection accuracy of 95.0% versus a recommendable detection accuracy of 53.0%.

Optimal parameters identification for PEMFC using autonomous groups particle swarm optimization algorithm

The precise model for Polymer Electrolyte Membrane Fuel Cells (PEMFCs) is vital for simulation, control, and performance analysis of PEMFCs. It is crucial to accurately estimate the model parameters. Over the past decade, the extraction of unknown parameters of PEMFCs model is formulated as optimization problem and several meta-heuristic techniques have emerged to solve this problem. Despite the development of these techniques to tackle the problem, the slow convergence rate and susceptibility to being trapped in local minima are regarded as weaknesses of these methods. Additionally, because the PEMFC model is a nonlinear and complex model, not all optimization algorithms are suitable for solving it. This article introduces a novel approach that utilizes the Autonomous Groups Particle Swarm Optimization (AGPSO) algorithm for extracting precise values for uncertain parameters inherent in PEMFC model of 250Wstack and BCS-500W stack utilized significantly in the literature. The optimization problem's fitness function is formulated as the total squared errors (TSEs) between the voltage datasets measured and estimated. Three different versions of AGPSO algorithm are presented. Statistical analysis is performed on these three versions to assess their robustness, and the most robust version is identified. Furthermore, the performance of the most robust version is extensively tested and analyzed through a complete comparison with recent optimization algorithms findings from the updated state-of-the-art literature such as BO, QOBO, TGA, HHO and ASO. Further, a statistical analysis was carried out that ensured the reliability and robustness of the introduced AGPSO. The results highlight the efficacy and feasibility of AGPSO-based approach across all compared algorithms, demonstrating an enhancement in the accuracy of the PEMFC model. A two-phase sensitivity analysis, conducted through Monte Carlo Simulation (MCS), was employed to assess how variations in optimized parameters affect the objective function (TSEs). Furthermore, the uncertainty in the maximum power reference current is identified.

Detecting Parkinson’s disease from shoe-mounted accelerometer sensors using convolutional neural networks optimized with modified metaheuristics

Neurodegenerative conditions significantly impact patient quality of life. Many conditions do not have a cure, but with appropriate and timely treatment the advance of the disease could be diminished. However, many patients only seek a diagnosis once the condition progresses to a point at which the quality of life is significantly impacted. Effective non-invasive and readily accessible methods for early diagnosis can considerably enhance the quality of life of patients affected by neurodegenerative conditions. This work explores the potential of convolutional neural networks (CNNs) for patient gain freezing associated with Parkinson’s disease. Sensor data collected from wearable gyroscopes located at the sole of the patient’s shoe record walking patterns. These patterns are further analyzed using convolutional networks to accurately detect abnormal walking patterns. The suggested method is assessed on a public real-world dataset collected from parents affected by Parkinson’s as well as individuals from a control group. To improve the accuracy of the classification, an altered variant of the recent crayfish optimization algorithm is introduced and compared to contemporary optimization metaheuristics. Our findings reveal that the modified algorithm (MSCHO) significantly outperforms other methods in accuracy, demonstrated by low error rates and high Cohen’s Kappa, precision, sensitivity, and F1-measures across three datasets. These results suggest the potential of CNNs, combined with advanced optimization techniques, for early, non-invasive diagnosis of neurodegenerative conditions, offering a path to improve patient quality of life.

Labeling methods for partially ordered paths

The landscape of applications and subroutines relying on shortest path computations continues to grow steadily. This growth is driven by the undeniable success of shortest path algorithms in theory and practice. It also introduces new challenges as the models and assessing the optimality of paths become more complicated. Hence, multiple recent publications in the field adapt existing labeling methods in an ad hoc fashion to their specific problem variant without considering the underlying general structure: they always deal with multi-criteria scenarios, and those criteria define different partial orders on the paths. In this paper, we introduce the partial order shortest path problem (POSP), a generalization of the multi-objective shortest path problem (MOSP) and in turn also of the classical shortest path problem. POSP captures the particular structure of many shortest path applications as special cases. In this generality, we study optimality conditions or the lack of them, depending on the objective functions’ properties. Our final contribution is a big lookup table summarizing our findings and providing the reader with an easy way to choose among the most recent multi-criteria shortest path algorithms depending on their problems’ weight structure. Examples range from time-dependent shortest path bottleneck path problems to the electric vehicle shortest path problem with recharging and complex financial weight functions studied in the public transportation community. Our results hold for general digraphs and, therefore, surpass previous generalizations that were limited to acyclic graphs.

Multi-level optimal energy management strategy for a grid tied microgrid considering uncertainty in weather conditions and load

Microgrids require efficient energy management systems to optimize the operation of microgrid sources and achieve economic efficiency. Bi-level energy management model is proposed in this paper to minimize the operational cost of a grid-tied microgrid under load variations and uncertainties in renewable sources while satisfying the various technical constraints. The first level is day ahead scheduling of generation units based on day ahead forecasting of renewable energy sources and load demand. In this paper, a recent meta-heuristic algorithm called Coronavirus Herd Immunity Optimizer (CHIO) is used to solve the problem of day-ahead scheduling of batteries, which is a complex constrained non-linear optimization problem, while the Lagrange multiplier method is used to determine the set-point of the Diesel Generator (DG). The second level of the proposed EMS is rescheduling and updating the set-points of sources in real-time according to the actual solar irradiance, wind speed, load, and grid tariff. In this paper, a novel real-time strategy is proposed to keep the economic operation during real-time under uncertainties. The obtained results show that the CHIO-based bi-level EMS demonstrates an optimal economic operation for a grid-connected microgrid in real-time when there are uncertainties in weather, utility tariffs, and load forecasts.

Bluefin Trevally Optimizer (BTO): A Metaheuristic Algorithm Using Fuzzy Logic Controller for Feature Selection Problem

Metaheuristic algorithms are increasingly used for feature selection (FS) problems due to their robustness and searchability. This study presents a unique optimization technique called fuzzy bluefin trevally optimizer (BTO). BTO draws its inspiration from bluefin’s cooperative nature and sudden ambush behavior. The trevally will jump out of the water and attack its food in the air or even snag it off the water when it is sufficiently close to it. This study uses mathematical modeling to create an optimization algorithm to replicate dynamic patterns and behaviors. Since parameters play a critical role in optimization, we use the fuzzy concept for dynamic parameter adaptation in fuzzy BTO. By introducing the idea of signature and demonstrating that fuzzy BTO converges to the global optimal point, the mathematical basis for the proposed algorithm is provided. The convergence of fuzzy BTO is proved using the Markov chain property. On benchmark functions (BF), the effectiveness of the suggested strategies is evaluated and compared with other metaheuristic algorithms. Then the proposed algorithms are applied to a fuzzy FS problem. Then they are compared with traditional and recent metaheuristic algorithms on the UCI machine learning repository datasets. Finally, the statistical significance is examined using the Kruskal–Wallis test (KWT).

Investigating the actual performance of recent meta-heuristic algorithms in solving different optimization problems

In this paper, the Egret Swarm Optimization Algorithm (ESOA) and Zebra Optimization Algorithm (ZOA) are executed to solve different optimization problems. The results achieved by the two algorithms are evaluated using different criteria, such as stability, minimum, average, and maximum convergence. The evaluation of the results indicates that ESOA not only maintains a surprising stability through its execution but also provides a faster response time compared to ZOA. ESOA requires at most 20 iterations to reach the best value of the main objective functions of the first two selected optimization problems, while ZOA cannot. In the last two selected optimization problems, ESOA continuously shows its superiority over ZOA with its high stability and low utilization of iterations to reach the best value of the main objective functions. Considering these results, ESOA deserves powerful search methods, and the method is strongly recommended to optimize such optimization problems.

Multi-strategy enhanced Marine Predators Algorithm with applications in engineering optimization and feature selection problems

This paper introduces a novel meta-heuristic optimization algorithm named Clustering Wavelet Opposition-based Marine Predators Algorithm (CWOMPA) to address some limitations present in the well-established Marine Predators Algorithm (MPA). CWOMPA incorporates three key strategies: a fuzzy clustering approach for escaping local optima, using wavelet basis function-based impact coefficient adjustment for elites to prevent premature convergence, and finally an adaptive opposition-based learning strategy for maintaining population diversity. Compared with some recent meta-heuristic algorithms, extensive evaluations conducted affirm that CWOMPA achieves the best Friedman rank, 4.30 and 1.95 respectively, on 23 benchmark functions and the CEC 2017 benchmark set. Not only does CWOMPA demonstrate significant effectiveness on six constrained problems from the CEC 2020 real-world benchmarks, but also when applied to 14 medical datasets, it gains superior Friedman ranks in terms of selected features, classification accuracy, F-Score, and objective function value, 2.5, 2.25, 2.96, 2.93 respectively, outperforming other common methods. Finally, CWOMPA exhibits the highest classification accuracy across all datasets and the best F-Score performance in nine datasets compared to traditional feature selection algorithms. The obtained results reveal that CWOMPA is a powerful and versatile optimization algorithm with significant potential in various real-world applications, including feature selection for medical datasets.

Formalizing Multimedia Recommendation through Multimodal Deep Learning

Recommender systems (RSs) provide customers with a personalized navigation experience within the vast catalogs of products and services offered on popular online platforms. Despite the substantial success of traditional RSs, recommendation remains a highly challenging task, especially in specific scenarios and domains. For example, human affinity for items described through multimedia content (e.g., images, audio, and text), such as fashion products, movies, and music, is multi-faceted and primarily driven by their diverse characteristics. Therefore, by leveraging all available signals in such scenarios, multimodality enables us to tap into richer information sources and construct more refined user/item profiles for recommendations. Despite the growing number of multimodal techniques proposed for multimedia recommendation, the existing literature lacks a shared and universal schema for modeling and solving the recommendation problem through the lens of multimodality. Given the recent advances in multimodal deep learning for other tasks and scenarios where precise theoretical and applicative procedures exist, we also consider it imperative to formalize a general multimodal schema for multimedia recommendation. In this work, we first provide a comprehensive literature review of multimodal approaches for multimedia recommendation from the last eight years. Second, we outline the theoretical foundations of a multimodal pipeline for multimedia recommendation by identifying and formally organizing recurring solutions/patterns; at the same time, we demonstrate its rationale by conceptually applying it to selected state-of-the-art approaches in multimedia recommendation. Third, we conduct a benchmarking analysis of recent algorithms for multimedia recommendation within Elliot, a rigorous framework for evaluating recommender systems, where we re-implement such multimedia recommendation approaches. Finally, we highlight the significant unresolved challenges in multimodal deep learning for multimedia recommendation and suggest possible avenues for addressing them. The primary aim of this work is to provide guidelines for designing and implementing the next generation of multimodal approaches in multimedia recommendation.

A novel strategy for real-time optimal scheduling of grid-tied microgrid considering load management and uncertainties

This paper proposes an efficient bi-level energy management strategy (EMS) to optimize the operation cost of a grid-connected microgrid, considering the system operational constraints and uncertainties for renewable energy sources and load demand. The first level is optimal day-ahead scheduling based on two stages: the first stage is finding the optimal operating points of sources during the next day while the second one is controllable loads management. The second level of the proposed EMS is rescheduling and updating the set-points of sources in real-time according to the actual solar irradiance, wind speed, load, and grid tariff. In this paper, a novel real-time strategy is proposed to keep the economic operation during real-time under uncertainties. Also, a recent meta-heuristic algorithm called Honey Badger Algorithm (HBA) is used to solve the problem of day-ahead scheduling of batteries, which is a complex constrained non-linear optimization problem. Results obtained demonstrate that the HBA based bi-level EMS provides the real-time optimal economic operation of a grid tied microgrid under uncertainties in weather, utility tariff and load forecasts.

Modified Rime-Ice Growth Optimizer with Polynomial Differential Learning Operator for Single- and Double-Diode PV Parameter Estimation Problem

A recent optimization algorithm, the Rime Optimization Algorithm (RIME), was developed to efficiently utilize the physical phenomenon of rime-ice growth. It simulates the hard-rime and soft-rime processes, constructing the mechanisms of hard-rime puncture and soft-rime search. In this study, an enhanced version, termed Modified RIME (MRIME), is introduced, integrating a Polynomial Differential Learning Operator (PDLO). The incorporation of PDLO introduces non-linearities to the RIME algorithm, enhancing its adaptability, convergence speed, and global search capability compared to the conventional RIME approach. The proposed MRIME algorithm is designed to identify photovoltaic (PV) module characteristics by considering diverse equivalent circuits, including the One-Diode Model (ONE-DM) and Two-Diode Model TWO-DM, to determine the unspecified parameters of the PV. The MRIME approach is compared to the conventional RIME method using two commercial PV modules, namely the STM6-40/36 module and R.T.C. France cell. The simulation results are juxtaposed with those from contemporary algorithms based on published research. The outcomes related to recent algorithms are also compared with those of the MRIME algorithm in relation to various existing studies. The simulation results indicate that the MRIME algorithm demonstrates substantial improvement rates for the STM6-40/36 module and R.T.C. France cell, achieving 1.16% and 18.45% improvement for the ONE-DM, respectively. For the TWO-DM, it shows significant improvement rates for the two modules, reaching 1.14% and 50.42%, respectively. The MRIME algorithm, in comparison to previously published results, establishes substantial superiority and robustness.

IHHO: an improved Harris Hawks optimization algorithm for solving engineering problems

Harris Hawks optimization (HHO) algorithm was a powerful metaheuristic algorithm for solving complex problems. However, HHO could easily fall within the local minimum. In this paper, we proposed an improved Harris Hawks optimization (IHHO) algorithm for solving different engineering tasks. The proposed algorithm focused on random location-based habitats during the exploration phase and on strategies 1, 3, and 4 during the exploitation phase. The proposed modified Harris hawks in the wild would change their perch strategy and chasing pattern according to updates in both the exploration and exploitation phases. To avoid being stuck in a local solution, random values were generated using logarithms and exponentials to explore new regions more quickly and locations. To evaluate the performance of the proposed algorithm, IHHO was compared to other five recent algorithms [grey wolf optimization, BAT algorithm, teaching–learning-based optimization, moth-flame optimization, and whale optimization algorithm] as well as three other modifications of HHO (BHHO, LogHHO, and MHHO). These optimizers had been applied to different benchmarks, namely standard benchmarks, CEC2017, CEC2019, CEC2020, and other 52 standard benchmark functions. Moreover, six classical real-world engineering problems were tested against the IHHO to prove the efficiency of the proposed algorithm. The numerical results showed the superiority of the proposed algorithm IHHO against other algorithms, which was proved visually using different convergence curves. Friedman's mean rank statistical test was also inducted to calculate the rank of IHHO against other algorithms. The results of the Friedman test indicated that the proposed algorithm was ranked first as compared to the other algorithms as well as three other modifications of HHO.

Bake off redux: a review and experimental evaluation of recent time series classification algorithms

AbstractIn 2017, a research paper (Bagnall et al. Data Mining and Knowledge Discovery 31(3):606-660. 2017) compared 18 Time Series Classification (TSC) algorithms on 85 datasets from the University of California, Riverside (UCR) archive. This study, commonly referred to as a ‘bake off’, identified that only nine algorithms performed significantly better than the Dynamic Time Warping (DTW) and Rotation Forest benchmarks that were used. The study categorised each algorithm by the type of feature they extract from time series data, forming a taxonomy of five main algorithm types. This categorisation of algorithms alongside the provision of code and accessible results for reproducibility has helped fuel an increase in popularity of the TSC field. Over six years have passed since this bake off, the UCR archive has expanded to 112 datasets and there have been a large number of new algorithms proposed. We revisit the bake off, seeing how each of the proposed categories have advanced since the original publication, and evaluate the performance of newer algorithms against the previous best-of-category using an expanded UCR archive. We extend the taxonomy to include three new categories to reflect recent developments. Alongside the originally proposed distance, interval, shapelet, dictionary and hybrid based algorithms, we compare newer convolution and feature based algorithms as well as deep learning approaches. We introduce 30 classification datasets either recently donated to the archive or reformatted to the TSC format, and use these to further evaluate the best performing algorithm from each category. Overall, we find that two recently proposed algorithms, MultiROCKET+Hydra (Dempster et al. 2022) and HIVE-COTEv2 (Middlehurst et al. Mach Learn 110:3211-3243. 2021), perform significantly better than other approaches on both the current and new TSC problems.

Improved Energy Valley Optimizer with Levy Flight for Optimization Problems

Energy Valley Optimizer (EVO) is one of the recent metaheuristic algorithms. It draws inspiration from advanced principles in physics related to particle stability and decay modes. This paper presents a new Energy Valley Optimizer (EVO) and levy flights that are hybrid to improve the EVO in solving optimization problems. Levy flight is one of the most important randomization techniques. Fifteen mathematical test functions (five unimodal functions, four multimodal functions, and six composite functions) are solved with the proposed algorithm. We also compare our results with previous results of metaheuristic algorithms. The statistical results show that the results of the Levy Energy Valley Optimizer (LEVO) outperform other algorithms in almost all mathematical test functions.

Forecasting solar power generation using evolutionary mating algorithm-deep neural networks

This paper proposes an integration of recent metaheuristic algorithm namely Evolutionary Mating Algorithm (EMA) in optimizing the weights and biases of deep neural networks (DNN) for forecasting the solar power generation. The study employs a Feed Forward Neural Network (FFNN) to forecast AC power output using real solar power plant measurements spanning a 34-day period, recorded at 15-minute intervals. The intricate nonlinear relationship between solar irradiation, ambient temperature, and module temperature is captured for accurate prediction. Additionally, the paper conducts a comprehensive comparison with established algorithms, including Differential Evolution (DE-DNN), Barnacles Mating Optimizer (BMO-DNN), Particle Swarm Optimization (PSO-DNN), Harmony Search Algorithm (HSA-DNN), DNN with Adaptive Moment Estimation optimizer (ADAM) and Nonlinear AutoRegressive with eXogenous inputs (NARX). The experimental results distinctly highlight the exceptional performance of EMA-DNN by attaining the lowest Root Mean Squared Error (RMSE) during testing. This contribution not only advances solar power forecasting methodologies but also underscores the potential of merging metaheuristic algorithms with contemporary neural networks for improved accuracy and reliability.

Improved recovery of cardiac auscultation sounds using modified cosine transform and LSTM-based masking.

Obtaining accurate cardiac auscultation signals, including basic heart sounds (S1 and S2) and subtle signs of disease, is crucial for improving cardiac diagnoses and making the most of telehealth. This research paper introduces an innovative approach that utilizes a modified cosine transform (MCT) and a masking strategy based on long short-term memory (LSTM) to effectively distinguish heart sounds and murmurs from background noise and interfering sounds. The MCT is used to capture the repeated pattern of the heart sounds, while the LSTMs are trained to construct masking based on the repeated MCT spectrum. The proposed strategy's performance in maintaining the clinical relevance of heart sounds continues to demonstrate effectiveness, even in environments marked by increased noise and complex disruptions. The present work highlights the clinical significance and reliability of the suggested methodology through in-depth signal visualization and rigorous statistical performance evaluations. In comparative assessments, the proposed approach has demonstrated superior performance compared to recent algorithms, such as LU-Net and PC-DAE. Furthermore, the system's adaptability to various datasets enhances its reliability and practicality. The suggested method is a potential way to improve the accuracy of cardiovascular diagnostics in an era of rapid advancement in medical signal processing. The proposed approach showed an enhancement in the average signal-to-noise ratio (SNR) by 9.6dB at an input SNR of - 6dB and by 3.3dB at an input SNR of 10dB. The average signal distortion ratio (SDR) achieved across a variety of input SNR values was 8.56dB.