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,639 records · Page 91Linked to original sources

A regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data.

BACKGROUND: As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heterogeneous data sources. METHODS: In this paper, we address this issue by proposing a general framework for gene function prediction based on the k-nearest-neighbor (KNN) algorithm. The choice of KNN is motivated by its simplicity, flexibility to incorporate different data types and adaptability to irregular feature spaces. A weakness of traditional KNN methods, especially when handling heterogeneous data, is that performance is subject to the often ad hoc choice of similarity metric. To address this weakness, we apply regression methods to infer a similarity metric as a weighted combination of a set of base similarity measures, which helps to locate the neighbors that are most likely to be in the same class as the target gene. We also suggest a novel voting scheme to generate confidence scores that estimate the accuracy of predictions. The method gracefully extends to multi-way classification problems. RESULTS: We apply this technique to gene function prediction according to three well-known Escherichia coli classification schemes suggested by biologists, using information derived from microarray and genome sequencing data. We demonstrate that our algorithm dramatically outperforms the naive KNN methods and is competitive with support vector machine (SVM) algorithms for integrating heterogenous data. We also show that by combining different data sources, prediction accuracy can improve significantly CONCLUSION: Our extension of KNN with automatic feature weighting, multi-class prediction, and probabilistic inference, enhance prediction accuracy significantly while remaining efficient, intuitive and flexible. This general framework can also be applied to similar classification problems involving heterogeneous datasets.

Algorithms↗

Lightweight biometric detection system for human classification using pyroelectric infrared detectors.

We use pyroelectric detectors that are differential in nature to detect motion in humans by their heat emissions. Coded Fresnel lens arrays create boundaries that help to localize humans in space as well as to classify the nature of their motion. We design and implement a low-cost biometric tracking system by using off-the-shelf components. We demonstrate two classification methods by using data gathered from sensor clusters of dual-element pyroelectric detectors with coded Fresnel lens arrays. We propose two algorithms for person identification, a more generalized spectral clustering method and a more rigorous example that uses principal component regression to perform a blind classification.

Artificial Intelligence↗

Artificial intelligence techniques for bioinformatics.

This review provides an overview of the ways in which techniques from artificial intelligence (AI) can be usefully employed in bioinformatics, both for modelling biological data and for making new discoveries. The paper covers three techniques: symbolic machine learning approaches (nearest neighbour and identification tree techniques), artificial neural networks and genetic algorithms. Each technique is introduced and supported with examples taken from the bioinformatics literature. These examples include folding prediction, viral protease cleavage prediction, classification, multiple sequence alignment and microarray gene expression analysis.

Algorithms↗

Computational and performance aspects of PCA-based face-recognition algorithms.

Algorithms based on principal component analysis (PCA) form the basis of numerous studies in the psychological and algorithmic face-recognition literature. PCA is a statistical technique and its incorporation into a face-recognition algorithm requires numerous design decisions. We explicitly state the design decisions by introducing a generic modular PCA-algorithm. This allows us to investigate these decisions, including those not documented in the literature. We experimented with different implementations of each module, and evaluated the different implementations using the September 1996 FERET evaluation protocol (the de facto standard for evaluating face-recognition algorithms). We experimented with (i) changing the illumination normalization procedure; (ii) studying effects on algorithm performance of compressing images with JPEG and wavelet compression algorithms; (iii) varying the number of eigenvectors in the representation; and (iv) changing the similarity measure in the classification process. We performed two experiments. In the first experiment, we obtained performance results on the standard September 1996 FERET large-gallery image sets. In the second experiment, we examined the variability in algorithm performance on different sets of facial images. The study was performed on 100 randomly generated image sets (galleries) of the same size. Our two most significant results are (i) changing the similarity measure produced the greatest change in performance, and (ii) that difference in performance of +/- 10% is needed to distinguish between algorithms.

Algorithms↗

Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures.

BACKGROUND: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction. Thus far, however, they have been confined to representing 1D sequence (or the aspects of structure that could be represented by character strings). RESULTS: We develop an HMM formalism that explicitly uses 3D coordinates in its match states. The match states are modeled by 3D Gaussian distributions centered on the mean coordinate position of each alpha carbon in a large structural alignment. The transition probabilities depend on the spread of the neighboring match states and on the number of gaps found in the structural alignment. We also develop methods for aligning query structures against 3D HMMs and scoring the result probabilistically. For 1D HMMs these tasks are accomplished by the Viterbi and forward algorithms. However, these will not work in unmodified form for the 3D problem, due to non-local quality of structural alignment, so we develop extensions of these algorithms for the 3D case. Several applications of 3D HMMs for protein structure classification are reported. A good separation of scores for different fold families suggests that the described construct is quite useful for protein structure analysis. CONCLUSION: We have created a rigorous 3D HMM representation for protein structures and implemented a complete set of routines for building 3D HMMs in C and Perl. The code is freely available from http://www.molmovdb.org/geometry/3dHMM, and at this site we also have a simple prototype server to demonstrate the features of the described approach.

Algorithms↗

Feature selection and classification for microarray data analysis: evolutionary methods for identifying predictive genes.

BACKGROUND: In the clinical context, samples assayed by microarray are often classified by cell line or tumour type and it is of interest to discover a set of genes that can be used as class predictors. The leukemia dataset of Golub et al. 1 and the NCI60 dataset of Ross et al. 2 present multiclass classification problems where three tumour types and nine cell lines respectively must be identified. We apply an evolutionary algorithm to identify the near-optimal set of predictive genes that classify the data. We also examine the initial gene selection step whereby the most informative genes are selected from the genes assayed. RESULTS: In the absence of feature selection, classification accuracy on the training data is typically good, but not replicated on the testing data. Gene selection using the RankGene software 3 is shown to significantly improve performance on the testing data. Further, we show that the choice of feature selection criteria can have a significant effect on accuracy. The evolutionary algorithm is shown to perform stably across the space of possible parameter settings - indicating the robustness of the approach. We assess performance using a low variance estimation technique, and present an analysis of the genes most often selected as predictors. CONCLUSION: The computational methods we have developed perform robustly and accurately, and yield results in accord with clinical knowledge: A Z-score analysis of the genes most frequently selected identifies genes known to discriminate AML and Pre-T ALL leukemia. This study also confirms that significantly different sets of genes are found to be most discriminatory as the sample classes are refined.

Algorithms↗

Multi-aspect target discrimination using hidden Markov models and neural networks.

This paper presents a new multi-aspect pattern classification method using hidden Markov models (HMMs). Models are defined for each class, with the probability found by each model determining class membership. Each HMM model is enhanced by the use of a multilayer perception (MLP) network to generate emission probabilities. This hybrid system uses the MLP to find the probability of a state for an unknown pattern and the HMM to model the process underlying the state transitions. A new batch gradient descent-based method is introduced for optimal estimation of the transition and emission probabilities. A prediction method in conjunction with HMM model is also presented that attempts to improve the computation of transition probabilities by using the previous states to predict the next state. This method exploits the correlation information between consecutive aspects. These algorithms are then implemented and benchmarked on a multi-aspect underwater target classification problem using a realistic sonar data set collected in different bottom conditions.

Discriminant Analysis↗

A global view of pleiotropy and phenotypically derived gene function in yeast.

Pleiotropy, the ability of a single mutant gene to cause multiple mutant phenotypes, is a relatively common but poorly understood phenomenon in biology. Perhaps the greatest challenge in the analysis of pleiotropic genes is determining whether phenotypes associated with a mutation result from the loss of a single function or of multiple functions encoded by the same gene. Here we estimate the degree of pleiotropy in yeast by measuring the phenotypes of 4710 mutants under 21 environmental conditions, finding that it is significantly higher than predicted by chance. We use a biclustering algorithm to group pleiotropic genes by common phenotype profiles. Comparisons of these clusters to biological process classifications, synthetic lethal interactions, and protein complex data support the hypothesis that this method can be used to genetically define cellular functions. Applying these functional classifications to pleiotropic genes, we are able to dissect phenotypes into groups associated with specific gene functions.

Algorithms↗

Computer-assisted diagnosis: the classification of mammographic breast parenchymal patterns.

We have developed a method for the quantification of breast texture by using different algorithms to classify mammograms into the four patterns described by Wolfe (N1, P1, P2 and Dy). The computerized scheme employs craniocaudal views of conventional screen-film mammograms, which are digitized by a laser scanner. We used discriminant analysis to select among different feature-extraction techniques, including Fourier transform, local-contrast analysis, and grey-level distribution and quantification. The method has been evaluated on 117 clinical mammograms previously classified by five radiologists as to mammographic breast parenchymal patterns (MBPPS). The results show differences in agreement among radiologists and computer classification, depending on the Wolfe pattern: excellent for Dy (kappa = 0.77), good for P2 (kappa = 0.52) and N1 (kappa = 0.52) and poor for P1 (kappa = 0.22). Our quantitative texture measure as calculated from digital mammograms may be valuable to radiologists in their assessment of MBPP and therefore useful in establishing an index of risk for developing breast carcinoma.

Algorithms↗

Creating a note classification scheme for a multi-institutional electronic medical record.

How notes are categorized in an electronic medical record (EMR) influences how rapidly users can locate documents and enter new ones, whether algorithmic search for chart deficiencies is possible, and the ease of incorporating collections of existing notes. We balanced these competing needs when developing a note classification scheme for the Online Record of Clinical Activity (ORCA) electronic medical record at the University of Washington.

Academic Medical Centers↗

Multivariate information bottleneck.

The information bottleneck (IB) method is an unsupervised model independent data organization technique. Given a joint distribution, p(X, Y), this method constructs a new variable, T, that extracts partitions, or clusters, over the values of X that are informative about Y. Algorithms that are motivated by the IB method have already been applied to text classification, gene expression, neural code, and spectral analysis. Here, we introduce a general principled framework for multivariate extensions of the IB method. This allows us to consider multiple systems of data partitions that are interrelated. Our approach utilizes Bayesian networks for specifying the systems of clusters and which information terms should be maintained. We show that this construction provides insights about bottleneck variations and enables us to characterize the solutions of these variations. We also present four different algorithmic approaches that allow us to construct solutions in practice and apply them to several real-world problems.

Algorithms↗

[Research on EEG classification with evolving cascade neural networks].

To correctly classify EEG with different mental tasks, a new learning algorithm for Evolving Cascade Neural Networks (ECNNs) is described to avoid over-fitting of a neural network due to noise and redundant features. The learning algorithm calculates the value of a fitness function on validate set and accordingly updates the connection weights on training set. The learning algorithm uses the regularity criterion for selecting the neurons with relevant connection. If the value Cr calculated for the rth neuron is less than the value Cr-1 calculated for the previous (r-1) neuron, the features that feed the rth neuron are relevant, else they are irrelevant. An ECNN starts to learn with one input node and then, adding new inputs as well as new hidden neurons, evolves it. The trained ECNN has a nearly minimal number of input and hidden neurons as well as connections. The algorithm is applied to classify EEG with two mental tasks. The trained ECNN has correctly classified 83.1% of the testing segments. It shows a better result, compared with a standard BP network.

Algorithms↗

Mathematical algorithm for qualitative and semiquantitative analysis of petroleum hydrocarbons in solid wastes using on-line gas chromatography.

Non-degradated mineral-oils like gasoline, solvent naphtha, diesel fuel, fuel and lubricating oils provide a characteristic fingerprint gas chromatogram. This visual classification, e.g. in solid wastes, is complicated due to the simultaneous presence of several mineral-oils. Therefore, a mathematical algorithm for the separation of gas chromatographic fingerprint of "single mixtures" of aliphatic hydrocarbons is developed. The technique is essential for analysis of time-overlapping "single mixtures" of petroleum hydrocarbons (so-called "complex mixtures") and it relies on the concentration-varying hydrocarbons during evaporation. It is possible to separate the data from the gas chromatogram of a "complex mixture" of hydrocarbons into the chromatograms of the pure "single mixtures" and to give their respective concentrations. A synthetic "complex mixture" of kerosene, diesel fuel and lubricating oil is used to illustrate the method.

Algorithms↗

Inductive learning of thyroid functional states using the ID3 algorithm. The effect of poor examples on the learning result.

The ID3 algorithm for inductive learning was tested using preclassified material for patients suspected to have a thyroid illness. Classification followed a rule-based expert system for the diagnosis of thyroid function. Thus, the knowledge to be learned was limited to the rules existing in the knowledge base of that expert system. The learning capability of the ID3 algorithm was tested with an unselected learning material (with some inherent missing data) and with a selected learning material (no missing data). The selected learning material was a subgroup which formed a part of the unselected learning material. When the number of learning cases was increased, the accuracy of the program improved. When the learning material was large enough, an increase in the learning material did not improve the results further. A better learning result was achieved with the selected learning material not including missing data as compared to unselected learning material. With this material we demonstrate a weakness in the ID3 algorithm: it can not find available information from good example cases if we add poor examples to the data.

Algorithms↗

A comparison of methods for preoperative discrimination between malignant and benign adnexal masses: the development of a new logistic regression model.

OBJECTIVE: The aim of this study was to assess the complementary use of ultrasonographic end points with the level of circulating CA 125 antigen by multivariate logistic regression analysis algorithms to distinguish malignant from benign adnexal masses before operation. STUDY DESIGN: One hundred ninety-one patients aged 18 to 93 years with overt adnexal masses were examined by transvaginal ultrasonography with color Doppler imaging and 31 variables were recorded. The end points were the histologic classification of the tumor and the areas under the receiver-operator characteristic curves of alternative algorithms. RESULTS: One hundred forty patients had benign tumors and 51 (26.7%) had malignant tumors: 31 primary invasive tumors (37% International Federation of Gynecology and Obstetrics stage I), 5 tumors of borderline malignancy (100% International Federation of Gynecology and Obstetrics stage I), and 15 tumors were metastatic and invasive. The most useful variables for the logistic regression analysis were the menopausal status, the serum CA 125 level, the presence of >/=1 papillary growth (>3 mm in length), and a color score indicative of tumor vascularity and blood flow. The optimized procedure had a sensitivity of 95.9% and a specificity of 87.1%. The area under the receiver-operator characteristic curve was significantly higher (P <.01) than the corresponding values from the independent use of serum CA 125 levels or indexes of tumor form or vascularity. CONCLUSION: Regression analysis of a few complementary variables can be used to accurately discriminate between malignant and benign adnexal masses before operation.

Adnexal Diseases↗

A structural representation of migraine diagnostic criteria: the experts' view.

OBJECTIVE: To generate an empirically derived structural representation of migraine diagnostic criteria in a group of international headache experts using the Pathfinder network scaling algorithm in order to evaluate the validity of the migraine criteria used in the International Headache Society (IHS) classification system. BACKGROUND: Because it is a disease entity that lacks objective defining markers, developing valid diagnostic criteria for migraine is a challenge. The IHS committee relied on expert consensus to develop their classification system in 1988. Expert consensus also was used to evaluate the validity of the IHS classification system, but further studies employing alternative methods still are needed. METHODS: Headache experts representing the Executive Committee of the IHS and the Board of Directors of the American Headache Society analyzed 14 criteria (7 IHS and 7 non-IHS) considered relevant in diagnosing migraine. Their ratings were submitted to the Pathfinder algorithm to generate a network structure reflecting the experts' conceptualization of migraine diagnostic criteria. RESULTS: The expert network had 3 groupings: headache characteristics (eg, phonophobia, unilateral pain, throbbing pain), biological contributing factors (eg, family history, hormonal relationship, relief with sleep), and triggering factors (eg, worse with stress, food triggers). The IHS criteria were clustered together in the center portion of the network. A t test showed that each IHS criterion was closer conceptually to other IHS criteria than to non-IHS criteria. Graph theory indices revealed that the most central criteria were unilateral pain, moderate/severe intensity, and nausea/vomiting. CONCLUSION: The structural representation of migraine diagnostic criteria from these international headache experts is consistent with the migraine diagnostic criteria set forth in the IHS classification system and thus provides further support for the validity of migraine criteria in the IHS system.

Algorithms↗

Using noise signature to optimize spike-sorting and to assess neuronal classification quality.

We have developed a simple and expandable procedure for classification and validation of extracellular data based on a probabilistic model of data generation. This approach relies on an empirical characterization of the recording noise. We first use this noise characterization to optimize the clustering of recorded events into putative neurons. As a second step, we use the noise model again to assess the quality of each cluster by comparing the within-cluster variability to that of the noise. This second step can be performed independently of the clustering algorithm used, and it provides the user with quantitative as well as visual tests of the quality of the classification.

Action Potentials↗

The use of 3D surface fitting for robust polyp detection and classification in CT colonography.

In this paper we describe the development of a computationally efficient computer-aided detection (CAD) algorithm based on the evaluation of the surface morphology that is employed for the detection of colonic polyps in computed tomography (CT) colonography. Initial polyp candidate voxels were detected using the surface normal intersection values. These candidate voxels were clustered using the normal direction, convexity test, region growing and Gaussian distribution. The local colonic surface was classified as polyp or fold using a feature normalized nearest neighborhood classifier. The main merit of this paper is the methodology applied to select the robust features derived from the colon surface that have a high discriminative power for polyp/fold classification. The devised polyp detection scheme entails a low computational overhead (typically takes 2.20min per dataset) and shows 100% sensitivity for phantom polyps greater than 5mm. It also shows 100% sensitivity for real polyps larger than 10mm and 91.67% sensitivity for polyps between 5 to 10mm with an average of 4.5 false positives per dataset. The experimental data indicates that the proposed CAD polyp detection scheme outperforms other techniques that identify the polyps using features that sample the colon surface curvature especially when applied to low-dose datasets.

Algorithms↗