SEARCH · PubMed Health

Results for “machine learning algorithms”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8Linked to original sources

PubMed2026

Revealing potential biomarkers and metabolic mechanisms of ovarian aging in hens during late laying period based on machine learning and metabolomics.

Ovarian function decline during the late laying period represents a major bottleneck for the economic efficiency of the global poultry industry. However, the underlying metabolic mechanisms and reliable early-warning biomarkers for ovarian aging remain poorly understood. In this study, we performed the first untargeted LC-MS/MS metabolomics analysis of ovarian tissues from Taihe silky fowls at peak laying (30 weeks) and late laying (50 weeks) stages, and employed an ensemble machine learning strategy integrating LASSO, random forest, and support vector machine (SVM) algorithms to identify high-confidence core biomarkers of ovarian aging. Gene expression analysis was further conducted to validate the potential molecular mechanisms. Our results showed that the metabolic profiles of ovarian tissues differed significantly between the two groups. A total of 6 core biomarkers were identified, 4 of which were long-chain acylcarnitines. Mechanistic analysis revealed that downregulation of key genes in the carnitine shuttle system led to impaired mitochondrial fatty acid β-oxidation, which in turn triggered excessive oxidative stress and compromised ovarian endocrine function. In conclusion, this study identifies long-chain acylcarnitines as potential metabolic biomarkers for ovarian aging in Taihe silky fowls. These findings provide novel insights into the metabolic basis of poultry ovarian aging and lay a theoretical foundation for the precise regulation of reproductive performance in indigenous poultry breeds.

Animals↗

PubMed2025

GiantHunter: accurate detection of giant virus in metagenomic data using reinforcement-learning and Monte Carlo tree search.

MOTIVATION: Nucleocytoplasmic large DNA viruses (NCLDVs) are notable for their large genomes and extensive gene repertoires, which contribute to their widespread environmental presence and critical roles in processes such as host metabolic reprogramming and nutrient cycling. Metagenomic sequencing has emerged as a powerful tool for uncovering novel NCLDVs in environmental samples. However, identifying NCLDV sequences in metagenomic data remains challenging due to their high genomic diversity, limited reference genomes, and shared regions with other microbes. Existing alignment-based and machine learning methods struggle with achieving optimal trade-offs between sensitivity and precision. RESULTS: In this work, we present GiantHunter, a reinforcement learning-based tool for identifying NCLDVs from metagenomic data. By employing a Monte Carlo tree search strategy, GiantHunter dynamically selects representative non-NCLDV sequences as the negative training data, enabling the model to establish a robust decision boundary. Benchmarking on rigorously designed experiments shows that GiantHunter achieves high precision while maintaining competitive sensitivity, improving the F1-score by 10% and reducing computational cost by 90% compared to the second-best method. To demonstrate its real-world utility, we applied GiantHunter to 60 metagenomic datasets collected from six cities along the Yangtze River, located both upstream and downstream of the Three Gorges Dam. The results reveal significant differences in NCLDV diversity correlated with proximity to the dam, likely influenced by reduced flow velocity caused by the dam. These findings highlight GiantHunter's potential to advance our understanding of NCLDVs and their ecological roles in diverse environments. AVAILABILITY AND IMPLEMENTATION: The source code of GiantHunter is available via: https://github.com/FuchuanQu/GiantHunter.

Metagenomics↗

PubMed2025

Evaluating the Antigen and Eplet Accuracy of DQA1 Imputations With the HaploSFHI Two-Field HLA Typing Inference Tool.

Donor/recipient mismatched HLA antigens can lead to the production of Donor-Specific Antibodies by the recipient, which are deleterious to organ transplants. The HLA-DQ locus is the most frequent target, with both the DQ beta and alpha chains involved. For deceased donors in particular, while HLA-DQB1 has been typed in emergencies for a long time, HLA-DQA1 has only recently been included. No imputation algorithmic tool was available to impute HLA-DQA1 until the development of HaploSFHI, trained on 61,393 two-field typings by NGS methods. We evaluated the accuracy of two-field HLA-DQA1 imputation from serological and two-field level HLA-A, B, DRB1, and DQB1 typings. We report a highly accurate two-field HLA-DQA1 prediction using a French test cohort of 7696 individuals, respectively reaching 92.30% and 96.45% accuracy. The average 'False Positive eplet load' stood at 0.19 and 0.07, respectively, and the average 'False Negative eplet load' at 0.18 and 0.08, respectively. A similar performance was obtained on three independent test cohorts of European ancestry (from the USA, the UK, and Portugal). Interestingly, performance was only slightly inferior on five independent test cohorts of other ethnicities (from Hong Kong and the USA) whereas it was significantly lower for two-field DRB1 imputation from its serological level. These results suggest that DQA1 can reliably be imputed even when information is totally missing, with low error risk at both antigen and eplet levels, even if the reference population is not matched. Similar additional initiatives would be welcome to confirm these findings.

Humans↗

PubMed2023

Unraveling Neuronal Identities Using SIMS: A Deep Learning Label Transfer Tool for Single-Cell RNA Sequencing Analysis.

Large single-cell RNA datasets have contributed to unprecedented biological insight. Often, these take the form of cell atlases and serve as a reference for automating cell labeling of newly sequenced samples. Yet, classification algorithms have lacked the capacity to accurately annotate cells, particularly in complex datasets. Here we present SIMS (Scalable, Interpretable Machine Learning for Single-Cell), an end-to-end data-efficient machine learning pipeline for discrete classification of single-cell data that can be applied to new datasets with minimal coding. We benchmarked SIMS against common single-cell label transfer tools and demonstrated that it performs as well or better than state of the art algorithms. We then use SIMS to classify cells in one of the most complex tissues: the brain. We show that SIMS classifies cells of the adult cerebral cortex and hippocampus at a remarkably high accuracy. This accuracy is maintained in trans-sample label transfers of the adult human cerebral cortex. We then apply SIMS to classify cells in the developing brain and demonstrate a high level of accuracy at predicting neuronal subtypes, even in periods of fate refinement, shedding light on genetic changes affecting specific cell types across development. Finally, we apply SIMS to single cell datasets of cortical organoids to predict cell identities and unveil genetic variations between cell lines. SIMS identifies cell-line differences and misannotated cell lineages in human cortical organoids derived from different pluripotent stem cell lines. When cell types are obscured by stress signals, label transfer from primary tissue improves the accuracy of cortical organoid annotations, serving as a reliable ground truth. Altogether, we show that SIMS is a versatile and robust tool for cell-type classification from single-cell datasets.

Brain organoids↗

PubMed2025

Disease candidate genes prediction using positive labeled and unlabeled instances.

Identifying disease genes and understanding their performance is critical in producing drugs for genetic diseases. Nowadays, laboratory approaches are not only used for disease gene identification but also using computational approaches like machine learning are becoming considerable for this purpose. In machine learning methods, researchers can only use two data types (disease genes and unknown genes) to predict disease candidate genes. Notably, there is no source for the negative data set. The proposed method is a two-step process: The first step is the extraction of reliable negative genes from a set of unlabeled genes by one-class learning and a filter based on distance indicators from known disease genes; this step is performed separately for each disease. The second step is the learning of a binary model using causing genes of each disease as a positive learning set and the reliable negative genes extracted from that disease. Each gene in the unlabeled gene's production and ranking step is assigned a normalized score using two filters and a learned model. Consequently, disease genes are predicted and ranked. The proposed method evaluation of various six diseases and Cancer class indicates better results than other studies.

Humans↗

PubMed2025

IgStrand: A universal residue numbering scheme for the immunoglobulin-fold (Ig-fold) to study Ig-proteomes and Ig-interactomes.

The Immunoglobulin fold (Ig-fold) is found in proteins from all domains of life and represents the most populous fold in the human genome, with current estimates ranging from 2 to 3% of protein coding regions. That proportion is much higher in the surfaceome where Ig and Ig-like domains orchestrate cell-cell recognition, adhesion and signaling. The ability of Ig-domains to reliably fold and self-assemble through highly specific interfaces represents a remarkable property of these domains, making them key elements of molecular interaction systems: the immune system, the nervous system, the vascular system and the muscular system. We define a universal residue numbering scheme, common to all domains sharing the Ig-fold in order to study the wide spectrum of Ig-domain variants constituting the Ig-proteome and Ig-Ig interactomes at the heart of these systems. The "IgStrand numbering scheme" enables the identification of Ig structural proteomes and interactomes in and between any species, and comparative structural, functional, and evolutionary analyses. We review how Ig-domains are classified today as topological and structural variants and highlight the "Ig-fold irreducible structural signature" shared by all of them. The IgStrand numbering scheme lays the foundation for the systematic annotation of structural proteomes by detecting and accurately labeling Ig-, Ig-like and Ig-extended domains in proteins, which are poorly annotated in current databases and opens the door to accurate machine learning. Importantly, it sheds light on the robust Ig protein folding algorithm used by nature to form beta sandwich supersecondary structures. The numbering scheme powers an algorithm implemented in the interactive structural analysis software iCn3D to systematically recognize Ig-domains, annotate them and perform detailed analyses comparing any domain sharing the Ig-fold in sequence, topology and structure, regardless of their diverse topologies or origin. The scheme provides a robust fold detection and labeling mechanism that reveals unsuspected structural homologies among protein structures beyond currently identified Ig- and Ig-like domain variants. Indeed, multiple folds classified independently contain a common structural signature, in particular jelly-rolls. Examples of folds that harbor an "Ig-extended" architecture are given. Applications in protein engineering around the Ig-architecture are straightforward based on the universal numbering.

Humans↗

PubMed1991

Asymmetric Boltzmann machines.

We study asymmetric stochastic networks from two points of view: combinatorial optimization and learning algorithms based on relative entropy minimization. We show that there are non trivial classes of asymmetric networks which admit a Lyapunov function L under deterministic parallel evolution and prove that the stochastic augmentation of such networks amounts to a stochastic search for global minima of L. The problem of minimizing L for a totally antisymmetric parallel network is shown to be associated to an NP-complete decision problem. The study of entropic learning for general asymmetric networks, performed in the non equilibrium, time dependent formalism, leads to a Hebbian rule based on time averages over the past history of the system. The general algorithm for asymmetric networks is tested on a feed-forward architecture.

Algorithms↗

PubMed2025

A robust transfer learning approach for high-dimensional linear regression to support integration of multi-source gene expression data.

Transfer learning aims to integrate useful information from multi-source datasets to improve the learning performance of target data. This can be effectively applied in genomics when we learn the gene associations in a target tissue, and data from other tissues can be integrated. However, heavy-tail distribution and outliers are common in genomics data, which poses challenges to the effectiveness of current transfer learning approaches. In this paper, we study the transfer learning problem under high-dimensional linear models with t-distributed error (Trans-PtLR), which aims to improve the estimation and prediction of target data by borrowing information from useful source data and offering robustness to accommodate complex data with heavy tails and outliers. In the oracle case with known transferable source datasets, a transfer learning algorithm based on penalized maximum likelihood and expectation-maximization algorithm is established. To avoid including non-informative sources, we propose to select the transferable sources based on cross-validation. Extensive simulation experiments as well as an application demonstrate that Trans-PtLR demonstrates robustness and better performance of estimation and prediction when heavy-tail and outliers exist compared to transfer learning for linear regression model with normal error distribution. Data integration, Variable selection, T distribution, Expectation maximization algorithm, Genotype-Tissue Expression, Cross validation.

Linear Models↗

PubMed2025

The signed two-space proximity model for learning representations in protein-protein interaction networks.

MOTIVATION: Accurately predicting complex protein-protein interactions (PPIs) is crucial for decoding biological processes, from cellular functioning to disease mechanisms. However, experimental methods for determining PPIs are computationally expensive. Thus, attention has been recently drawn to machine learning approaches. Furthermore, insufficient effort has been made toward analyzing signed PPI networks, which capture both activating (positive) and inhibitory (negative) interactions. To accurately represent biological relationships, we present the Signed Two-Space Proximity Model (S2-SPM) for signed PPI networks, which explicitly incorporates both types of interactions, reflecting the complex regulatory mechanisms within biological systems. This is achieved by leveraging two independent latent spaces to differentiate between positive and negative interactions while representing protein similarity through proximity in these spaces. Our approach also enables the identification of archetypes representing extreme protein profiles. RESULTS: S2-SPM's superior performance in predicting the presence and sign of interactions in SPPI networks is demonstrated in link prediction tasks against relevant baseline methods. Additionally, the biological prevalence of the identified archetypes is confirmed by an enrichment analysis of Gene Ontology (GO) terms, which reveals that distinct biological tasks are associated with archetypal groups formed by both interactions. This study is also validated regarding statistical significance and sensitivity analysis, providing insights into the functional roles of different interaction types. Finally, the robustness and consistency of the extracted archetype structures are confirmed using the Bayesian Normalized Mutual Information (BNMI) metric, proving the model's reliability in capturing meaningful SPPI patterns. AVAILABILITY: S2-SPM is implemented and freely available under the MIT license at https://github.com/Nicknakis/S2SPM.

Protein Interaction Mapping↗

PubMed2025

ASGCL: Adaptive Sparse Mapping-based graph contrastive learning network for cancer drug response prediction.

Personalized cancer drug treatment is emerging as a frontier issue in modern medical research. Considering the genomic differences among cancer patients, determining the most effective drug treatment plan is a complex and crucial task. In response to these challenges, this study introduces the Adaptive Sparse Graph Contrastive Learning Network (ASGCL), an innovative approach to unraveling latent interactions in the complex context of cancer cell lines and drugs. The core of ASGCL is the GraphMorpher module, an innovative component that enhances the input graph structure via strategic node attribute masking and topological pruning. By contrasting the augmented graph with the original input, the model delineates distinct positive and negative sample sets at both node and graph levels. This dual-level contrastive approach significantly amplifies the model's discriminatory prowess in identifying nuanced drug responses. Leveraging a synergistic combination of supervised and contrastive loss, ASGCL accomplishes end-to-end learning of feature representations, substantially outperforming existing methodologies. Comprehensive ablation studies underscore the efficacy of each component, corroborating the model's robustness. Experimental evaluations further illuminate ASGCL's proficiency in predicting drug responses, offering a potent tool for guiding clinical decision-making in cancer therapy.

Humans↗

PubMed2026

A benchmarking study of feature screening approaches across type 1 diabetes omics studies classification settings.

In recent years, high dimensional omics analyses have become more commonplace for investigating complex biological systems. Typically, these studies attempt to identify key biomolecules associated with a particular biological process. Often, machine learning (ML) is used to identify these biomolecules, typically by learning which biomolecules are highly predictive of a treatment, biological outcome, or phenotype. A major challenge of applying ML to high throughput omics is overcoming noise when sample size is limited and unbalanced with respect to tens of thousands of biomolecules measured. Thus, feature selection (the process of reducing the number of predictors) is both a critical and common step in the ML analysis pipeline. While much attention has been given to embedding and wrapping techniques for feature selection in the omics space, filter-based methods for model-free feature selection have appealing theoretical properties. This manuscript evaluates sure screening, a class of filter-based feature selection methods which provide analytical guarantees for true feature set retention. Here, we cover existing feature screening methods based on the sure screening principal, available software, methods to improve feature screening, and contextualize feature screening in the larger discussion of feature selection for omics data analysis. Additionally, a suite of model-free sure screening approaches is applied and compared for several omics biomedical applications in a ML classification context. We identified BcorSIS as the most effective and computationally efficient screening method across various omics datasets, consistently outperforming others like CSIS and DCSIS in runtime.

Humans↗

PubMed2026

Analysis of end-stage renal disease mediated by cuproptosis-related genes.

OBJECTIVE: The complex pathophysiological mechanism of end-stage renal disease (ESRD) has not been fully understood. Cuproptosis is a newly discovered type of programmed cell death. Therefore, this study attempts to clarify the relationship between cuproptosis-related genes (CRGs) and the phenotype of ESRD. MATERIALS AND METHODS: The National Center for Biological Information Gene Expression Omnibus database was applied to obtain the GSE37171 dataset comprising whole-genome microarray analysis of peripheral blood samples. A 3 : 1 case-control design was employed with 75 ESRD patients and 20 healthy controls who were frequency-matched for age, sex, and ethnicity. Based on differentially expressed genes (DEGs) and genes related to cuproptosis, CRGs were identified. Thereafter, we explored two different subpopulations based on the cuproptosis gene and analyzed their expression and immune infiltration. Genes specific to the CRG cluster were identified through the weighted gene co-expression network analysis algorithm, and the best prediction model was determined and verified by four machine learning methods. RESULTS: The study identified 14 differentially expressed CRGs, among which ATP7B, SLC31A1, LIAS, LIPT1, DLD, MTF1, CDKN2A, DBT, and DLST had relatively high expression levels in the ESRD samples. Compared with the control group, expression levels of FDX1, DLAT, PDHA1, PDHB, and GLS were significantly lower in the ESRD group, and CRGs played a key role in the regulation of immune infiltration in ESRD. Two cuproptosis-related molecular clusters were identified in the ESRD samples. Cluster2 was more correlated with the immune infiltration of ESRD. By analyzing the intersection points between CRG cluster and key genes of ESRD, a total of 888 specific DEGs were identified. Functional differences related to specific DEGs were further explored using gene set variation analysis. Five significant genes (SMC5, USP47, USP53, AGA, and DMXL1) were identified by the support vector machine model as key predictors for ESRD disease risk, achieving an area under the curve (AUC) of 1.00 in internal validation. However, external validation in independent cohorts is required prior to clinical application. Individual gene analysis showed an AUC > 0.81 in discriminating ESRD patients from healthy controls, and the expression of all 5 genes in ESRD patients was significantly lower than in the control group. CONCLUSION: This study clarified the relationship between CRGs and the phenotype of ESRD, analyzed their specific roles in the immune microenvironment, and obtained a predictive model, providing new insights for the study of its potential therapeutic targets.

Humans↗

PubMed2025

Effectidor II: a pan-genomic AI-based algorithm for the prediction of type III secretion system effectors.

MOTIVATION: Type III secretion systems are used by many Gram-negative bacteria to inject type 3 effectors (T3Es) directly into eukaryotic cells, promoting disease or provoking immune response. Because of these opposing evolutionary forces, T3E repertoires often vary within taxonomic groups. Identifying the full effector gene repertoire in genomes of related individuals is crucial for determining core and specialized effectors, understanding the disease dynamics, and developing appropriate management strategies against pathogens. It can also help uncover novel T3Es that have recently emerged in a population. Our previously published Effectidor web server successfully addressed the challenge of identifying T3Es in a single bacterial genome. Here, we enriched the web server with various novel capabilities, including the identification of T3Es from multiple genome sequences simultaneously. RESULTS: We present Effectidor II, a web server that relies on machine learning to predict T3E-encoding genes within bacterial pan-genomes. We demonstrate the benefit of learning based on features extracted from the entire sequences comprising the pan-genome and report a novel T3E discovered by it in Xanthomonas euroxanthea. AVAILABILITY AND IMPLEMENTATION: Effectidor II is available at: https://effectidor.tau.ac.il and the source code is available at: https://github.com/naamawagner/Effectidor. A stand-alone version of Effectidor II is available at: https://github.com/naamawagner/Effectidor/tree/StandAlone. The source code for the standalone version and the data used in this work are also provided in https://doi.org/10.5281/zenodo.15081636.

Type III Secretion Systems↗

PubMed2026

HyLnc: a hybrid deep learning and feature-based approach for long non-coding RNA prediction.

Long non-coding RNAs (lncRNAs) play important roles in gene regulation, development and disease, yet accurate identification of lncRNAs from transcriptomic data remains a major computational challenge. Existing methods often rely either on handcrafted sequence features or deep learning approaches, each with their inherent limitations in capturing the full complexity of RNA sequences. In this study, we proposed HyLnc, a computational framework that integrates transformer-based contextual embeddings with biologically meaningful sequence features for improved lncRNA prediction. A custom BERT-based model was first pre-trained on a large corpus of metazoan RNA sequences using a masked language modelling strategy to learn contextual nucleotide dependencies. The model was subsequently fine-tuned on curated datasets of lncRNAs and protein-coding transcripts and 256-dimensional deep sequence embeddings were extracted. Parallelly, 348 handcrafted features, including ORF characteristics, untranslated region (UTR) properties, nucleotide composition and Fickett scores, were computed. A multi-stage feature selection strategy was applied to identify the most informative features, resulting in optimized hybrid feature sets. Multiple machine learning classifiers were evaluated, with the RF model achieving the best performance. The proposed framework attained an accuracy of 91.30%, F1-score of 91.23% and MCC of 82.60 on an independent validation dataset, outperforming several existing lncRNA prediction tools. Thus, HyLnc demonstrates that integrating deep contextual representations with biologically interpretable features enhances lncRNA prediction. This approach provides a robust and scalable solution for large-scale transcriptome annotation and can be extended to other sequence-based prediction.

RNA, Long Noncoding↗

PubMed1993

Likelihood linkage analysis (LLA) classification method: an example treated by hand.

This paper describes a very general method of data analysis using a hierarchical classification. The data can be provided by observation, experiment or knowledge; their nature can be numerical, qualitative or logical. First, the classical view of the context of data representation, in which the algorithm of hierarchical ascendant construction of the classification tree is set, is treated in a synthetic manner. The main notion in our method is one of 'similarity'. This must be elaborated in the best way, taking into account the mathematical nature of the objects to be compared. Here we adopt a set of theoretical and combinatorial representation of the descriptive attributes, which are interpreted in terms of relations. Then we introduce a probability scale for similarity measurement by using a likelihood concept. The largest part of the paper concerns an illustrating example, moderately sized, detailing very minutely the different steps and the different calculations assumed by the method. The data structure handled with this example is the simplest possible. Then, general aspects and methodological extensions are evoked. We end by indicating the interest of the described approach in future works, in which we are involved, concerning typological organization of genetic sequences. We emphasize the 'explanation' aspect of the obtained results, with respect to a given description. For this purpose, classifications (on the object set and on the attribute set) on the one hand and machine learning techniques on the other, intervene efficiently.

Algorithms↗

PubMed2026

Machine learning to differentiate colonization from infection in multidrug-resistant Gram-negative bacteria: implications for further research.

PURPOSE OF REVIEW: Machine learning has emerged as a promising tool to support antimicrobial decision-making in infectious diseases. In colonized patients, distinguishing multidrug-resistant Gram-negative bacteria (MDR-GNB) colonization from true infection remains a major clinical challenge, as both delayed appropriate therapy in severe infections and unnecessary broad-spectrum antimicrobial use may adversely affect patient outcomes and antimicrobial stewardship. This review discusses the current evidence on machine learning models for predicting or detecting MDR-GNB infection in colonized patients, highlights key methodological limitations of the available literature, and outlines future research priorities. RECENT FINDINGS: Current evidence specifically evaluating machine learning models beyond logistic regression in MDR-GNB-colonized patients remains limited. Overall, while machine learning may achieve encouraging discriminatory performance, important methodological limitations persist. Most notably, predictive models are frequently developed in heterogeneous populations that do not reflect the clinically relevant populations of colonized patients in which treatment decisions are made. Furthermore, improvements in predictive performance remain modest, possibly reflecting limited sample sizes and data granularity rather than insufficient algorithmic complexity. In our opinion, future advances could require multicenter datasets enriched with longitudinal clinical, microbiological, and genomic information, together with automated feature extraction from electronic health records. SUMMARY: The main challenge for machine learning in predicting MDR-GNB infection in colonized patients may lie not in developing increasingly sophisticated algorithms, but in generating clinically representative datasets and adopting rigorous methodological standards for model development, validation, calibration, and implementation. Future research should prioritize clinically meaningful target populations and demonstrate improvements in patient outcomes and antimicrobial stewardship beyond conventional measures of predictive performance.

antimicrobial resistance↗

PubMed2025

A comparative study highlights superiority of LSTM in crop genomic prediction.

We systematically evaluated three key determinants affecting prediction accuracy and the algorithm performance differences based on fifteen state-of-the-art GP methods, and found LSTM suitable for capturing additive and epistatic effects. Genomic prediction (GP) has been developed as an important method supporting crop breeding. By utilizing the phenotype values result from GP, breeders could make decisions in the seedling stage that consequently benefit for cost saving. In recent years, machine learning emerged as an efficient technology to solve modeling problems in many fields, including crop breeding. However, numerous modeling approaches have hindered the application of GP since breeders struggle to choose. Therefore, a comprehensively methodological research with guiding significance is extremely necessary. In the present study, we systematically evaluated three key determinants affecting prediction accuracy and the algorithm performance differences based on fifteen state-of-the-art GP methods. As for genomic feature processing, we found feature selection (SNP filtering approach) performed better than feature extraction (PCA method). Specifically, the feature relationship dependent methods (GBLUP, RNN, and LSTM) as well as DNN architecture showed superior performance with feature selection. Marker density analysis showed positive correlation with prediction accuracy in a limited threshold. Comparison on effect of population size demonstrated a positive correlation between trait genetic complexity and the optimal population size required. By testing fifteen modeling methods, we found LSTM network displayed superior performance, achieving the highest average STScore (0.967) across six datasets. Further research using all cell states or the latest cell states of LSTM inputs demonstrated its architecture particularly adept with capturing additive and epistatic QTL effects among SNPs. In conclusion, our findings provide basic principles for implementing GP in breeding project to maximize prediction accuracy while maintaining cost-effectiveness.

Plant Breeding↗

PubMed1995

Machine learning in control of functional electrical stimulation systems for locomotion.

Two machine learning techniques were evaluated for automatic design of a rule-based control of functional electrical stimulation (FES) for locomotion of spinal cord injured humans. The task was to learn the invariant characteristics of the relationship between sensory information and the FES-control signal by using off-line supervised training. Sensory signals were recorded using pressure sensors installed in the insoles of a subject's shoes and goniometers attached across the joints of the affected leg. The FES-control consisted of pulses corresponding to time intervals when the subject pressed on the manual push-button to deliver the stimulation during FES-assisted ambulation. The machine learning techniques used were the adaptive logic network (ALN) [1] and the inductive learning algorithm (IL) [2]. Results to date suggest that, given the same training data, the IL learned faster than the ALN, while both performed the test rapidly. The generalization was estimated by measuring the test errors and it was better with an ALN, especially if past points were used to reflect the time dimension. Both techniques were able to predict future stimulation events. An advantage of the ALN over the IL was that ALN's can be retrained with new data without losing previously collected knowledge. The advantages of the IL over the ALN were that the IL produces small, explicit, comprehensible trees and that the relative importance of each sensory contribution can be quantified.

Adult↗