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 703 records · Page 39Linked to original sources

PubMed2004

Classification system and treatment of zygomatic arch fractures in the clinical setting.

A new classification system and algorithm of zygomatic arch fractures is described that provides the surgeon with a useful starting point from which to organize a valid treatment plan and management of zygomatic arch fractures. Hönig Merten (HM) class I is defined as an isolated tripod fracture, HM class II as an isolated stick fracture of the arch, and HM class III is a combined fracture of the malar bone and the zygomatic arch. Although reduction of the class I and II is usually closed, open reduction is mandatory in class III zygomatic arch fractures.

Algorithms↗

PubMed2006

Calcified cephalohematoma: classification, indications for surgery and techniques.

While calcified cephalohematoma is eminently correctable, a clear description of indications for surgery and surgical techniques are currently lacking in the literature. In this paper we propose a simple classification and an algorithm for the management of cephalohematomas. Three patients were treated for large calcified parietal cephalohematomas. Craniectomy and cranioplasty were performed with excellent outcome. Cranioplasty was performed with the cap radial craniectomy technique in two patients and the flip-over bull's-eye technique in one patient. The literature was reviewed on this entity and an algorithm based on the timing of presentation, extent of calcification and type of calcified cephalohematoma is proposed. Aspiration and compressive dressings can be used for early, incompletely calcified cephalohematomas. Calcified cephalohematoma causing significant distortion of the calvarium requires surgical correction and is classified as Types 1 or 2 depending on the contour of the inner lamella. Type 1, with a normal contoured inner lamella, can be corrected by ostectomy of the outer lamella. Type 2 calcified cephalohematoma has a depressed inner lamella. Elevation of the inner lamella is necessary and the cap radial craniectomy technique can be used. We describe a novel technique, the flip-over bull's-eye techniques as an alternative technique for Type 2 lesions in selected patients. In conclusion, calcified cephalohematomas can safely be treated surgically with excellent outcome. It is hoped that this algorithm will serve as a useful and logical guide in decision making for the management of this condition.

Algorithms↗

PubMed2000

X-ray videodensitometric methods for blood flow and velocity measurement: a critical review of literature.

Blood flow rate and velocity are important parameters for the study of vascular systems, and for the diagnosis, monitoring and evaluation of treatment of cerebro- and cardiovascular disease. For rapid imaging of cerebral and cardiac blood vessels, digital x-ray subtraction angiography has numerous advantages over other modalities. Roentgen-videodensitometric techniques measure blood flow and velocity from changes of contrast material density in x-ray angiograms. Many roentgen-videodensitometric flow measurement methods can also be applied to CT, MR and rotational angiography images. Hence, roentgen-videodensitometric blood flow and velocity measurement from digital x-ray angiograms represents an important research topic. This work contains a critical review and bibliography surveying current and old developments in the field. We present an extensive survey of English-language publications on the subject and a classification of published algorithms. We also present descriptions and critical reviews of these algorithms. The algorithms are reviewed with requirements imposed by neuro- and cardiovascular clinical environments in mind.

Algorithms↗

PubMed2002

Kernel-Kohonen networks.

We investigate the combination of the Kohonen networks with the kernel methods in the context of classification. We use the idea of kernel functions to handle products of vectors of arbitrary dimension. We indicate how to build Kohonen networks with robust classification performance by transformation of the original data vectors into a possibly infinite dimensional space. The resulting Kohonen networks preserve a non-Euclidean neighborhood structure of the input space that fits the properties of the data. We show how to optimize the transformation of the data vectors in order to obtain higher classification performance. We compare the kernel-Kohonen networks with the regular Kohonen networks in the context of a classification task.

Algorithms↗

PubMed2005

Online ranking by projecting.

We discuss the problem of ranking instances. In our framework, each instance is associated with a rank or a rating, which is an integer in 1 to k. Our goal is to find a rank-prediction rule that assigns each instance a rank that is as close as possible to the instance's true rank. We discuss a group of closely related online algorithms, analyze their performance in the mistake-bound model, and prove their correctness. We describe two sets of experiments, with synthetic data and with the EachMovie data set for collaborative filtering. In the experiments we performed, our algorithms outperform online algorithms for regression and classification applied to ranking.

Algorithms↗

PubMed1987

[Statistical indices of 201Tl distribution in the myocardium].

A study was made of the diagnostic potentialities of a histogram analysis of scintigraphic count distribution on myocardium scans using 201Tl in 9 patients with dilated cardiomyopathy, 12 patients with coronary heart disease and 6 patients with primary pulmonary hypertension. Scans were recorded 10 min., 4 and 24 h after a single administration of 201Tl at rest in the front-forward, 45 degrees left forward oblique and left lateral projections. The heart area on a scan was marked by hand. Count distribution was represented by an intensity histogram. An array of 243 scans was processed independently by 2 operators of different professional skill. A man-machine classification procedure with algorithm teaching was implemented. The author showed a possibility of group distinction by scintillation count distribution in the heart area on myocardium scans using 201Tl, the distinguishing information being within the interval of 41-80% of maximum intensity in this area. Automatic marking of the heart area on a scan was found necessary to have an entirely automated system for distinguishing groups of examinees.

Adolescent↗

PubMed2000

Fuzzy clustering analysis of the first 10 MEIC chemicals.

In this paper, we discuss the classification results of the toxicological responses of 32 in vivo and in vitro test systems to the first 10 MEIC chemicals. In this order we have used different fuzzy clustering algorithms, namely hierarchical fuzzy clustering, hierarchical and horizontal fuzzy characteristics clustering and a new clustering technique, namely fuzzy hierarchical cross-classification. The characteristics clustering technique produces fuzzy partitions of the characteristics (chemicals) involved and thus it is a useful tool for studying the (dis)similarities between different chemicals and for essential chemicals selection. The cross-classification algorithm produces not only a fuzzy partition of the test systems analyzed, but also a fuzzy partition of the considered 10 MEIC (multicentre evaluation of in vitro cytotoxicity) chemicals. In this way it is possible to identify which chemicals are responsible for the similarities or differences observed between different groups of test systems. In another way, there is a specific sensitivity of a chemical for one or more toxicological tests.

Algorithms↗

PubMed2005

Algorithms for rapid outbreak detection: a research synthesis.

The threat of bioterrorism has stimulated interest in enhancing public health surveillance to detect disease outbreaks more rapidly than is currently possible. To advance research on improving the timeliness of outbreak detection, the Defense Advanced Research Project Agency sponsored the Bio-event Advanced Leading Indicator Recognition Technology (BioALIRT) project beginning in 2001. The purpose of this paper is to provide a synthesis of research on outbreak detection algorithms conducted by academic and industrial partners in the BioALIRT project. We first suggest a practical classification for outbreak detection algorithms that considers the types of information encountered in surveillance analysis. We then present a synthesis of our research according to this classification. The research conducted for this project has examined how to use spatial and other covariate information from disparate sources to improve the timeliness of outbreak detection. Our results suggest that use of spatial and other covariate information can improve outbreak detection performance. We also identified, however, methodological challenges that limited our ability to determine the benefit of using outbreak detection algorithms that operate on large volumes of data. Future research must address challenges such as forecasting expected values in high-dimensional data and generating spatial and multivariate test data sets.

Algorithms↗

PubMed2006

Predicting carcinoid heart disease with the noisy-threshold classifier.

OBJECTIVE: To predict the development of carcinoid heart disease (CHD), which is a life-threatening complication of certain neuroendocrine tumors. To this end, a novel type of Bayesian classifier, known as the noisy-threshold classifier, is applied. MATERIALS AND METHODS: Fifty-four cases of patients that suffered from a low-grade midgut carcinoid tumor, of which 22 patients developed CHD, were obtained from the Netherlands Cancer Institute (NKI). Eleven attributes that are known at admission have been used to classify whether the patient develops CHD. Classification accuracy and area under the receiver operating characteristics (ROC) curve of the noisy-threshold classifier are compared with those of the naive-Bayes classifier, logistic regression, the decision-tree learning algorithm C4.5, and a decision rule, as formulated by an expert physician. RESULTS: The noisy-threshold classifier showed the best classification accuracy of 72% correctly classified cases, although differences were significant only for logistic regression and C4.5. An area under the ROC curve of 0.66 was attained for the noisy-threshold classifier, and equaled that of the physician's decision-rule. CONCLUSIONS: The noisy-threshold classifier performed favorably to other state-of-the-art classification algorithms, and equally well as a decision-rule that was formulated by the physician. Furthermore, the semantics of the noisy-threshold classifier make it a useful machine learning technique in domains where multiple causes influence a common effect.

Algorithms↗

PubMed2001

Assessment of heart disease using fuzzy classification techniques.

In this paper we discuss the classification results of cardiac patients of ischemical cardiopathy, valvular heart disease, and arterial hypertension, based on 19 characteristics (descriptors) including ECHO data, effort testings, and age and weight. In this order we have used different fuzzy clustering algorithms, namely hierarchical fuzzy clustering, hierarchical and horizontal fuzzy characteristics clustering, and a new clustering technique, fuzzy hierarchical cross-classification. The characteristics clustering techniques produce fuzzy partitions of the characteristics involved and, thus, are useful tools for studying the similarities between different characteristics and for essential characteristics selection. The cross-classification algorithm produces not only a fuzzy partition of the cardiac patients analyzed, but also a fuzzy partition of their considered characteristics. In this way it is possible to identify which characteristics are responsible for the similarities or dissimilarities observed between different groups of patients.

Adult↗

PubMed2003

A comparison of algorithms for detection of spikes in the electroencephalogram.

Identification of the short transient waveform, called a spike, in the cortical electroencephalogram (EEG) plays an important role during diagnosis of neurological disorders such as epilepsy. It has been suggested that artificial neural networks (ANN) can be employed for spike detection in the EEG, if suitable features are provided as input to an ANN. In this paper, we explore the performance of neural network-based classifiers using features selected by algorithms suggested by four previous investigators. Of these, three algorithms model the spike by mathematical parameters and use them as features for classification while the fourth algorithm uses raw EEG to train the classifier. The objective of this paper is to examine if there is any inherent advantage to any particular set of features, subject to the condition that the same data are used for all feature selection algorithms. Our results suggest that artificial neural networks trained with features selected using any one of the above three algorithms as well as raw EEG directly fed to the ANN will yield similar results.

Algorithms↗

PubMed1992

MATIC--an intracardiac tachycardia classification system.

The use of an additional atrial sensing electrode together with a morphology recognition algorithm provides a significant improvement in classification performance over the current rate based algorithms used in implantable cardioverter defibrillator (ICD) devices. The classification system, called morphology and timing intracardiac classifier (MATIC), follows a classification process similar to that used by cardiologists. Timing between the atrial and ventricular channels is examined using a decision tree and forms the primary criterion for arrhythmia classification. A neural network based morphology classifier is used for cases such as ventricular tachycardia with 1:1 retrograde conduction where timing alone cannot make a reliable decision. MATIC achieves 99.6% correct classification on a database of intracardiac electrogram (ICEG) signals containing 12,483 QRS complexes recorded from 67 patients during electrophysiological studies. Arrhythmias in this database include sinus tachycardia, normal sinus rhythm, normal sinus rhythm with bundle branch block, sinus tachycardia with bundle branch block, atrial fibrillation (AF), various supraventricular tachycardias, ventricular tachycardia, ventricular tachycardia with 1:1 retrograde conduction, and ventricular fibrillation. Within these arrhythmias, there were numerous ventricular ectopic beats, fusion beats, noise, and other artifacts. MATIC addresses the classification problem from start to finish, inputs being raw intracardiac electrogram signals and the outputs being the recommended ICD therapy. Results achieved with MATIC were compared with a classifier used in the Telectronics Guardian ATP 4210, which achieved 75.9% correct classification on the same database. MATIC is simple and efficient, making it suitable for use in a low power implantable device.

Defibrillators, Implantable↗

PubMedDate not supplied

Algorithm for naming molecular equivalence classes represented by labeled pseudographs.

The emergence of large chemical databases imposes a need for organizing the compounds in these databases. Mapping the chemical graph in particular, and a molecular equivalence class represented by a labeled pseudograph in general, to a unique number or string facilitates high-throughput browsing, grouping, and searching of the chemical database. Computing this number using a naming adaptation of the Morgan algorithm, we observed a large classification noise in which nonisomorphic graphs were mapped to the same number. Our extensions to that algorithm greatly reduced the classification noise.

Journal Article↗

PubMed2005

An EM algorithm for the block mixture model.

Although many clustering procedures aim to construct an optimal partition of objects or, sometimes, of variables, there are other methods, called block clustering methods, which consider simultaneously the two sets and organize the data into homogeneous blocks. Recently, we have proposed a new mixture model called block mixture model which takes into account this situation. This model allows one to embed simultaneous clustering of objects and variables in a mixture approach. We have studied this probabilistic model under the classification likelihood approach and developed a new algorithm for simultaneous partitioning based on the Classification EM algorithm. In this paper, we consider the block clustering problem under the maximum likelihood approach and the goal of our contribution is to estimate the parameters of this model. Unfortunately, the application of the EM algorithm for the block mixture model cannot be made directly; difficulties arise due to the dependence structure in the model and approximations are required. Using a variational approximation, we propose a generalized EM algorithm to estimate the parameters of the block mixture model and, to illustrate our approach, we study the case of binary data by using a Bernoulli block mixture.

Algorithms↗

PubMed2004

Joint classifier and feature optimization for comprehensive cancer diagnosis using gene expression data.

Recent research has demonstrated quite convincingly that accurate cancer diagnosis can be achieved by constructing classifiers that are designed to compare the gene expression profile of a tissue of unknown cancer status to a database of stored expression profiles from tissues of known cancer status. This paper introduces the JCFO, a novel algorithm that uses a sparse Bayesian approach to jointly identify both the optimal nonlinear classifier for diagnosis and the optimal set of genes on which to base that diagnosis. We show that the diagnostic classification accuracy of the proposed algorithm is superior to a number of current state-of-the-art methods in a full leave-one-out cross-validation study of five widely used benchmark datasets. In addition to its superior classification accuracy, the algorithm is designed to automatically identify a small subset of genes (typically around twenty in our experiments) that are capable of providing complete discriminatory information for diagnosis. Focusing attention on a small subset of genes is useful not only because it produces a classifier with good generalization capacity, but also because this set of genes may provide insights into the mechanisms responsible for the disease itself. A number of the genes identified by the JCFO in our experiments are already in use as clinical markers for cancer diagnosis; some of the remaining genes may be excellent candidates for further clinical investigation. If it is possible to identify a small set of genes that is indeed capable of providing complete discrimination, inexpensive diagnostic assays might be widely deployable in clinical settings.

Algorithms↗

PubMed2006

Fast voxel and polygon ray-tracing algorithms in intensity modulated radiation therapy treatment planning.

We present work on combining three algorithms to improve ray-tracing efficiency in radiation therapy dose computation. The three algorithms include: An improved point-in-polygon algorithm, incremental voxel ray tracing algorithm, and stereographic projection of beamlets for voxel truncation. The point-in-polygon and incremental voxel ray-tracing algorithms have been used in computer graphics and nuclear medicine applications while the stereographic projection algorithm was developed by our group. These algorithms demonstrate significant improvements over the current standard algorithms in peer reviewed literature, i.e., the polygon and voxel ray-tracing algorithms of Siddon for voxel classification (point-in-polygon testing) and dose computation, respectively, and radius testing for voxel truncation. The presented polygon ray-tracing technique was tested on 10 intensity modulated radiation therapy (IMRT) treatment planning cases that required the classification of between 0.58 and 2.0 million voxels on a 2.5 mm isotropic dose grid into 1-4 targets and 5-14 structures represented as extruded polygons (a.k.a. Siddon prisms). Incremental voxel ray tracing and voxel truncation employing virtual stereographic projection was tested on the same IMRT treatment planning cases where voxel dose was required for 230-2400 beamlets using a finite-size pencil-beam algorithm. Between a 100 and 360 fold cpu time improvement over Siddon's method was observed for the polygon ray-tracing algorithm to perform classification of voxels for target and structure membership. Between a 2.6 and 3.1 fold reduction in cpu time over current algorithms was found for the implementation of incremental ray tracing. Additionally, voxel truncation via stereographic projection was observed to be 11-25 times faster than the radial-testing beamlet extent approach and was further improved 1.7-2.0 fold through point-classification using the method of translation over the cross product technique.

Algorithms↗

PubMed2005

Parameters selection in gene selection using Gaussian kernel support vector machines by genetic algorithm.

In microarray-based cancer classification, gene selection is an important issue owing to the large number of variables and small number of samples as well as its non-linearity. It is difficult to get satisfying results by using conventional linear statistical methods. Recursive feature elimination based on support vector machine (SVM RFE) is an effective algorithm for gene selection and cancer classification, which are integrated into a consistent framework. In this paper, we propose a new method to select parameters of the aforementioned algorithm implemented with Gaussian kernel SVMs as better alternatives to the common practice of selecting the apparently best parameters by using a genetic algorithm to search for a couple of optimal parameter. Fast implementation issues for this method are also discussed for pragmatic reasons. The proposed method was tested on two representative hereditary breast cancer and acute leukaemia datasets. The experimental results indicate that the proposed method performs well in selecting genes and achieves high classification accuracies with these genes.

Algorithms↗

PubMed2005

An empirical comparison of nine pattern classifiers.

There are many learning algorithms available in the field of pattern classification and people are still discovering new algorithms that they hope will work better. Any new learning algorithm, beside its theoretical foundation, needs to be justified in many aspects including accuracy and efficiency when applied to real life problems. In this paper, we report the empirical comparison of a recent algorithm RM, its new extensions and three classical classifiers in different aspects including classification accuracy, computational time and storage requirement. The comparison is performed in a standardized way and we believe that this would give a good insight into the algorithm RM and its extension. The experiments also show that nominal attributes do have an impact on the performance of those compared learning algorithms.

Algorithms↗