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

Boosting alternating decision trees modeling of disease trait information.

We applied the alternating decision trees (ADTrees) method to the last 3 replicates from the Aipotu, Danacca, Karangar, and NYC populations in the Problem 2 simulated Genetic Analysis Workshop dataset. Using information from the 12 binary phenotypes and sex as input and Kofendrerd Personality Disorder disease status as the outcome of ADTrees-based classifiers, we obtained a new quantitative trait based on average prediction scores, which was then used for genome-wide quantitative trait linkage (QTL) analysis. ADTrees are machine learning methods that combine boosting and decision trees algorithms to generate smaller and easier-to-interpret classification rules. In this application, we compared four modeling strategies from the combinations of two boosting iterations (log or exponential loss functions) coupled with two choices of tree generation types (a full alternating decision tree or a classic boosting decision tree). These four different strategies were applied to the founders in each population to construct four classifiers, which were then applied to each study participant. To compute average prediction score for each subject with a specific trait profile, such a process was repeated with 10 runs of 10-fold cross validation, and standardized prediction scores obtained from the 10 runs were averaged and used in subsequent expectation-maximization Haseman-Elston QTL analyses (implemented in GENEHUNTER) with the approximate 900 SNPs in Hardy-Weinberg equilibrium provided for each population. Our QTL analyses on the basis of four models (a full alternating decision tree and a classic boosting decision tree paired with either log or exponential loss function) detected evidence for linkage (Z >or= 1.96, p < 0.01) on chromosomes 1, 3, 5, and 9. Moreover, using average iteration and abundance scores for the 12 phenotypes and sex as their relevancy measurements, we found all relevant phenotypes for all four populations except phenotype b for the Karangar population, with suggested subgroup structure consistent with latent traits used in the model. In conclusion, our findings suggest that the ADTrees method may offer a more accurate representation of the disease status that allows for better detection of linkage evidence.

Algorithms↗

Classification of the intention to generate a shoulder versus elbow torque by means of a time-frequency synthesized spatial patterns BCI algorithm.

In this paper, we attempt to determine a subject's intention of generating torque at the shoulder or elbow, two neighboring joints, using scalp electroencephalogram signals from 163 electrodes for a brain-computer interface (BCI) application. To achieve this goal, we have applied a time-frequency synthesized spatial patterns (TFSP) BCI algorithm with a presorting procedure. Using this method, we were able to achieve an average recognition rate of 89% in four healthy subjects, which is comparable to the highest rates reported in the literature but now for tasks with much closer spatial representations on the motor cortex. This result demonstrates, for the first time, that the TFSP BCI method can be applied to separate intentions between generating static shoulder versus elbow torque. Furthermore, in this study, the potential application of this BCI algorithm for brain-injured patients was tested in one chronic hemiparetic stroke subject. A recognition rate of 76% was obtained, suggesting that this BCI method can provide a potential control signal for neural prostheses or other movement coordination improving devices for patients following brain injury.

Adult↗

Magnetic resonance urography by virtual reality modelling.

PURPOSE: The purpose of this study was to create a 3D visualization of the urinary tract by a novel virtual reality approach, and to evaluate the usefulness of this method for papillary classification as compared with 2D urogram obtained by maximum intensity projection (MIP). MATERIALS AND METHODS: In one healthy pig, magnetic resonance urography was performed using a T1-weighted 3D gradient echo pulse sequence. Post-processing was performed by means of an MIP algorithm and by using 3D virtual reality modelling, followed by manual classification of papillae as being either simple or compound. RESULTS: The 2D MIP urogram demonstrated 6 simple and 6 compound papillae, whereas the 3D urogram demonstrated 5 simple and 7 compound papillae. In both urograms, some papillae were unsuccessfully classified. CONCLUSION: The possibility of using virtual reality devices allowed 3D rotation and offered additional diagnostic information. However, further studies should reveal its feasibility in diseased kidneys.

Animals↗

Frequency component selection for an EEG-based brain to computer interface.

A new communication channel for severely handicapped people could be opened with a direct brain to computer interface (BCI). Such a system classifies electrical brain signals online. In a series of training sessions, where electroencephalograph (EEG) signals are recorded on the intact scalp, a classifier is trained to discriminate a limited number of different brain states. In a subsequent series of feedback sessions, where the subject is confronted with the classification results, the subject tries to reduce the number of misclassifications. In this study the relevance of different spectral components is analyzed: 1) on the training sessions to select optimal frequency bands for the feedback sessions and 2) on the feedback sessions to monitor changes.

Adult↗

Acoustic transient classification with a template correlation processor.

I present an architecture for acoustic pattern classification using trinary-trinary template correlation. In spite of its computational simplicity, the algorithm and architecture represent a method which greatly reduces bandwidth of the input, storage requirements of the classifier memory, and power consumption of the system without compromising classification accuracy. The linear system should be amenable to training using recently-developed methods such as Independent Component Analysis (ICA), and we predict that behavior will be qualitatively similar to that of structures in the auditory cortex.

Algorithms↗

Scene-segmentation algorithm development using error measures.

Development of scene-segmentation algorithms has generally been an ad hoc process. This paper presents a systematic technique for developing these algorithms using error-measure minimization. If scene segmentation is regarded as a problem of pixel classification whereby each pixel of a scene is assigned to a particular object class, development of a scene-segmentation algorithm becomes primarily a process of feature selection. In this study, four methods of feature selection were used to develop segmentation techniques for cervical cytology images: (1) random selection, (2) manual selection (best features in the subjective judgment of the investigator), (3) eigenvector selection (ranking features according to the largest contribution to each eigenvector of the feature covariance matrix) and (4) selection using the scene-segmentation error measure A2. Four features were selected by each method from a universe of 35 features consisting of gray level, color, texture and special pixel neighborhood features in 40 cervical cytology images . Evaluation of the results was done with a composite of the scene-segmentation error measure A2, which depends on the percentage of scenes with measurable error, the agreement of pixel class proportions, the agreement of number of objects for each pixel class and the distance of each misclassified pixel to the nearest pixel of the misclassified class. Results indicate that random and eigenvector feature selection were the poorest methods, manual feature selection somewhat better and error-measure feature selection best. The error-measure feature selection method provides a useful, systematic method of developing and evaluating scene-segmentation algorithms.

Computers↗

Automatic 3D segmentation and characterization of brain tissues in multiparametric MR image sequences.

In this paper a new segmentation method for automatic differentiation of normal and pathological brain tissues, based on multidimensional relaxation parameter histograms, is introduced. The developed histogram pyramid algorithm, which is an extension of histogram-based cluster analysis methods, is used for automatic analysis of multiparametric image data from several body slices simultaneously. The achieved segmentation results are improved by a following merging algorithm, which merges split tissue parts. Furthermore, tissue specific relaxation parameter values are computed within each 3D tissue segment and can be stored in a data base. Based on the tissue database, automatic tissue classifications are performed using statistical pattern recognition methods. Classified tissues are marked with tissue-specific colors and visualized in tissue class images. For clinical applications, the algorithms for 3D segmentation, visualization, and classification of tissue structures are integrated in the software system SAMSON (System for AutoMatic Segmentation and ClassificatiON of Tissue in Magnetic Resonance Tomography). With the software system SAMSON, a tissue database for intracranial tissues has been established based on the examination of 15 volunteers and 100 patients with neoplastic and other lesions--all verified histologically.

Algorithms↗

Using CISMeF MeSH "Encapsulated" terminology and a categorization algorithm for health resources.

INTRODUCTION: CISMeF is a Quality Controlled Health Gateway using a terminology based on the Medical Subject Headings (MeSH) thesaurus that displays medical specialties (metaterms) and the relationships existing between them and MeSH terms. OBJECTIVE: The need to classify the resources within the catalogue has led us to combine this type of semantic information with domain expert knowledge for health resources categorization purposes. MATERIAL AND METHODS: A two-step categorization process consisting of mapping resource keywords to CISMeF metaterms and ranking metaterms by decreasing coverage in the resource has been developed. We evaluate this algorithm on a random set of 123 resources extracted from the CISMeF catalogue. Our gold standard for this evaluation is the manual classification provided by a domain expert, viz. a librarian of the team. RESULTS: The CISMeF algorithm shows 81% precision and 93% recall, and 62% of the resources were assigned a "fully relevant" or "fairly relevant" categorization according to strict standards. DISCUSSION: A thorough analysis of the results has enabled us to find gaps in the knowledge modeling of the CISMeF terminology. The necessary adjustments having been made, the algorithm is currently used in CISMeF for resource categorization.

Abstracting and Indexing↗

Classification of mental tasks from EEG signals using extreme learning machine.

In this paper, a recently developed machine learning algorithm referred to as Extreme Learning Machine (ELM) is used to classify five mental tasks from different subjects using electroencephalogram (EEG) signals available from a well-known database. Performance of ELM is compared in terms of training time and classification accuracy with a Backpropagation Neural Network (BPNN) classifier and also Support Vector Machines (SVMs). For SVMs, the comparisons have been made for both 1-against-1 and 1-against-all methods. Results show that ELM needs an order of magnitude less training time compared with SVMs and two orders of magnitude less compared with BPNN. The classification accuracy of ELM is similar to that of SVMs and BPNN. The study showed that smoothing of the classifiers' outputs can significantly improve their classification accuracies.

Algorithms↗

Similarities and differences in the phenotype, genotype and pathogenesis of different spinocerebellar ataxias.

Historically, the differential diagnosis of the autosomal ataxias (ADCAs) has been difficult. In 1983 Harding proposed a useful clinical classification. Since 1983 ADCAs have been increasingly characterized in terms of their genetic locus and are referred to as spinocerebeller ataxia (SCA). The overlap between the SCA phenotypes and the high variability within SCA subgroups means that, for individual patients, the underlying mutation cannot be predicted reliable purely on the basis of clinical symptoms and so diagnosis should be made on the genotype. However, for executing DNA analyses in order of clinical likelihood, neurologists may try to deduce the underlying mutation by using a clinical algorithm. In this article we not only describe such an algorithm but also plot the pathway from clinical presentation, genetic classification and mutation, abnormal protein to common neuropathology in these disorders.

Genotype↗

Mapping and fuzzy classification of macromolecular images using self-organizing neural networks.

In this work the effectiveness of the fuzzy kohonen clustering network (FKCN) in the unsupervised classification of electron microscopic images of biological macromolecules is studied. The algorithm combines Kohonen's self-organizing feature maps (SOFM) and Fuzzy c-means (FCM) in order to obtain a powerful clustering technique with the best properties inherited from both. Exploratory data analysis using SOFM is also presented as a step previous to final clustering. Two different data sets obtained from the G40P helicase from B. Subtilis bacteriophage SPP1 have been used for testing the proposed method, one composed of 2458 rotational power spectra of individual images and the other composed by 338 images from the same macromolecule. Results of FKCN are compared with self-organizing feature maps (SOFM) and manual classification. Experimental results prove that this new technique is suitable for working with large, high-dimensional and noisy data sets and, thus, it is proposed to be used as a classification tool in electron microscopy.

Algorithms↗

Calibration transfer algorithm for automated qualitative analysis by passive Fourier transform infrared spectrometry

The automated qualitative analysis of passive Fourier transform infrared (FT-IR) remote sensing data is made difficult by the presence in the data of background and instrument-specific variation. For data collected with a single instrument, variation in the data arises from changes in the infrared background radiance, changes in the atmospheric composition within the field-of-view of the spectrometer, and changes in the instrument response function arising from temperature variation in the spectrometer. When more than one spectrometer is used, the variation in detector responses and phase signatures between instruments serves to complicate further the task of implementing an automated processing algorithm for detecting the signature of a target compound. In this work, a combination of signal processing and pattern recognition methodology is applied directly to the interferogram data collected by the FT-IR spectrometer to implement an automated compound detection procedure that is independent of background and instrument-specific variation. The key to this algorithm is the use of highly attenuating digital filters to isolate in the interferogram the frequencies associated with an analyte absorption or emission band while suppressing information at other frequencies. For the test compounds, acetone and sulfur hexafluoride, it is demonstrated that when this digital filtering procedure is coupled with either piecewise linear discriminant analysis or a back-propagation neural network, an automated detection algorithm can be developed with data from a primary instrument and then subsequently used to predict the presence of analyte signatures in data collected with a secondary spectrometer. Correct classification rates in excess of 92% are obtained for both compounds when the algorithm is applied to data collected with the secondary instrument.

Journal Article↗

An epidemiologic evaluation of two diagnostic classification schemes for temporomandibular disorders.

Few diagnostic classification schemes for temporomandibular disorders (TMD) have been applied systematically to examine the prevalence of various subtypes of TMD in clinic or community populations. In this study, computer algorithms were developed for classifying subjects according to the scheme of Eversole and Machado (1985) and a classification scheme recently developed in our own research at the University of Washington. The diagnostic algorithms were applied to clinical examination data for (1) persons without TMD pain (community controls) and (2) persons reporting TMD pain in the prior 6 months (community subjects with pain), identified in a random sample survey of a health maintenance organization (HMO) population, as well as (3) clinic patients seeking treatment for TMD through the same HMO. Prevalence rates for myofascial pain dysfunction in clinic patients were much higher under the University of Washington approach, whereas rates of internal derangement (type I) and degenerative joint disease were similar under the two schemes. These similar prevalence rates were not, however, accompanied by high concordance between the two schemes. These results highlight the complexities of differential diagnosis of TMD in field research, and suggest that further evaluation of alternative diagnostic schemes is warranted.

Adolescent↗

Structural classification of multi-input nonlinear systems.

We present new structural classification and parameter estimation results that are applicable to multi-input nonlinear systems. The mathematical relationships between the self- and cross-(Volterra and Wiener) kernels are derived for a basic two-input nonlinear structure. These results are then used to develop classification methods for more complicated two-input structures. Algorithms for estimating the parameters (linear and nonlinear subsystems) of these structures are also presented.

Cybernetics↗

Theoretical surgery: a new specialty in operative medicine.

Theoretical surgery is defined as a nonoperative decision analysis and clinical and basic research supporting system for surgery. It developed to meet the needs of academic surgeons to coordinate communication with basic science disciplines. This article summarizes the development of this idea at the University of Marburg where theoretical surgery has reached departmental and institutional proportions. Its objectives and methods are described. Central to its operation are permanent working teams of 2 clinical surgeons, 1 basic scientist (theoretical surgeon), 1-2 technicians, and 1-2 students focusing on one problem in a joint interdisciplinary manner. Decision analysis with classification methods and the creation of decision trees and algorithms are central to the operation of this experiment. Lessons learned from this academic experiment and the accomplishments during the past 20 years are summarized on 3 levels of efficacy: performance, changing strategies, and outcome.

Decision Support Techniques↗

Improved discrimination of breast lesions using selective sampling of segmented MR images.

OBJECTIVE: The aim of this work is to examine if the specificity of differentiation between malignant and benign tumours can be improved by retrospectively examining lesion-extracted distributions. A semi-automated method for selecting a region-of-interest (ROI) is described. A new histogram segmentation approach for sampling pharmacokinetic breast maps of transfer uptake is defined in order to assign classification variables for the lesion. METHOD: Fifty exchange rate parameter maps were extracted from 49 subjects and retrospectively analysed. Distributions obtained from semi-automatically delineated ROIs were subdivided into ten overlapping segments. Parameters were extracted from each segment which effectively presents a new pixel intensity sampling strategy. Mann-Whitney non-parametric tests and ROC curves were generated. RESULTS: Correlation exists between mean parameter values drawn from semi-automatically or manually drawn ROIs. However, the former yield higher specificity values as applied to this subset of enhancing benign lesions. Segmenting the exchange rate parameter histogram allows the identification of which part of the distribution correlates most with tumour type. Significant improvement in specificity is obtained when using half the pixels within the ROI. CONCLUSION: Improved specificity values are obtained by a new method of selecting the differentiation parameters which relies on intensity rather than spatial segmentation. Only half the pixels available within the ROI contributed to the measured classification parameters.

Adult↗

Vector dissimilarity and clustering.

Based on the description of objects by m attributes, an m-element vector dissimilarity function is defined that, unlike scalar functions, retains the distinction among attributes. This function, which satisfies the conditions for a metric, allows the definition of betweenness, which can then be used for clustering. Applications to the subset-generation phase of conditional clustering and to nearest-neighbor-type algorithms are described.

Classification↗

Non-linear statistical technique applied to data from baboon articular cartilage.

Pattern recognition software was developed and applied together with statistical techniques to articular cartilage data from the knee joint of the baboon. The standard statistical method used for comparison was ANOVA which indicates linear discrimination. In addition a Karhunen-Loève expansion was performed to reduce the dimensionality of the data and provide independent uncorrelated variables. Nearest neighbour analysis, a non-linear method, when combined with bionomial probabilities gave discrimination that was not obtained by ANOVA. Use of pattern recognition and related techniques can improve and extend the analysis of biological data to include non-linear discrimination and classification.

Algorithms↗