PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Classification 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 1,729 records · Page 96Linked to original sources

Diagnosis of the industrial systems by fuzzy classification.

The aim of this paper is to present a classifier based on a fuzzy inference system. For this classifier, we propose a parametrization method which is not necessarily based on an iterative training. This approach can be seen as a pre-parametrization which allows the determination of the rules base and the parameters of the membership functions. We also present a continuous and derivable version of the previous classifier and suggest an iterative learning algorithm based on a gradient method. An example using the learning basis IRIS, which is a benchmark for classification problems, is presented showing the performances of this classifier. Finally this classifier is applied to the diagnosis of a dc motor showing the effectiveness of this method.

Algorithms↗

Computer evaluation of Doppler spectral envelope area in patients having a valvular aortic stenosis.

The reliability of three algorithms to estimate the maximal and minimal frequency contours of Doppler spectrograms was evaluated in a group of 48 patients. Two algorithms had previously been used in the literature. These are the Modified Threshold Crossing Method and the Hybrid method. The third algorithm is new and is the Maximal Background Noise Threshold Crossing Method. A new approach was also proposed in the present study to estimate the background noise level of Doppler spectrograms. This level was used as a threshold in the computation of the spectral envelopes. Two diagnostic spectral parameters (the spectral envelope area and the systolic velocity integral) extracted from Doppler spectrograms recorded in the left ventricular outflow tract were also evaluated and tested to discriminate between 23 patients having no aortic pressure gradient and 25 patients with a stenotic aortic valve. Results describe the influence of the threshold level used in the Modified Threshold Crossing Method and the Hybrid method on the variability of the spectral contours. It is clearly demonstrated that the variability of minimal frequency contours is higher than that of maximal frequency contours. All three algorithms provided similar diagnostic performances with the spectral envelope area (71% to 73% of correct classifications) while the Maximal Background Noise Threshold Crossing Method and the Hybrid method provided the best results for the systolic velocity integral (69% of correct classifications). Because the systolic velocity integral combined with the continuity equation is used in the literature to evaluate noninvasively the aortic valve area, these results suggest the use of the spectral envelope area instead of the systolic velocity integral.

Aged↗

engGNN: a dual-graph neural network for omics-based disease classification and feature selection.

Omics data, such as transcriptomics, proteomics, and metabolomics, provide critical insights into disease mechanisms and clinical outcomes. However, their high dimensionality, small sample sizes, and intricate biological networks pose major challenges for reliable prediction and meaningful interpretation. Graph neural networks offer a promising way to integrate prior knowledge by encoding feature relationships as graphs. Yet, existing methods typically rely solely on either an externally curated feature graph or a data-driven generated graph, which limits their ability to capture complementary information. To address this, we propose the external and generated Graph Neural Network (engGNN), a dual-graph framework that jointly leverages both external biological networks and data-driven generated graphs. Specifically, engGNN constructs a biologically informed undirected feature graph from established network databases and complements it with a directed feature graph derived from tree-ensemble models. This dual-graph design produces more comprehensive representations, thereby improving predictive performance and interpretability. Through extensive simulation studies and real-world applications to three independent gene expression datasets, engGNN consistently demonstrates strong classification performance compared with competitive baselines. Beyond classification, engGNN provides feature- and source-level interpretability, enabling biologically meaningful analyses such as pathway enrichment analysis. Taken together, these results highlight engGNN as a robust, flexible, and interpretable framework for disease classification and biomarker discovery in high-dimensional omics contexts.

Graph Neural Networks↗

3D volume segmentation of MRA data sets using level sets: image processing and display.

In this article, we use a level set-based segmentation algorithm to extract the vascular tree from magnetic resonance angiography (MRA) data sets. The classification approach depends on initializing the level sets in the 3D volume, and the level sets evolve with time to yield the blood vessels. This work introduces a high-quality initialization for the level set functions, allowing extraction of the blood vessels in 3D and elimination of non-vessel tissues. A comparison between the 2D and 3D segmentation approaches is made. The results are validated using a phantom that simulates the MRA data and show good accuracy.

Algorithms↗

Protein motif extraction with neuro-fuzzy optimization.

MOTIVATION: It is attempted to improve the speed and flexibility of protein motif identification. The proposed algorithm is able to extract both rigid and flexible protein motifs. RESULTS: In this work, we present a new algorithm for extracting the consensus pattern, or motif, from a group of related protein sequences. This algorithm involves a statistical method to find short patterns with high frequency and then neural network training to optimize the final classification accuracies. Fuzzy logic is used to increase the flexibility of protein motifs. C2H2 Zinc Finger Protein and epidermal growth factor protein sequences are used to demonstrate the capability of the proposed algorithm in finding motifs. AVAILABILITY: This program is freely available for academic use by request.

Algorithms↗

Reduced bio basis function neural network for identification of protein phosphorylation sites: comparison with pattern recognition algorithms.

Protein phosphorylation is a post-translational modification performed by a group of enzymes known as the protein kinases or phosphotransferases (Enzyme Commission classification 2.7). It is essential to the correct functioning of both proteins and cells, being involved with enzyme control, cell signalling and apoptosis. The major problem when attempting prediction of these sites is the broad substrate specificity of the enzymes. This study employs back-propagation neural networks (BPNNs), the decision tree algorithm C4.5 and the reduced bio-basis function neural network (rBBFNN) to predict phosphorylation sites. The aim is to compare prediction efficiency of the three algorithms for this problem, and examine knowledge extraction capability. All three algorithms are effective for phosphorylation site prediction. Results indicate that rBBFNN is the fastest and most sensitive of the algorithms. BPNN has the highest area under the ROC curve and is therefore the most robust, and C4.5 has the highest prediction accuracy. C4.5 also reveals the amino acid 2 residues upstream from the phosporylation site is important for serine/threonine phosphorylation, whilst the amino acid 3 residues upstream is important for tyrosine phosphorylation.

Algorithms↗

Algorithms for mutant sorting: the need for phenotype vocabularies.

For effectively annotated phenotypes for mouse, a number of detailed phenotypic classification systems are needed. The rapidly increasing number of phenotypically described characteristics of both normal and mutant mice are providing a rich data set for comparison and analysis. However, we cannot rely on text descriptions that are subject to the word-usage style of the writer if we are to do large-scale comparative analysis of traits and diseases. The rationale for developing vocabularies and examples of several vocabularies being developed are described. Finally, the critical nature of community participation in both building and applying phenotype vocabularies is discussed.

Algorithms↗

Accuracy of nuclear classification in cervical smear images. Quantitative impact of computational deconvolution and 3-D feature computation.

OBJECTIVE: To investigate the accuracy with which the nuclei of cells in overlapped and thick clusters in cervical/ vaginal smears can be classified independent of the segmentation algorithm used and to determine the influence of three-dimensional (3-D) processing as compared to two-dimensional (2-D) methods on classification of the nuclei. STUDY DESIGN: Cell clusters were imaged from 31 ThinPrep smears composed of 808 nuclei, of which 420 were determined to be abnormal by a cytotechnologist. Sets of 2-D and 3-D volumetric features of the detected nuclei were formulated, and classifiers were constructed. The effect of computational deconvolution on classification was assessed using nearest-neighbor and Wiener filter in 2-D and 3-D before calculating features. A "best focus plane" was calculated for each nucleus from the 3-D data set, and the 2-D features in this plane were also analyzed.

Algorithms↗

A neural network classifier in experimental particle physics.

A classification problem in high energy physics has been solved on simulated data using a simple multilayer perceptron comprising binary units which was trained with the CHIR algorithm. The unstable training of such a network on a nonseparable set has been overcome by selecting those weight vectors with good performance while providing a flexible choice of the two types of classification errors. Specific features of the problem have been exploited in order to simplify and optimize the solution which has been compared to the popular backpropagation algorithm and found to perform on a similar level. Additional aspects of this work are the use of the CHIR algorithm on continuous input and incorporating the classic idea of a phi-machine in a multilayer perceptron.

Algorithms↗

Hidden Markov models of biological primary sequence information.

Hidden Markov model (HMM) techniques are used to model families of biological sequences. A smooth and convergent algorithm is introduced to iteratively adapt the transition and emission parameters of the models from the examples in a given family. The HMM approach is applied to three protein families: globins, immunoglobulins, and kinases. In all cases, the models derived capture the important statistical characteristics of the family and can be used for a number of tasks, including multiple alignments, motif detection, and classification. For K sequences of average length N, this approach yields an effective multiple-alignment algorithm which requires O(KN2) operations, linear in the number of sequences.

Algorithms↗

Predicting the genotoxicity of thiophene derivatives from molecular structure.

We report several binary classification models that directly link the genetic toxicity of a series of 140 thiophene derivatives with information derived from the compounds' molecular structure. Genetic toxicity was measured using an SOS Chromotest. IMAX (maximal SOS induction factor) values were recorded for each of the 140 compounds both in the presence and in the absence of S9 rat liver homogenate. Compounds were classified as genotoxic if IMAX >or= 1.5 in either test or nongenotoxic if IMAX < 1.5 for both tests. The molecular structures were represented by numerical descriptors that encoded the topological, geometric, electronic, and polar surface area properties of the thiophene derivatives. The classification models used were linear discriminant analysis (LDA), k-nearest neighbor classification (k-NN), and the probabilistic neural network (PNN). These were used in conjunction with either a genetic algorithm or a generalized simulated annealing to find optimal subsets of descriptors for each classifier. The quality of the resulting models was determined by the number of misclassified compounds, with preference given to models that produced fewer false negative classifications. Model sizes ranged from seven descriptors for LDA to three descriptors for k-NN and PNN. Very good classification results were obtained with all three classifiers. Classification rates for the LDA, k-NN, and PNN models were 80, 85, and 85%, respectively, for the prediction set compounds. Additionally, a consensus model was generated that incorporated all three of the basic model types. This consensus model correctly predicted the genotoxicity of 95% of the prediction set compounds.

DNA Damage↗

Robust neural-network-based classification of premature ventricular contractions using wavelet transform and timing interval features.

Automatic electrocardiogram (ECG) beat classification is essential to timely diagnosis of dangerous heart conditions. Specifically, accurate detection of premature ventricular contractions (PVCs) is imperative to prepare for the possible onset of life-threatening arrhythmias. Although many groups have developed highly accurate algorithms for detecting PVC beats, results have generally been limited to relatively small data sets. Additionally, many of the highest classification accuracies (> 90%) have been achieved in experiments where training and testing sets overlapped significantly. Expanding the overall data set greatly reduces overall accuracy due to significant variation in ECG morphology among different patients. As a result, we believe that morphological information must be coupled with timing information, which is more constant among patients, in order to achieve high classification accuracy for larger data sets. With this approach, we combined wavelet-transformed ECG waves with timing information as our feature set for classification. We used select waveforms of 18 files of the MIT/BIH arrhythmia database, which provides an annotated collection of normal and arrhythmic beats, for training our neural-network classifier. We then tested the classifier on these 18 training files as well as 22 other files from the database. The accuracy was 95.16% over 93,281 beats from all 40 files, and 96.82% over the 22 files outside the training set in differentiating normal, PVC, and other beats.

Algorithms↗

Principal component analysis and artificial neural network analysis of oral tissue fluorescence spectra: classification of normal premalignant and malignant pathological conditions.

Pulsed laser-induced autofluorescence spectroscopic studies of pathologically certified normal, premalignant, and malignant oral tissues were carried out at 325 nm excitation. The spectral analysis and classification for discrimination among normal, premalignant, and malignant conditions were performed using principal component analysis (PCA) and artificial neural network (ANN) separately on the same set of spectral data. In case of PCA, spectral residuals, Mahalanobis distance, and scores of factors were used for discrimination among normal, premalignant, and malignant cases. In ANN, parameters like mean, spectral residual, standard deviation, and total energy were used to train the network. The ANN used in this study is a classical multiplayer feed-forward type with a back-propagation algorithm for the training of the network. The specificity and sensitivity were determined in both classification schemes. In the case of PCA, they are 100 and 92.9%, respectively, whereas for ANN they are 100 and 96.5% for the data set considered.

Aged↗

Automatic detection of unstained viable cells in bright field images using a support vector machine with an improved training procedure.

Detection of unstained viable cells in bright field images is an inherently difficult task due to the immense variability of cell appearance. Traditionally, it has required human observers. However, in high-throughput robotic systems, an automatic procedure is essential. In this paper, we formulate viable cell detection as a supervised, binary pattern recognition problem and show that a support vector machine (SVM) with an improved training algorithm provides highly effective cell identification. In the case of cell detection, the binary classification problem generates two classes, one of which is much larger than the other. In addition, the total number of samples is extremely large. This combination represents a difficult problem for SVMs. We solved this problem with an iterative training procedure ("Compensatory Iterative Sample Selection", CISS). This procedure, which was systematically studied under various class size ratios and overlap conditions, was found to outperform several commonly used methods, primarily owing to its ability to choose the most representative samples for the decision boundary. Its speed and accuracy are sufficient for use in a practical system.

Algorithms↗

Tree-structured supervised learning and the genetics of hypertension.

This paper is about an algorithm, FlexTree, for general supervised learning. It extends the binary tree-structured approach (Classification and Regression Trees, CART) although it differs greatly in its selection and combination of predictors. It is particularly applicable to assessing interactions: gene by gene and gene by environment as they bear on complex disease. One model for predisposition to complex disease involves many genes. Of them, most are pure noise; each of the values that is not the prevalent genotype for the minority of genes that contribute to the signal carries a "score." Scores add. Individuals with scores above an unknown threshold are predisposed to the disease. For the additive score problem and simulated data, FlexTree has cross-validated risk better than many cutting-edge technologies to which it was compared when small fractions of candidate genes carry the signal. For the model where only a precise list of aberrant genotypes is predisposing, there is not a systematic pattern of absolute superiority; however, overall, FlexTree seems better than the other technologies. We tried the algorithm on data from 563 Chinese women, 206 hypotensive, 357 hypertensive, with information on ethnicity, menopausal status, insulin-resistant status, and 21 loci. FlexTree and Logic Regression appear better than the others in terms of Bayes risk. However, the differences are not significant in the usual statistical sense.

Algorithms↗

GISMO--gene identification using a support vector machine for ORF classification.

We present the novel prokaryotic gene finder GISMO, which combines searches for protein family domains with composition-based classification based on a support vector machine. GISMO is highly accurate; exhibiting high sensitivity and specificity in gene identification. We found that it performs well for complete prokaryotic chromosomes, irrespective of their GC content, and also for plasmids as short as 10 kb, short genes and for genes with atypical sequence composition. Using GISMO, we found several thousand new predictions for the published genomes that are supported by extrinsic evidence, which strongly suggest that these are very likely biologically active genes. The source code for GISMO is freely available under the GPL license.

Algorithms↗

Fast and accurate coarsening simulation with an unconditionally stable time step.

We present Cahn-Hilliard and Allen-Cahn numerical integration algorithms that are unconditionally stable and so provide significantly faster accuracy-controlled simulation. Our stability analysis is based on Eyre's theorem and unconditional von Neumann stability analysis, both of which we present. Numerical tests confirm the accuracy of the von Neumann approach, which is straightforward and should be widely applicable in phase-field modeling. For the Cahn-Hilliard case, we show that accuracy can be controlled with an unbounded time step Delta t that grows with time t as Delta t approximately t(alpha). We develop a classification scheme for the step exponent alpha and demonstrate that a class of simple linear algorithms gives alpha=1/3. For this class the speedup relative to a fixed time step grows with N, the linear size of the system, as N/ln N. With conservative choices for the parameters controlling accuracy and finite-size effects we find that an 8192(2) lattice can be integrated 300 times faster than with the Euler method.

Journal Article↗

Creating and validating an algorithm to measure AIDS mortality in the adult population using verbal autopsy.

BACKGROUND: Vital registration and cause of death reporting is incomplete in the countries in which the HIV epidemic is most severe. A reliable tool that is independent of HIV status is needed for measuring the frequency of AIDS deaths and ultimately the impact of antiretroviral therapy on mortality. METHODS AND FINDINGS: A verbal autopsy questionnaire was administered to caregivers of 381 adults of known HIV status who died between 1998 and 2003 in Manicaland, eastern Zimbabwe. Individuals who were HIV positive and did not die in an accident or during childbirth (74%; n = 282) were considered to have died of AIDS in the gold standard. Verbal autopsies were randomly allocated to a training dataset (n = 279) to generate classification criteria or a test dataset (n = 102) to verify criteria. A rule-based algorithm created to minimise false positives had a specificity of 66% and a sensitivity of 76%. Eight predictors (weight loss, wasting, jaundice, herpes zoster, presence of abscesses or sores, oral candidiasis, acute respiratory tract infections, and vaginal tumours) were included in the algorithm. In the test dataset of verbal autopsies, 69% of deaths were correctly classified as AIDS/non-AIDS, and it was not necessary to invoke a differential diagnosis of tuberculosis. Presence of any one of these criteria gave a post-test probability of AIDS death of 0.84. CONCLUSIONS: Analysis of verbal autopsy data in this rural Zimbabwean population revealed a distinct pattern of signs and symptoms associated with AIDS mortality. Using these signs and symptoms, demographic surveillance data on AIDS deaths may allow for the estimation of AIDS mortality and even HIV prevalence.

Adolescent↗