PubMed Health⌕ Search

PubMed · 16213694

Integrating regression formulas and kernel functions into locally adaptive knowledge-based neural networks: a case study on renal function evaluation.

Abstract

OBJECTIVE: In many medical areas, there exist different regression formulas to predict/evaluate a medical outcome on the same problem, each of them being efficient only in a particular sub-space of the problem space. The paper aims at the development of a generic, incremental learning model that includes all available regression formulas for a particular prediction problem to define local areas of the problem space with their best performing formula along with useful explanation rules. Another objective of the paper is to develop a specific model for renal function evaluation using nine existing formulas. METHODS AND MATERIALS: We have used a connectionist neuro-fuzzy approach and have developed a knowledge-based neural network model (KBNN) which incorporates and adapts incrementally several existing regression formulas and kernel functions. The model incorporates different non-linear regression functions as neurons in its hidden layer and adapts these functions through incremental learning from data in particular local areas of the space. More specifically, each hidden neural node has a pair of functions associated with it--one regression formula, that represents existing knowledge and one Gaussian kernel function, that defines the sub-space of the whole problem space, in which the formula is locally adapted to new data. All these functions are aggregated and changed through incremental learning. The proposed KBNN model is illustrated using a medical dataset of observed patient glomerular filtration rate (GFR) measurements for renal function evaluation. In this case study, the regression function for each cluster is selected by the model from nine formulas commonly used by medical practitioners to predict GFR. 441 GFR data vectors from 141 patients taken from 12 sites in Australia and New Zealand have been used as a case study experimental data set. RESULTS: The proposed GFR prediction model, based on the proposed generic KBNN model, outperforms at least by 10% accuracy any of the individual regression formulas or a standard neural network model. Furthermore, we have derived locally adapted regression formulas to perform best on local clusters of data along with useful explanatory rules. CONCLUSION: The proposed KBNN model manifests better accuracy then existing regression formulas or neural network models for renal function evaluation and extracts modified formulas that perform well in local areas of the problem space.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qun Song, Nikola Kasabov, Tianmin Ma, Mark Roger Marshall. 2005-10-06. Integrating regression formulas and kernel functions into locally adaptive knowledge-based neural networks: a case study on renal function evaluation.. https://doi.org/10.1016/j.artmed.2005.07.007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗