Search

Water resources are constantly threatened by pollution of potentially toxic elements (PTEs). In efforts to monitor and mitigate PTEs pollution in water resources, machine learning (ML) algorithms have been utilized to predict them. However, review studies have not paid attention to the suitability of input variables utilized for PTE prediction. Therefore, the present review analyzed studies that employed three ML algorithms: MLP-NN (multilayer perceptron neural network), RBF-NN (radial basis function neural network), and ANFIS (adaptive neuro-fuzzy inference system) to predict PTEs in water. A total of 139 models were analyzed to ascertain the input variables utilized, the suitability of the input variables, the trends of the ML model applications, and the comparison of their performances. The present study identified seven groups of input variables commonly used to predict PTEs in water. Group 1 comprised of physical parameters (P), chemical parameters (C), and metals (M). Group 2 contains only P and C; Group 3 contains only P and M; Group 4 contains only C and M; Group 5 contains only P; Group 6 contains only C; and Group 7 contains only M. Studies that employed the three algorithms proved that Groups 1, 2, 3, 5, and 7 parameters are suitable input variables for forecasting PTEs in water. The parameters of Groups 4 and 6 also proved to be suitable for the MLP-NN algorithm. However, their suitability with respect to the RBF-NN and ANFIS algorithms could not be ascertained. The most commonly predicted PTEs using the MLP-NN algorithm were Fe, Zn, and As. For the RBF-NN algorithm, they were NO 3 , Zn, and Pb, and for the ANFIS, they were NO 3 , Fe, and Mn. Based on correlation and determination coefficients (R, R 2 ), the overall order of performance of the three ML algorithms was ANFIS > RBF-NN > MLP-NN, even though MLP-NN was the most commonly used algorithm., (© 2024. The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.)

An increasing number of machine learning applications are being developed and applied to digital pathology, including hematopathology. The goal of these modern computerized tools is often to support diagnostic workflows by extracting and summarizing information from multiple data sources, including digital images of human tissue. Hematopathology is inherently multimodal and can serve as an ideal case study for machine learning applications. However, hematopathology also poses unique challenges compared to other pathology subspecialities when applying machine learning approaches. By modeling the pathologist workflow and thinking process, machine learning algorithms may be designed to address practical and tangible problems in hematopathology. In this article, we discuss the current trends in machine learning in hematopathology. We review currently available machine learning enabled medical devices supporting hematopathology workflows. We then explore current machine learning research trends of the field with a focus on bone marrow cytology and histopathology, and how adoption of new machine learning tools may be enabled through the transition to digital pathology., (© 2023 The Authors. International Journal of Laboratory Hematology published by John Wiley & Sons Ltd.)

The dynamic use of land that results from urbanization has an impact on the urban ecosystem. Yola North Local Government Area (Yola North LGA) of Adamawa state, Nigeria, has experienced tremendous changes in its land use and land cover (LULC) over the past two decades due to the influx of people from rural areas seeking for the benefits of its economic activities. The goal of this research is to develop an efficient and accurate framework for continuous monitoring of land use and land cover (LULC) change and quantify the transformation in land use and land cover pattern over a specific period (between 2002 and 2022). Land sat images of 2002, 2012, and 2022 were obtained, and the Support Vector Machine classification method was utilized to stratify the images. Land Change Modeler (LCM) tool in Idrissi Selva software was then used to analyze the LULC change. SVM produced a good classification result for all three years, with 2022 having the highest overall accuracy of 95.5%, followed by 2002 with 90% and 2012 with 87.7% which indicates the validity of the algorithm for future predictions. The results showed that severe land changes have occurred over the course of two decades in built-up (37.32%), vegetation (forest, scrubland, and grassland) (-3.27%), bare surface (-33.47%), and water bodies (-0.59%). Such changes in LULC could lead to agricultural land lost and reduced food supply. This research develops a robust framework for continuous land use monitoring, utilizing machine learning and geo-spatial data for urban planning, natural resource management, and environmental conservation. In conclusion, this study underscores the efficacy of support vector machine algorithm in analyzing complex land use and land cover changes., (© 2023. The Author(s), under exclusive licence to Springer Nature Switzerland AG.)

Ship black carbon emissions have caused great harm to ecological environment. In order to estimate the black carbon emissions, thereby reducing the cost of black carbon experiments, here, we introduced four machine learning algorithms which are lasso regression, support vector machine, extreme gradient boosting, and artificial neural network to predict ship black carbon emissions. The prediction models were established with using the datasets acquired from similar marine engines under various steady-state conditions. The results show that SVM, XGB, and ANN have higher prediction accuracy than lasso regression, and the adjusted R 2 of each model is 0.9810, 0.9850, 0.9885, and 0.6088. Although ANN shows the best prediction performance, it is inferior to SVM and XGB in terms of model stability and training cost. Then, in order to simplify the optimization process of hyperparameters and improve the prediction accuracy of the model at the same time, we use three different swarm intelligence algorithms to automatically optimize the hyperparameters of SVM and XGB. In addition, we applied mutual information to measure the correlation between the characteristics of the prediction models and black carbon concentration and found that the characteristics which related to in-cylinder combustion have a strong correlation with the black carbon concentration. The findings in this paper prove the feasibility of machine learning in ship black carbon emission prediction and could provide references for reducing ship black carbon emissions and the formulation of emission regulations., (© 2022. The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.)

High-dimensional clustering analysis is a challenging problem in statistics and machine learning, with broad applications such as the analysis of microarray data and RNA-seq data. In this paper, we propose a new clustering procedure called spectral clustering with feature selection (SC-FS), where we first obtain an initial estimate of labels via spectral clustering, then select a small fraction of features with the largest R-squared with these labels, that is, the proportion of variation explained by group labels, and conduct clustering again using selected features. Under mild conditions, we prove that the proposed method identifies all informative features with high probability and achieves the minimax optimal clustering error rate for the sparse Gaussian mixture model. Applications of SC-FS to four real-world datasets demonstrate its usefulness in clustering high-dimensional data., (© 2022 The International Biometric Society.)

The ability to estimate the probability of a drug to receive approval in clinical trials provides natural advantages to optimizing pharmaceutical research workflows. Success rates of clinical trials have deep implications for costs, duration of development, and under pressure due to stringent regulatory approval processes. We propose a machine learning approach that can predict the outcome of the trial with reliable accuracies, using biological activities, physicochemical properties of the compounds, target-related features, and NLP-based compound representation. In the above list, biological activities have never been used as an independent variable towards the prediction of clinical trial outcomes. We have extracted the drug-disease pair from clinical trials and mapped target(s) to that pair using multiple data sources. Empirical results demonstrate that ensemble learning outperforms independently trained, small-data ML models. We report results and inferences derived from a Random forest classifier with an average accuracy of 93%, and an F1 score of 0.96 for the "Pass" class. "Pass" refers to one of the two classes (Pass/Fail) of all clinical trials, and the model performed well in predicting the "Pass" category. Through the analysis of feature contributions to predictive capability, we have demonstrated that bioactivity plays a statistically significant role in predicting clinical trial outcome. A significant effort has gone into the production of the dataset that, for the first time, integrates clinical trial information with protein targets. Cleaned, organized, integrated data and code to map these entities, created as a part of this work, are available open-source. This reproducibility and the freely available code ensure that researchers with access to deep curated and proprietary clinical trial databases (we only use open-source data in this study) can further expand the scope of the results., (© 2022 John Wiley & Sons Ltd.)

This study was designed to improve blood glucose level predictability and future hypoglycemic and hyperglycemic event alerts through a novel patient-specific supervised-machine-learning (SML) analysis of glucose level based on a continuous-glucose-monitoring system (CGM) that needs no human intervention, and minimises false-positive alerts. The CGM data over 7 to 50 non-consecutive days from 11 type-1 diabetic patients aged 18 to 39 with a mean HbA1C of 7.5% ± 1.2% were analysed using four SML models. The algorithm was constructed to choose the best-fit model for each patient. Several statistical parameters were calculated to aggregate the magnitudes of the prediction errors. The personalised solutions provided by the algorithm were effective in predicting glucose levels 30 minutes after the last measurement. The average root-mean-square-error was 20.48 mg/dL and the average absolute-mean-error was 15.36 mg/dL when the best-fit model was selected for each patient. Using the best-fit-model, the true-positive-hypoglycemia-prediction-rate was 64%, whereas the false-positive- rate was 4.0%, and the false-negative-rate was 0.015%. Similar results were found even when only CGM samples below 70 were considered. The true-positive-hyperglycemia-prediction-rate was 61%. State-of-the-art SML tools are effective in predicting the glucose level values of patients with type-1diabetes and notifying these patients of future hypoglycemic and hyperglycemic events, thus improving glycemic control. The algorithm can be used to improve the calculation of the basal insulin rate and bolus insulin, and suitable for a closed loop "artificial pancreas" system. The algorithm provides a personalised medical solution that can successfully identify the best-fit method for each patient., (© 2020 John Wiley & Sons Ltd.)

This document is a special issue of the journal Algorithms, featuring selected papers from the journal's editorial board members from 2022 and 2023. The issue includes 16 research papers covering a range of topics such as game theory, fault detection in cellular networks, optimization algorithms, machine learning, cryptocurrency trading, and more. Each paper presents its own unique research findings and methodologies. The issue aims to showcase the diverse research interests and expertise of the journal's editorial board members. [Extracted from the article]

Major advances have been made regarding the utilization of machine learning techniques for disease diagnosis and prognosis based on complex and high-dimensional data. Despite all justified enthusiasm, overoptimistic assessments of predictive performance are still common in this area. However, predictive models and medical devices based on such models should undergo a throughout evaluation before being implemented into clinical practice. In this work, we propose a multiple testing framework for (comparative) phase III diagnostic accuracy studies with sensitivity and specificity as co-primary endpoints. Our approach challenges the frequent recommendation to strictly separate model selection and evaluation, that is, to only assess a single diagnostic model in the evaluation study. We show that our parametric simultaneous test procedure asymptotically allows strong control of the family-wise error rate. A multiplicity correction is also available for point and interval estimates. Moreover, we demonstrate in an extensive simulation study that our multiple testing strategy on average leads to a better final diagnostic model and increased statistical power. To plan such studies, we propose a Bayesian approach to determine the optimal number of models to evaluate simultaneously. For this purpose, our algorithm optimizes the expected final model performance given previous (hold-out) data from the model development phase. We conclude that an assessment of multiple promising diagnostic models in the same evaluation study has several advantages when suitable adjustments for multiple comparisons are employed., (© 2022 The Authors. Statistics in Medicine published by John Wiley & Sons Ltd.)

In response to the rapidly evolving threat landscape in network security, this paper proposes an Evolutionary Machine Learning Algorithm designed for robust intrusion detection. We specifically address challenges such as adaptability to new threats and scalability across diverse network environments. Our approach is validated using two distinct datasets: BoT-IoT, reflecting a range of IoT-specific attacks, and UNSW-NB15, offering a broader context of network intrusion scenarios using GA based hybrid DT-SVM. This selection facilitates a comprehensive evaluation of the algorithm's effectiveness across varying attack vectors. Performance metrics including accuracy, recall, and false positive rates are meticulously chosen to demonstrate the algorithm's capability to accurately identify and adapt to both known and novel threats, thereby substantiating the algorithm's potential as a scalable and adaptable security solution. This study aims to advance the development of intrusion detection systems that are not only reactive but also preemptively adaptive to emerging cyber threats." During the feature selection step, a GA is used to discover and preserve the most relevant characteristics from the dataset by using evolutionary principles. Through the use of this technology based on genetic algorithms, the subset of features is optimised, enabling the subsequent classification model to focus on the most relevant components of network data. In order to accomplish this, DT-SVM classification and GA-driven feature selection are integrated in an effort to strike a balance between efficiency and accuracy. The system has been purposefully designed to efficiently handle data streams in real-time, ensuring that intrusions are promptly and precisely detected. The empirical results corroborate the study's assertion that the IDS outperforms traditional methodologies., Competing Interests: NO authors have competing interests., (Copyright: © 2024 Sharma et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

RNA modifications play an important role in actively controlling recently created formation in cellular regulation mechanisms, which link them to gene expression and protein. The RNA modifications have numerous alterations, presenting broad glimpses of RNA's operations and character. The modification process by the TET enzyme oxidation is the crucial change associated with cytosine hydroxymethylation. The effect of CR is an alteration in specific biochemical ways of the organism, such as gene expression and epigenetic alterations. Traditional laboratory systems that identify 5-hydroxymethylcytosine (5hmC) samples are expensive and time-consuming compared to other methods. To address this challenge, the paper proposed XGB5hmC, a machine learning algorithm based on a robust gradient boosting algorithm (XGBoost), with different residue based formulation methods to identify 5hmC samples. Their results were amalgamated, and six different frequency residue based encoding features were fused to form a hybrid vector in order to enhance model discrimination capabilities. In addition, the proposed model incorporates SHAP (Shapley Additive Explanations) based feature selection to demonstrate model interpretability by highlighting the high contributory features. Among the applied machine learning algorithms, the XGBoost ensemble model using the tenfold cross-validation test achieved improved results than existing state-of-the-art models. Our model reported an accuracy of 89.97%, sensitivity of 87.78%, specificity of 94.45%, F1-score of 0.8934%, and MCC of 0.8764%. This study highlights the potential to provide valuable insights for enhancing medical assessment and treatment protocols, representing a significant advancement in RNA modification analysis., (© 2024. The Author(s).)

Addressing water scarcity challenges in arid regions is a pressing concern and demands innovative solutions for accurate groundwater potential mapping (GPM). This study presents a comprehensive evaluation of advanced modeling techniques to enhance the precision of GPM. This study, conducted in the Zayandeh Rood watershed, Iran, employed a spatial database comprising 16 influential factors on groundwater potential and data from 175 wells. This study introduced an innovative approach to GPM by enhancing the Random Forest (RF) algorithm. This enhancement involved integrating three metaheuristic algorithms inspired by human behavior: ICA (Imperialist Competitive Algorithm), TLBO (Teaching-Learning-Based Optimization), and SBO (Student Psychology Based Optimization). The modeling process used 70% training data and 30% evaluation data. Data preprocessing was performed using the multicollinearity test method and frequency ratio (FR) technique to refine the dataset. Subsequently, the GPM was generated using four distinct models, demonstrating the combined power of machine learning and human-inspired metaheuristic algorithms. The performance of the models was systematically assessed through extensive statistical analyses, including root mean squared error (RMSE), mean absolute error (MAE), area under the curve (AUC) for the receiver operating characteristic curve (ROC), Friedman tests, chi-squared tests, and Wilcoxon signed-rank tests. RF-ICA and RF-SPBO emerged as frontrunners, displaying statistically comparable accuracy and significantly outperforming RF-TLBO and the non-optimized RF model. The results of the GPM revealed the exceptional accuracy of RF-ICA, which exhibited a commanding AUC score of 0.865, underscoring its superiority in discriminating between different groundwater potential classes. RF-SPBO also displayed strong performance with an AUC of 0.842, highlighting its effectiveness in inaccurate classification. RF-TLBO and the non-optimized RF model achieved AUC values of 0.813 and 0.810, respectively, indicating comparable performance. The outcomes of this study provide valuable insights for policymakers, offering a robust framework for tackling water scarcity challenges in arid regions through precise and reliable groundwater potential assessments., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier Ltd.. All rights reserved.)

Background and Objective: Time series data plays a crucial role in the realm of the Internet of Things Medical (IoMT). Through machine learning (ML) algorithms, online time series classification in IoMT systems enables reliable real-time disease detection. Deploying ML algorithms on edge health devices can reduce latency and safeguard patients' privacy. However, the limited computational resources of these devices underscore the need for more energy-efficient algorithms. Furthermore, online time series classification inevitably faces the challenges of concept drift (CD) and catastrophic forgetting (CF). To address these challenges, this study proposes an energy-efficient Online Time series classification algorithm that can solve CF and CD for health devices, called OTCD., Methods: OTCD first detects the appearance of concept drift and performs prototype updates to mitigate its impact. Afterward, it standardizes the potential space distribution and selectively preserves key training parameters to address CF. This approach reduces the required memory and enhances energy efficiency. To evaluate the performance of the proposed model in real-time health monitoring tasks, we utilize electrocardiogram (ECG) and photoplethysmogram (PPG) data. By adopting various feature extractors, three arrhythmia classification models are compared. To assess the energy efficiency of OTCD, we conduct runtime tests on each dataset. Additionally, the OTCD is compared with state-of-the-art (SOTA) dynamic time series classification models for performance evaluation., Results: The OTCD algorithm outperforms existing SOTA time series classification algorithms in IoMT. In particular, OTCD is on average 2.77% to 14.74% more accurate than other models on the MIT-BIH arrhythmia dataset. Additionally, it consumes low memory (1 KB) and performs computations at a rate of 0.004 GFLOPs per second, leading to energy savings and high time efficiency., Conclusion: Our proposed algorithm, OTCD, enables efficient real-time classification of medical time series on edge health devices. Experimental results demonstrate its significant competitiveness, offering promising prospects for safe and reliable healthcare., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Background: Osteoarthritis (OA) is a prevalent joint disorder characterized by cartilage degeneration and joint inflammation. Liquid-liquid phase separation (LLPS), a biophysical process involved in cellular organization, has recently gained attention in OA research. However, the relationship between LLPS and OA remains poorly understood., Methods: We analyzed gene expression data from the GSE48556 dataset to identify LLPS-related genes associated with OA. Differential expression analysis, enrichment analyses, and machine learning algorithms were employed to explore the functional significance of LLPS-related genes in OA and then construct a diagnostic model for OA. In addition, IL-1β as a pro-inflammatory factor to establish an in vitro OA model, and the protein expression levels of OA biomarkers were detected by western blot., Results: A total of 145 LLPS-related genes were screened in OA samples. Enrichment analyses revealed these genes were mainly enriched in mRNA metabolic processes, cytoplasmic granules, and insulin resistance. Four characteristic genes for OA were selected by using machine learning algorithms, including ADRB2, H3F3B, GNL3L, and PELO. These genes showed satisfactory diagnostic values. Furthermore, there were association between these biomarkers and immune cells, including T cells CD8 and monocytes. In vitro experiments showed that IL-1β stimulation significantly inhibited the cell viability of chondrocytes and enhanced the levels of pro-inflammatory factors, that could mimic the inflammatory state of OA. The expression levels of GNL3L and H3F3B proteins in IL-1β group were obviously lower than those in control group, while levels of ADRB2 and PELO were higher, which was consistent with the results of bioinformatics analysis., Conclusion: Our study identifies LLPS-related genes as potential diagnostic biomarkers for OA. These findings provide insights into the molecular mechanisms underlying OA pathogenesis and offer opportunities for the development of novel therapeutic strategies., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier GmbH.. All rights reserved.)

A timely and consistent assessment of crop yield will assist the farmers in improving their income, minimizing losses, and deriving strategic plans in agricultural commodities to adopt import-export policies. Crop yield predictions are one of the various challenges faced in the agriculture sector and play a significant role in planning and decision-making. Machine learning algorithms provided enough belief and proved their ability to predict crop yield. The selection of the most suitable crop is influenced by various environmental factors such as temperature, soil fertility, water availability, quality, and seasonal variations, as well as economic considerations such as stock availability, preservation capabilities, market demand, purchasing power, and crop prices. The paper outlines a framework used to evaluate the performance of various machine-learning algorithms for forecasting crop yields. The models were based on a range of prime parameters including pesticides, rainfall and average temperature. The Results of three machine learning algorithms, Categorical Boosting (CatBoost), Light Gradient-Boosting Machine (LightGBM), and eXtreme Gradient Boosting (XGBoost) are compared and found more accurate than other algorithms in predicting crop yields. The RMSE and R2 values were calculated to compare the predicted and observed rice yields, resulting in the following values: CatBoost with 800 (0.24), LightGBM with 737 (0.33), and XGBoost with 744 (0.31). Among these three machine learning algorithms, CatBoost demonstrated the highest precision in predicting yields, achieving an accuracy rate of 99.123%., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Mahesh, Soundrapandiyan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Background: The presence of bias in artificial intelligence has garnered increased attention, with inequities in algorithmic performance being exposed across the fields of criminal justice, education, and welfare services. In health care, the inequitable performance of algorithms across demographic groups may widen health inequalities., Objective: Here, we identify and characterize bias in cardiology algorithms, looking specifically at algorithms used in the management of heart failure., Methods: Stage 1 involved a literature search of PubMed and Web of Science for key terms relating to cardiac machine learning (ML) algorithms. Papers that built ML models to predict cardiac disease were evaluated for their focus on demographic bias in model performance, and open-source data sets were retained for our investigation. Two open-source data sets were identified: (1) the University of California Irvine Heart Failure data set and (2) the University of California Irvine Coronary Artery Disease data set. We reproduced existing algorithms that have been reported for these data sets, tested them for sex biases in algorithm performance, and assessed a range of remediation techniques for their efficacy in reducing inequities. Particular attention was paid to the false negative rate (FNR), due to the clinical significance of underdiagnosis and missed opportunities for treatment., Results: In stage 1, our literature search returned 127 papers, with 60 meeting the criteria for a full review and only 3 papers highlighting sex differences in algorithm performance. In the papers that reported sex, there was a consistent underrepresentation of female patients in the data sets. No papers investigated racial or ethnic differences. In stage 2, we reproduced algorithms reported in the literature, achieving mean accuracies of 84.24% (SD 3.51%) for data set 1 and 85.72% (SD 1.75%) for data set 2 (random forest models). For data set 1, the FNR was significantly higher for female patients in 13 out of 16 experiments, meeting the threshold of statistical significance (-17.81% to -3.37%; P<.05). A smaller disparity in the false positive rate was significant for male patients in 13 out of 16 experiments (-0.48% to +9.77%; P<.05). We observed an overprediction of disease for male patients (higher false positive rate) and an underprediction of disease for female patients (higher FNR). Sex differences in feature importance suggest that feature selection needs to be demographically tailored., Conclusions: Our research exposes a significant gap in cardiac ML research, highlighting that the underperformance of algorithms for female patients has been overlooked in the published literature. Our study quantifies sex disparities in algorithmic performance and explores several sources of bias. We found an underrepresentation of female patients in the data sets used to train algorithms, identified sex biases in model error rates, and demonstrated that a series of remediation techniques were unable to address the inequities present., (©Isabel Straw, Geraint Rees, Parashkev Nachev. Originally published in the Journal of Medical Internet Research (https://www.jmir.org), 26.08.2024.)

This paper presents a comprehensive workflow for integrating revolving events into the transitive sequential pattern mining (tSPM+) algorithm and Machine Learning for Health Outcomes (MLHO) framework, emphasizing best practices and pitfalls in its application. We emphasize feature engineering and visualization techniques, demonstrating their efficacy in capturing temporal relationships. Applied to an EGFR lung cancer cohort, our approach showcases reliable temporal insights even in a small dataset. This work highlights the importance of temporal nuances in healthcare data analysis, paving the way for improved disease understanding and patient care.

Causal inference seeks to learn the effect of interventions on outcomes. Its potential in the health domain has been dramatically increasing recently, due to advancements in machine learning, as well as in the growing amount of medical data collected. Gaia-X provides a framework to implement Health Data Spaces at scale, in a compliant, secure, and trustable manner. In this paper, we provide a modular online service for causal inference using observational data, building on the Gaia-X framework. While two versions of the IDA algorithm for causal inference are already provided, the service allows users to further contribute algorithms in various programming languages (not only for causal inference), as well as their data, and efficiently execute these on a central server. Additionally, the platform facilitates the exchange of algorithms and data among participants. Users of the platform can enter into agreements with other users over the use of algorithms and data. Calculations can be carried out directly on the platform without the need to locally store foreign data.

The complexity of the cancer problem domain presents challenges not only to the medical analysis systems tasked with its analysis, but also to the users of such systems. While it is desirable to assist users in operating these medical analysis systems, prior groundwork is required before this can be achieved, such as recognising patterns in the way users create certain analyses within these systems. In this paper, we use machine learning algorithms to analyse user behaviour patterns and attempt to predict the next user interaction within the CARESS medical analysis system. Since an appropriate pre-processing scheme is essential for the performance of these algorithms, we propose the usage of a Natural Language Processing (NLP)- inspired approach to preserve some semantic cohesion of the mostly categorical features of these user interactions. Furthermore, we propose to use a sliding window that contains information about the latest user interactions in combination with Latent Dirichlet Allocation (LDA) to extract a latent topic from these last interactions and use it as additional input to the machine learning models. We compare this pre-processing scheme with other approaches that utilise one-hot encoding and feature hashing. The results of our experiments show that the sliding window LDA scheme is a promising solution, that performs better for our use case than the other evaluated pre-processing schemes. Overall, our results provide an important piece for further research and development in the area of assisting users in operating analysis systems in complex problem domains.

Slip, trip, and fall (STF) accidents cause high rates of absence from work in many companies. During the 2022 reporting period, the German Social Accident Insurance recorded 165,420 STF accidents, of which 12 were fatal and 2485 led to disability pensions. Particularly in the traffic, transport and logistics sector, STF accidents are the most frequently reported occupational accidents. Therefore, an accurate detection of near-falls is critical to improve worker safety. Efficient detection algorithms are essential for this, but their performance heavily depends on large, well-curated datasets. However, there are drawbacks to current datasets, including small sample sizes, an emphasis on older demographics, and a reliance on simulated rather than real data. In this paper we report the collection of a standardised kinematic STF dataset from real-world STF events affecting parcel delivery workers and steelworkers. We further discuss the use of the data to evaluate dynamic stability control during locomotion for machine learning and build a standardised database. We present the data collection, discuss the classification of the data, present the totality of the data statistically, and compare it with existing databases. A significant research gap is the limited number of participants and focus on older populations in previous studies, as well as the reliance on simulated rather than real-world data. Our study addresses these gaps by providing a larger dataset of real-world STF events from a working population with physically demanding jobs. The population studied included 110 participants, consisting of 55 parcel delivery drivers and 55 steelworkers, both male and female, aged between 19 and 63 years. This diverse participant base allows for a more comprehensive understanding of STF incidents in different working environments.

Due to the excessive growth of PM 2.5 in aerosol, the cases of lung cancer are increasing rapidly and are most severe among other types as the highest mortality rate. In most of the cases, lung cancer is detected with least symptoms at its later stage. Hence, clinical records may play a vital role to diagnose this disease at the correct stage for suitable medication to cure it. To detect lung cancer an accurate prediction method is needed which is significantly reliable. In the digital clinical record era with advancement in computing algorithms including machine learning techniques opens an opportunity to ease the process. Various machine learning algorithms may be applied over realistic clinical data but the predictive power is yet to be comprehended for accurate results. This paper envisages to compare twelve potential machine learning algorithms over clinical data with eleven symptoms of lung cancer along with two major habits of patients to predict a positive case accurately. The result has been found based on classification and heat map correlation. K-Nearest Neighbor Model and Bernoulli Naive Bayes Model are found most significant methods for early lung cancer prediction., (© 2024. The Author(s).)

Reinforcement Learning (RL) is a significant machine learning subfield that emphasizes learning actions based on environment to obtain optimal behavior policy. RL agents can make decisions at variable time scales in the form of temporal abstractions, also known as options. The issue of discovering options has seen a considerable research effort. Most notably, the Interest Option Critic (IOC) algorithm first extends the initial set to the interest function, providing a method for learning options specialized to certain state space regions. This approach offers a specific attention mechanism for action selection. Unfortunately, this method still suffers from the classic issues of poor data efficiency and lack of flexibility in RL when learning options end-to-end through backpropagation. This paper proposes a new approach called Salience Interest Option Critic (SIOC), which chooses subsets of existing initiation sets for RL. Specifically, these subsets are not learned by backpropagation, which is slow and tends to overfit, but through particle filters. This approach enables the rapid and flexible identification of critical subsets using only reward feedback. We conducted experiments in discrete and continuous domains, and our proposed method demonstrate higher efficiency and flexibility than other methods. The generated options are more valuable within a single task and exhibited greater interpretability and reusability in multi-task learning scenarios., Competing Interests: Declaration of competing interest We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and/or company that could be construed as influencing the position presented in, or the review of, the manuscript entitled., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

The protein content (PC) and wet gluten content (WGC) are crucial indicators determining the quality of wheat, playing a pivotal role in evaluating processing and baking performance. Original reflectance (OR), wavelet feature (WF), and color index (CI) were extracted from hyperspectral and RGB sensors. Combining Pearson-competitive adaptive reweighted sampling (CARs)-variance inflation factor (VIF) with four machine learning (ML) algorithms were used to model accuracy of PC and WGC. As a result, three CIs, six ORs, and twelve WFs were selected for PC and WGC datasets. For single-modal data, the back-propagation neural network exhibited superior accuracy, with estimation accuracies (WF > OR > CI). For multi-modal data, the random forest regression paired with OR + WF + CI showed the highest validation accuracy. Utilizing the Gini impurity, WF outweighed OR and CI in the PC and WGC models. The amalgamation of MLs with multimodal data harnessed the synergies among various remote sensing sources, substantially augmenting model precision and stability., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

The sit-to-stand (STS) movement is fundamental in daily activities, involving coordinated motion of the lower extremities and trunk, which leads to the generation of joint moments based on joint angles and limb properties. Traditional methods for determining joint moments often involve sensors or complex mathematical approaches, posing limitations in terms of movement restrictions or expertise requirements. Machine learning (ML) algorithms have emerged as promising tools for joint moment estimation, but the challenge lies in efficiently selecting relevant features from diverse datasets, especially in clinical research settings. This study aims to address this challenge by leveraging metaheuristic optimization algorithms to predict joint moments during STS using minimal input data. Motion analysis data from 20 participants with varied mass and inertia properties are utilized, and joint angles are computed alongside simulations of joint moments. Feature selection is performed using the Manta Ray Foraging Optimization (MRFO), Marine Predators Algorithm (MPA), and Equilibrium Optimizer (EO) algorithms. Subsequently, Decision Tree Regression (DTR), Random Forest Regression (RFR), Extra Tree Regression (ETR), and eXtreme Gradient Boosting Regression (XGBoost Regression) ML algorithms are deployed for joint moment prediction. The results reveal EO-ETR as the most effective algorithm for ankle, knee, and neck joint moment prediction, while MPA-ETR exhibits superior performance for hip joint prediction. This approach demonstrates potential for enhancing accuracy in joint moment estimation with minimal feature input, offering implications for biomechanical research and clinical applications., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

This paper presents the topology and machine learning-based intelligent control of high-power PV inverter for maximum power extraction and optimal energy utilization. Modular converters with reduced components economic and reliable for high power applications. The proposed integrated intelligent machine learning based control delivers power conversion control with maximum power extraction and supervisory control for optimal load demand control. The topology of the inverter, operating modes, power control and supervisory control aspects are presented. Simulation is carried out in MATLAB/SIMULINK to verify the feasibility of the proposed inverter and control algorithm. The experimental study is presented to validate the simulation results. The operational performance of the proposed topology is evaluated in terms of operational parameters such as regulation of output power, and load relay control and is compared to existing topologies. The economic performance is also evaluated in terms of power switch sizing and reliability in power delivery concerning switch or power sources failure., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Srungaram, Yadlapati. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The rise of social media has changed how people view connections. Machine Learning (ML)-based sentiment analysis and news categorization help understand emotions and access news. However, most studies focus on complex models requiring heavy resources and slowing inference times, making deployment difficult in resource-limited environments. In this paper, we process both structured and unstructured data, determining the polarity of text using the TextBlob scheme to determine the sentiment of news headlines. We propose a Stochastic Gradient Descent (SGD)-based Ridge classifier (RC) for blending SGDR with an advanced string processing technique to effectively classify news articles. Additionally, we explore existing supervised and unsupervised ML algorithms to gauge the effectiveness of our SGDR classifier. The scalability and generalization capability of SGD and L2 regularization techniques in RCs to handle overfitting and balance bias and variance provide the proposed SGDR with better classification capability. Experimental results highlight that our string processing pipeline significantly boosts the performance of all ML models. Notably, our ensemble SGDR classifier surpasses all state-of-the-art ML algorithms, achieving an impressive 98.12% accuracy. McNemar's significance tests reveal that our SGDR classifier achieves a 1% significance level improvement over K-Nearest Neighbor, Decision Tree, and AdaBoost and a 5% significance level improvement over other algorithms. These findings underscore the superior proficiency of linear models in news categorization compared to tree-based and nonlinear counterparts. This study contributes valuable insights into the efficacy of the proposed methodology, elucidating its potential for news categorization and sentiment analysis., Competing Interests: Authors have no conflict of interest to declare., (Copyright: © 2024 Hasan et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

Objectives: In solving the trust issues surrounding machine learning algorithms whose reasoning cannot be understood, advancements can be made toward the integration of machine learning algorithms into mHealth applications. The aim of this paper is to provide a transparency layer to black-box machine learning algorithms and empower mHealth applications to maximize their efficiency., Methods: Using a machine learning testing framework, we present the process of knowledge transfer between a white-box model and a black-box model and the evaluation process to validate the success of the knowledge transfer., Results: The presentation layer of the final output of the base white-box model and the knowledge-infused white-box model shows clear differences in reasoning. The correlation between the base black-box model and the new knowledge-infused model is very high, indicating that the knowledge transfer was successful., Conclusion: There is a clear need for transparency in digital health and health in general. Adding solutions to the toolbox of explainable artificial intelligence is one way to gradually decrease the obscurity of black-box models., Competing Interests: Declaration of conflicting interestsThe authors declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

The considerable amount of energy utilized by buildings has led to various environmental challenges that adversely impact human existence. Predicting buildings' energy usage is commonly acknowledged as encouraging energy efficiency and enabling well-informed decision-making, ultimately leading to decreased energy consumption. Implementing eco-friendly architectural designs is paramount in mitigating energy consumption, particularly in recently constructed structures. This study utilizes clustering analysis on the original dataset to capture complex consumption patterns over various periods. The analysis yields two distinct subsets that represent low and high consumption patterns and an additional subset that exclusively encompasses weekends, attributed to the specific behavior of occupants. Ensemble models have become increasingly popular due to advancements in machine learning techniques. This research utilizes three discrete algorithms, namely Artificial Neural Network (ANN), K-nearest neighbors (KNN), and Decision Trees (DT). In addition, the application employs three more machine learning algorithms bagging and boosting: Random Forest (RF), Extreme Gradient Boosting (XGB), and Gradient Boosting Trees (GBT). To augment the accuracy of predictions, a stacking ensemble methodology is employed, wherein the forecasts generated by many algorithms are combined. Given the obtained outcomes, a thorough examination is undertaken, encompassing the techniques of stacking, bagging, and boosting, to conduct a comprehensive comparative study. It is pertinent to highlight that the stacking technique consistently exhibits superior performance relative to alternative ensemble methodologies across a spectrum of heterogeneous datasets. Furthermore, using a genetic algorithm enables the optimization of the combination of base learners, resulting in a notable enhancement in prediction accuracy. After implementing this optimization technique, GA-Stacking demonstrated remarkable performance in Mean Absolute Percentage Error (MAPE) scores. The improvement observed was substantial, surpassing 90 percent for all datasets. In addition, in subset-1, subset-2, and subset-3, the achieved R 2 scores were 0.983, 0.985, and 0.999, respectively. This represents a substantial advancement in forecasting the energy consumption of residential buildings. Such progress underscores the potential advantages of integrating this framework into the practices of building designers, thereby fostering informed decision-making, design management, and optimization prior to construction., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier Ltd.. All rights reserved.)

Objective: To leverage machine learning (ML) for fast selection of optimal regularization parameter in constrained image reconstruction., Methods: Constrained image reconstruction is often formulated as a regularization problem and selecting a good regularization parameter value is an essential step. We solved this problem using an ML-based approach by leveraging the finding that for a specific constrained reconstruction problem defined for a fixed class of image functions, the optimal regularization parameter value is weakly subject-dependent and the dependence can be captured using few experimental data. The proposed method has four key steps: a) solution of a given constrained reconstruction problem for a few (say, 3) pre-selected regularization parameter values, b) extraction of multiple approximated quality metrics from the initial reconstructions, c) predicting the true quality metrics values from the approximated values using pre-trained neural networks, and d) determination of the optimal regularization parameter by fusing the predicted quality metrics., Results: The effectiveness of the proposed method was demonstrated in two constrained reconstruction problems. Compared with L-curve-based method, the proposed method determined the regularization parameters much faster and produced substantially improved reconstructions. Our method also outperformed state-of-the-art learning-based methods when trained with limited experimental data., Conclusion: This paper demonstrates the feasibility and improved reconstruction quality by using machine learning to determine the regularization parameter in constrained reconstruction., Significance: The proposed method substantially reduces the computational burden of the traditional methods (e.g., L-curve) or relaxes the requirement of large training data by modern learning-based methods, thus enhancing the practical utility of constrained reconstruction.

Millions of patients suffer from rare diseases around the world. However, the samples of rare diseases are much smaller than those of common diseases. Hospitals are usually reluctant to share patient information for data fusion due to the sensitivity of medical data. These challenges make it difficult for traditional AI models to extract rare disease features for disease prediction. In this paper, we propose a Dynamic Federated Meta-Learning (DFML) approach to improve rare disease prediction. We design an Inaccuracy-Focused Meta-Learning (IFML) approach that dynamically adjusts the attention to different tasks according to the accuracy of base learners. Additionally, a dynamic weight-based fusion strategy is proposed to further improve federated learning, which dynamically selects clients based on the accuracy of each local model. Experiments on two public datasets show that our approach outperforms the original federated meta-learning algorithm in accuracy and speed with as few as five shots. The average prediction accuracy of the proposed model is improved by 13.28% compared with each hospital's local model.

Optimization and control of wastewater treatment process (WTP) can contribute to cost reduction and efficiency. A wastewater treatment process multi-objective optimization (WTPMO) framework is proposed in this paper to provide suggestions for decision-making in setting parameters of WTP. Firstly, the prediction models based on Extreme Gradient Boosting (XGB) with Bayesian optimization (BO) are developed for predicting effluent water quality (EQ) and energy consumption (EC) for different influent quality and process parameter settings. Then, the SHapley Additive exPlanations (SHAP) algorithm is used to complement the interpretability of machine learning to quantitatively evaluate the impact of different features on the predicted targets. Finally, the Non-dominated Sorting Genetic Algorithm II (NSGA-II) with the Technique for Ordering Preferences on Similarity of Ideal Solutions (TOPSIS) is introduced to solve and make decisions on the multi-objective optimization problem. The WTPMO applicability is validated on Benchmark Simulation Model 1 (BSM1). The results show that BOXGB achieves accurate prediction for EQ and EC with R 2 values of 0.923 and 0.965, respectively, indicating that BO can effectively select the model hyperparameters in XGB. Based on SHAP supplemented the interpretability of the model to fully explain how the influent water quality and decision variables affect the EQ and EC of the WTP. In addition, the optimized process parameters are determined based on NSGA-II and TOPSIS, and the EC optimization rate is 1.552% while guaranteeing water quality compliance. Overall, this research can effectively achieve the optimization of WTP, ensure that the effluent water quality meets the standards while reducing energy consumption, assist Wastewater treatment plants (WWTPs) to achieve more intelligent and efficient operation and maintenance management, and provide strong support for environmental protection and sustainable development goals., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024. Published by Elsevier Ltd.)

The increasing demand for smart vehicles with many sensing capabilities will escalate data traffic in vehicular networks. Meanwhile, available network resources are limited. The emergence of AI implementation in vehicular network resource allocation opens the opportunity to improve resource utilization to provide more reliable services. Accordingly, many resource allocation schemes with various machine learning algorithms have been proposed to dynamically manage and allocate network resources. This survey paper presents how machine learning is leveraged in the vehicular network resource allocation strategy. We focus our study on determining its role in the mechanism. First, we provide an analysis of how authors designed their scenarios to orchestrate the resource allocation strategy. Secondly, we classify the mechanisms based on the parameters they chose when designing the algorithms. Finally, we analyze the challenges in designing a resource allocation strategy in vehicular networks using machine learning. Therefore, a thorough understanding of how machine learning algorithms are utilized to offer a dynamic resource allocation in vehicular networks is provided in this study.

One of the most widely used measures of scientific impact is the number of citations. However, due to its heavy-tailed distribution, citations are fundamentally difficult to predict but can be improved. This study was aimed at investigating the factors and parts influencing the citation number of a scientific paper in the otology field. Therefore, this work proposes a new solution that utilizes machine learning and natural language processing to process English text and provides a paper citation as the predicted results. Different algorithms are implemented in this solution, such as linear regression, boosted decision tree, decision forest, and neural networks. The application of neural network regression revealed that papers' abstracts have more influence on the citation numbers of otological articles. This new solution has been developed in visual programming using Microsoft Azure machine learning at the back end and Programming Without Coding Technology at the front end. We recommend using machine learning models to improve the abstracts of research articles to get more citations. [ABSTRACT FROM AUTHOR]

The potential for machine learning to answer questions of environmental science, monitoring, and regulatory enforcement is evident, but there is cause for concern regarding potential embedded bias: algorithms can codify discrimination and exacerbate systematic gaps. This paper, organized into two halves, underscores the importance of vetting algorithms for bias when used for questions of environmental science and justice. In the first half, we present a case study of using machine learning for environmental justice-motivated research: prediction of drinking water quality. While performance varied across models and contaminants, some performed well. Multiple models had overall accuracy rates at or above 90 % and F2 scores above 0.60 on their respective test sets. In the second half, we dissect this algorithmic approach to examine how modeling decisions affect modeling outcomes - and not only how these decisions change whether the model is correct or incorrect, but for whom. We find that multiple decision points in the modeling process can lead to different predictive outcomes. More importantly, we find that these choices can result in significant differences in demographic characteristics of false negatives. We conclude by proposing a set of practices for researchers and policy makers to follow (and improve upon) when applying machine learning to questions of environmental science, management, and justice., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier B.V. All rights reserved.)

The broad learning system (BLS) is an effective machine learning model that exhibits excellent feature extraction ability and fast training speed. However, the traditional BLS is derived from the minimum mean square error (MMSE) criterion, which is highly sensitive to non-Gaussian noise. In order to enhance the robustness of BLS, this paper reconstructs the objective function of BLS based on the maximum multi-kernel correntropy criterion (MMKCC), and obtains a new robust variant of BLS (MKC-BLS). For the multitude of parameters involved in MMKCC, an effective parameter optimization method is presented. The fixed-point iteration method is employed to further optimize the model, and a reliable convergence proof is provided. In comparison to the existing robust variants of BLS, MKC-BLS exhibits superior performance in the non-Gaussian noise environment, particularly in the multi-modal noise environment. Experiments on multiple public datasets and real application validate the efficacy of the proposed method., Competing Interests: Declaration of competing interest We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and company ., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Shuffling-type gradient method is a popular machine learning algorithm that solves finite-sum optimization problems by randomly shuffling samples during iterations. In this paper, we explore the convergence properties of shuffling-type gradient method under mild assumptions. Specifically, we employ the bandwidth-based step size strategy that covers both monotonic and non-monotonic step sizes, thereby providing a unified convergence guarantee in terms of step size. Additionally, we replace the lower bound assumption of the objective function with that of the loss function, thereby eliminating the restrictions on the variance and the second-order moment of stochastic gradient that are difficult to verify in practice. For non-convex objectives, we recover the last iteration convergence of shuffling-type gradient algorithm with a less cumbersome proof. Meanwhile, we also establish the convergence rate for the minimum iteration of gradient norms. Under the Polyak-Łojasiewicz (PL) condition, we prove that the function value of last iteration converges to the lower bound of the objective function. By selecting appropriate boundary functions, we further improve the previous sublinear convergence rate results. Overall, this paper contributes to the understanding of shuffling-type gradient method and its convergence properties, providing insights for optimizing finite-sum problems in machine learning. Finally, numerical experiments demonstrate the efficiency of shuffling-type gradient method with bandwidth-based step size and validate our theoretical results., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Dictionary learning is an important sparse representation algorithm which has been widely used in machine learning and artificial intelligence. However, for massive data in the big data era, classical dictionary learning algorithms are computationally expensive and even can be infeasible. To overcome this difficulty, we propose new dictionary learning methods based on randomized algorithms. The contributions of this work are as follows. First, we find that dictionary matrix is often numerically low-rank. Based on this property, we apply randomized singular value decomposition (RSVD) to the dictionary matrix, and propose a randomized algorithm for linear dictionary learning. Compared with the classical K-SVD algorithm, an advantage is that one can update all the elements of the dictionary matrix simultaneously. Second, to the best of our knowledge, there are few theoretical results on why one can solve the involved matrix computation problems inexactly in dictionary learning. To fill-in this gap, we show the rationality of this randomized algorithm with inexact solving, from a matrix perturbation analysis point of view. Third, based on the numerically low-rank property and Nyström approximation of the kernel matrix, we propose a randomized kernel dictionary learning algorithm, and establish the distance between the exact solution and the computed solution, to show the effectiveness of the proposed randomized kernel dictionary learning algorithm. Fourth, we propose an efficient scheme for the testing stage in kernel dictionary learning. By using this strategy, there is no need to form nor store kernel matrices explicitly both in the training and the testing stages. Comprehensive numerical experiments are performed on some real-world data sets. Numerical results demonstrate the rationality of our strategies, and show that the proposed algorithms are much efficient than some state-of-the-art dictionary learning algorithms. The MATLAB codes of the proposed algorithms are publicly available from https://github.com/Jiali-yang/RALDL&#95;RAKDL., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Fluorescence intravital microscopy captures large data sets of dynamic multicellular interactions within various organs such as the lungs, liver, and brain of living subjects. In medical imaging, edge detection is used to accurately identify and delineate important structures and boundaries inside the images. To improve edge sharpness, edge detection frequently requires the inclusion of low-level features. Herein, a machine learning approach is needed to automate the edge detection of multicellular aggregates of distinctly labeled blood cells within the microcirculation. In this work, the Structured Adaptive Boosting Trees algorithm (AdaBoost.S) is proposed as a contribution to overcome some of the edge detection challenges related to medical images. Algorithm design is based on the observation that edges over an image mask often exhibit special structures and are interdependent. Such structures can be predicted using the features extracted from a bigger image patch that covers the image edge mask. The proposed AdaBoost.S is applied to detect multicellular aggregates within blood vessels from the fluorescence lung intravital images of mice exposed to e-cigarette vapor. The predictive capabilities of this approach for detecting platelet-neutrophil aggregates within the lung blood vessels are evaluated against three conventional machine learning algorithms: Random Forest, XGBoost and Decision Tree. AdaBoost.S exhibits a mean recall, F-score, and precision of 0.81, 0.79, and 0.78, respectively. Compared to all three existing algorithms, AdaBoost.S has statistically better performance for recall and F-score. Although AdaBoost.S does not outperform Random Forest in precision, it remains superior to the XGBoost and Decision Tree algorithms. The proposed AdaBoost.S is widely applicable to analysis of other fluorescence intravital microscopy applications including cancer, infection, and cardiovascular disease., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could be considered to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

The process of globalization and industrialization has resulted in a rise in the theft of coal and other related products, thereby becoming a focal point for forensic science. This situation has engendered an escalated demand for effective detection and monitoring technologies. The precise identification of coal trace evidence presents a challenge with current methods, owing to its minute quantity, fine texture, and intricate composition. In this study, we integrated machine learning with the identification of volatiles to accurately differentiate coal geographical origins through the application of headspace-gas chromatography-ion mobility spectrometry (HS-GC-IMS). The topographic distribution of volatiles in coals was visually depicted to elucidate the subtle distinctions through spectra and fingerprint analysis. Additionally, four supervised machine learning algorithms were developed to quantitatively predict the geographical origins of natural coals utilizing the HS-GC-IMS dataset, and these were subsequently compared with unsupervised models. Remarkable volatile compounds were identified through the quantitative analysis and optimal Random Forest model, which offered a rapid readout and achieved an average accuracy of 100 % in coal identification. Our findings indicate that the integration of HS-GC-IMS and machine learning is anticipated to enhance the efficiency and accuracy of coal geographical traceability, thereby providing a foundation for litigation and trials., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Fluorescence spectroscopy coupled with a random forest machine learning algorithm offers a promising non-invasive approach for diagnosing glycosuria, a condition characterized by excess sugar in the urine of diabetic patients. This study investigated the ability of this method to differentiate between diabetic and healthy control urine samples. Fluorescent spectra were captured from urine samples using a Xenon arc lamp emitting light within the 200 to 950 nm wavelength range, with consistent fluorescence emission observed at 450 nm under an excitation wavelength of 370 nm. Healthy control samples were also analyzed within the same spectral range for comparison. To distinguish spectral differences between healthy and infected samples, the random forest (RF) and K-Nearest Neighbors (KNN) machine learning algorithms have been employed. These algorithms automatically recognize spectral patterns associated with diabetes, enabling the prediction of unknown classifications based on established samples. Principal component analysis (PCA) was utilized for dimensionality reduction before feeding the data to RF and KNN for classification. The model's classification performance was evaluated using 10-fold cross-validation, resulting in the proposed RF-based model achieving accuracy of 96 %, specificity of 100 %, sensitivity of 93 %, and precision of 100 %. These results suggest that the proposed method holds promise for a more convenient and potentially more accurate method for diagnosing glycosuria in diabetic patients., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

The mislabelled Khao Dawk Mali 105 rice coming from other geographical region outside the Thung Kula Rong Hai region is extremely profitable and difficult to detect; to prevent retail fraud (that adversely affects both the food industry and consumers), it is vital to identify geographical origin. Near infrared spectroscopy can be used to detect the specific content of organic moieties in agricultural and food products. The present study implemented the combinatorial method of FT-NIR spectroscopy with chemometrics to identify geographical origin of Khao Dawk Mali 105 rice. Rice samples were collected from 2 different region including the north and northeast of Thailand. NIR spectra data were collected in range of 12,500 - 4,000 cm -1 (800-2,500 nm). Five machine learning algorithms including linear discriminant analysis (LDA), partial least squares discriminant analysis (PLS-DA), C-support vector classification (C-SVC), backpropagation neural networks (BPNN), hybrid principal component analysis-neural network (PC-NN) and K-nearest neighbors (KNN) were employed to classify NIR data of rice samples with full wavelength and selected wavelength by Extremely Randomized Trees (Extra trees) algorithm. Based on the findings, geographical origin of rice could be specified quickly, cheaply, and reliably using combination of NIRS and machine learning. All models creating by full wavelength and selected wavelength exhibited accuracy between 65 and 100 % for identifying geographical region of rice. It was proven that NIR spectroscopy may be used for the quick and non-destructive identification of geographical origin of Khao Dawk Mali 105 rice., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Background: Breast cancer remains a leading cause of female mortality worldwide, exacerbated by limited awareness, inadequate screening resources, and treatment options. Accurate and early diagnosis is crucial for improving survival rates and effective treatment., Objectives: This study aims to develop an innovative artificial intelligence (AI) based model for predicting breast cancer and its various histopathological grades by integrating multiple biomarkers and subject age, thereby enhancing diagnostic accuracy and prognostication., Methods: A novel ensemble-based machine learning (ML) framework has been introduced that integrates three distinct biomarkers-beta-human chorionic gonadotropin (β-hCG), Programmed Cell Death Ligand 1 (PD-L1), and alpha-fetoprotein (AFP)-alongside subject age. Hyperparameter optimization was performed using the Particle Swarm Optimization (PSO) algorithm, and minority oversampling techniques were employed to mitigate overfitting. The model's performance was validated through rigorous five-fold cross-validation., Results: The proposed model demonstrated superior performance, achieving a 97.93% accuracy and a 98.06% F1-score on meticulously labeled test data across diverse age groups. Comparative analysis showed that the model outperforms state-of-the-art approaches, highlighting its robustness and generalizability., Conclusion: By providing a comprehensive analysis of multiple biomarkers and effectively predicting tumor grades, this study offers a significant advancement in breast cancer screening, particularly in regions with limited medical resources. The proposed framework has the potential to reduce breast cancer mortality rates and improve early intervention and personalized treatment strategies., Competing Interests: Declaration of competing interest The authors state that the study provided in the paper was not impacted by any known competing financial or interpersonal interests., (Copyright © 2024 Elsevier B.V. All rights reserved.)

The Hybridization problem asks to reconcile a set of conflicting phylogenetic trees into a single phylogenetic network with the smallest possible number of reticulation nodes. This problem is computationally hard and previous solutions are limited to small and/or severely restricted data sets, for example, a set of binary trees with the same taxon set or only two non-binary trees with non-equal taxon sets. Building on our previous work on binary trees, we present FHyNCH, the first algorithmic framework to heuristically solve the Hybridization problem for large sets of multifurcating trees whose sets of taxa may differ. Our heuristics combine the cherry-picking technique, recently proposed to solve the same problem for binary trees, with two carefully designed machine-learning models. We demonstrate that our methods are practical and produce qualitatively good solutions through experiments on both synthetic and real data sets., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier Inc. All rights reserved.)

Objective: The aim of this study was to evaluate the accuracy of a combined approach based on an isotopological remeshing and statistical shape analysis (SSA) to capture key anatomical features of altered and intact premolars. Additionally, the study compares the capabilities of four Machine Learning (ML) algorithms in identifying or simulating tooth alterations., Methods: 113 premolar surfaces from a multicenter database were analyzed. These surfaces were processed using an isotopological remeshing method, followed by a SSA. Mean Euclidean distances between the initial and remeshed STL files were calculated to assess deviation in anatomical landmark positioning. Seven anatomical features were extracted from each tooth, and their correlations with shape modes and morphological characteristics were explored. Four ML algorithms, validated through three-fold cross-validation, were assessed for their ability to classify tooth types and alterations. Additionally, twenty intact teeth were altered and then reconstructed to verify the method's accuracy., Results: The first five modes encapsulated 76.1% of the total shape variability, with a mean landmark positioning deviation of 10.4 µm (±6.4). Significant correlations were found between shape modes and specific morphological features. The optimal ML algorithms demonstrated high accuracy (>83%) and precision (>86%). Simulations on intact teeth showed discrepancies in anatomical features below 3%., Conclusion: The combination of an isotopological remeshing with SSA showed good reliability in capturing key anatomical features of the tooth., Clinical Significance: The encouraging performance of ML algorithms suggests a promising direction for supporting practitioners in diagnosing and planning treatments for patients with altered teeth, ultimately improving preventive care., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier Ltd.. All rights reserved.)

In view of the problems of data sparsity and the diversity in academic paper recom-mender systems,based on CONVNCF, this paper proposed an algorithm of convolution with word and heterogeneous information network for academic paper recommendation ( WN -APR) . Firstly, WN -APR algorithm learned user and paper' s diverse features from different semantics to alleviate the sparsity problem. Then it designed an outer product fusing way to seamlessly combine user features with paper features. Replacing of 2D CNN, this algorithm applied 3 D convolution to mine the influence of different features on the performance. Finally, it modified the BPR loss function to enhance diversity in recommendations. Experimental results on CiteULike-a and CiteULike-t datasets show that WN-APR improves the performance of accuracy and diversity over the baseline models. [ABSTRACT FROM AUTHOR]

This work presents a novel approach for elbow gesture recognition using an array of inductive sensors and a machine learning algorithm (MLA). This paper describes the design of the inductive sensor array integrated into a flexible and wearable sleeve. The sensor array consists of coils sewn onto the sleeve, which form an LC tank circuit along with the externally connected inductors and capacitors. Changes in the elbow position modulate the inductance of these coils, allowing the sensor array to capture a range of elbow movements. The signal processing and random forest MLA to recognize 10 different elbow gestures are described. Rigorous evaluation on 8 subjects and data augmentation, which leveraged the dataset to 1270 trials per gesture, enabled the system to achieve remarkable accuracy of 98.3% and 98.5% using 5-fold cross-validation and leave-one-subject-out cross-validation, respectively. The test performance was then assessed using data collected from five new subjects. The high classification accuracy of 94% demonstrates the generalizability of the designed system. The proposed solution addresses the limitations of existing elbow gesture recognition designs and offers a practical and effective approach for intuitive human-machine interaction.

With cardiovascular diseases (CVD) remaining a leading cause of mortality, wearable devices for monitoring cardiac activity have gained significant, renewed interest among the medical community. This paper introduces an innovative ECG monitoring system based on a single-lead ECG machine, enhanced using machine learning methods. The system only processes and analyzes ECG data, but it can also be used to predict potential heart disease at an early stage. The wearable device was built on the ADS1298 and a microcontroller STM32L151xD. A server module based on the architecture style of the REST API was designed to facilitate interaction with the web-based segment of the system. The module is responsible for receiving data in real time from the microcontroller and delivering this data to the web-based segment of the module. Algorithms for analyzing ECG signals have been developed, including band filter artifact removal, K-means clustering for signal segmentation, and PQRST analysis. Machine learning methods, such as isolation forests, have been employed for ECG anomaly detection. Moreover, a comparative analysis with various machine learning methods, including logistic regression, random forest, SVM, XGBoost, decision forest, and CNNs, was conducted to predict the incidence of cardiovascular diseases. Convoluted neural networks (CNN) showed an accuracy of 0.926, proving their high effectiveness for ECG data processing.

The modern development of healthcare is characterized by a set of large volumes of tabular data for monitoring and diagnosing the patient's condition. In addition, modern methods of data engineering allow the synthesizing of a large number of features from an image or signals, which are presented in tabular form. The possibility of high-precision and high-speed processing of such large volumes of medical data requires the use of artificial intelligence tools. A linear machine learning model cannot accurately analyze such data, and traditional bagging, boosting, or stacking ensembles typically require significant computing power and time to implement. In this paper, the authors proposed a method for the analysis of large sets of medical data, based on a designed linear ensemble method with a non-iterative learning algorithm. The basic node of the new ensemble is an extended-input SGTM neural-like structure, which provides high-speed data processing at each level of the ensemble. Increasing prediction accuracy is ensured by dividing the large dataset into parts, the analysis of which is carried out in each node of the ensemble structure and taking into account the output signal from the previous level of the ensemble as an additional attribute on the next one. Such a design of a new ensemble structure provides both a significant increase in the prediction accuracy for large sets of medical data analysis and a significant reduction in the duration of the training procedure. Experimental studies on a large medical dataset, as well as a comparison with existing machine learning methods, confirmed the high efficiency of using the developed ensemble structure when solving the prediction task., (© 2024. The Author(s).)

Objectives: We evaluated methods for preparing electronic health record data to reduce bias before applying artificial intelligence (AI)., Methods: We created methods for transforming raw data into a data framework for applying machine learning and natural language processing techniques for predicting falls and fractures. Strategies such as inclusion and reporting for multiple races, mixed data sources such as outpatient, inpatient, structured codes, and unstructured notes, and addressing missingness were applied to raw data to promote a reduction in bias. The raw data was carefully curated using validated definitions to create data variables such as age, race, gender, and healthcare utilization. For the formation of these variables, clinical, statistical, and data expertise were used. The research team included a variety of experts with diverse professional and demographic backgrounds to include diverse perspectives., Results: For the prediction of falls, information extracted from radiology reports was converted to a matrix for applying machine learning. The processing of the data resulted in an input of 5,377,673 reports to the machine learning algorithm, out of which 45,304 were flagged as positive and 5,332,369 as negative for falls. Processed data resulted in lower missingness and a better representation of race and diagnosis codes. For fractures, specialized algorithms extracted snippets of text around keywork "femoral" from dual x-ray absorptiometry (DXA) scans to identify femoral neck T-scores that are important for predicting fracture risk. The natural language processing algorithms yielded 98% accuracy and 2% error rate The methods to prepare data for input to artificial intelligence processes are reproducible and can be applied to other studies., Conclusion: The life cycle of data from raw to analytic form includes data governance, cleaning, management, and analysis. When applying artificial intelligence methods, input data must be prepared optimally to reduce algorithmic bias, as biased output is harmful. Building AI-ready data frameworks that improve efficiency can contribute to transparency and reproducibility. The roadmap for the application of AI involves applying specialized techniques to input data, some of which are suggested here. This study highlights data curation aspects to be considered when preparing data for the application of artificial intelligence to reduce bias., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)