PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Clustering 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,531 records · Page 85Linked to original sources

ADAMIXTURE: adaptive first-order optimization for biobank-scale genetic clustering.

MOTIVATION: Estimating genetic clusters from sequencing data is a fundamental task in population and medical genetics, enabling demographic inference and adjustment for population structure in association studies. ADMIXTURE, a widely used model-based clustering method, employs an accelerated Expectation-Maximization (EM) algorithm to infer population parameters; however, its computational demands scale poorly, limiting its usefulness for modern biobank-sized datasets. While recent EM acceleration strategies employing second-order quasi-Newton schemes preserve accuracy, they remain computationally intensive. Conversely, EM-free approaches that prioritize speed often compromise solution quality. RESULTS: We introduce ADAMIXTURE, a novel optimization framework that integrates the EM algorithm with Adaptive Moment Estimation (Adam). Unlike traditional acceleration methods, ADAMIXTURE utilizes first-order gradients with adaptive learning rates derived from raw and squared moments to approximate curvature information, bypassing the computational overhead of Hessian approximations. This approach surpasses the convergence efficiency of second-order methods while maintaining the low computational complexity of first-order updates. Across simulated and large-scale empirical datasets, ADAMIXTURE demonstrates substantial reductions in wall-clock runtime and enhanced scalability compared to state-of-the-art methods, while maintaining comparable or improved inference accuracy. Its GPU implementation runs in under 2 h on half a million samples and variants, a two order of magnitude speedup over current state-of-the-art. AVAILABILITY AND IMPLEMENTATION: Source code is available at: https://github.com/AI-sandbox/ADAMIXTURE.

Clustering Algorithms↗

Model-based clustering of binary longitudinal atopic dermatitis disease histories by latent class mixture models.

Atopic dermatitis is a skin disease which affects mainly children, has a very strong genetical component, and manifests itself clinically as flexural excema in connection with torturing itching. The course of disease is notoriously changeable and runs in phases, therefore it is difficult to predict the future course of disease. To improve prediction it would be interesting to identify clusters of children with different disease histories because this would shed light on common genetic and environmental risk factors. We use, relying on previous work of Nagin, a Latent class mixture model to estimate, in a data-dependent and model-based fashion, a clustering of typical binary atopic dermatitis disease histories in children. The data were collected from 1990 to 1997 in the so called MAS-study, a prospective cohort study of 1314 children in five German cities. The original method of Nagin is extended in two different aspects, first we use bootstrap confidence intervals to account for uncertainty in curve fitting, and second, we propose to model covariates for cluster membership by Anderson's Stereotype regression model. We feel that the Latent class mixture model is a valuable tool for assessing the course of atopic dermatitis, yielding a wealth of communicable and graphically displayable results.

Algorithms↗

Accelerated K-means clustering in metric spaces.

The K-means method is a popular technique for clustering data into k-partitions. In the adaptive form of the algorithm, Lloyds method, an iterative procedure alternately assigns cluster membership based on a set of centroids and then redefines the centroids based on the computed cluster membership. The most time-consuming part of this algorithm is the determination of which points being clustered belong to which cluster center. This paper discusses the use of the vantage-point tree as a method of more quickly assigning cluster membership when the points being clustered belong to intrinsically low- and medium-dimensional metric spaces. Results will be discussed from simulated data sets and real-world data in the clustering of molecular databases based upon physicochemical properties. Comparisons will be made to a highly optimized brute-force implementation of Lloyd's method and to other pruning strategies.

Journal Article↗

Predicting structural models for silicon clusters.

This article introduces an efficient method to generate structural models for medium-sized silicon clusters. Geometrical information obtained from previous investigations of small clusters is initially sorted and then introduced into our predictor algorithm in order to generate structural models for large clusters. The method predicts geometries whose binding energies are close (95%) to the corresponding value for the ground-state with very low computational cost. These predictions can be used as a very good initial guess for any global optimization algorithm. As a test case, information from clusters up to 14 atoms was used to predict good models for silicon clusters up to 20 atoms. We believe that the new algorithm may enhance the performance of most optimization methods whenever some previous information is available.

Journal Article↗

A frailty model for informative censoring.

To account for the correlation between failure and censoring, we propose a new frailty model for clustered data. In this model, the risk to be censored is affected by the risk of failure. This model allows flexibility in the direction and degree of dependence between failure and censoring. It includes the traditional frailty model as a special case. It allows censoring by some causes to be analyzed as informative while treating censoring by other causes as noninformative. It can also analyze data for competing risks. To fit the model, the EM algorithm is used with Markov chain Monte Carlo simulations in the E-steps. Simulation studies and analysis of data for kidney disease patients are provided. Consequences of incorrectly assuming noninformative censoring are investigated.

Algorithms↗

Design and analysis of stepped wedge cluster randomized trials.

Cluster randomized trials (CRT) are often used to evaluate therapies or interventions in situations where individual randomization is not possible or not desirable for logistic, financial or ethical reasons. While a significant and rapidly growing body of literature exists on CRTs utilizing a "parallel" design (i.e. I clusters randomized to each treatment), only a few examples of CRTs using crossover designs have been described. In this article we discuss the design and analysis of a particular type of crossover CRT - the stepped wedge - and provide an example of its use.

Adolescent↗

CLASSIC: consistent longitudinal alignment and segmentation for serial image computing.

This paper proposes a temporally consistent and spatially adaptive longitudinal MR brain image segmentation algorithm, referred to as CLASSIC, which aims at obtaining accurate measurements of rates of change of regional and global brain volumes from serial MR images. The algorithm incorporates image-adaptive clustering, spatiotemporal smoothness constraints, and image warping to jointly segment a series of 3-D MR brain images of the same subject that might be undergoing changes due to development, aging, or disease. Morphological changes, such as growth or atrophy, are also estimated as part of the algorithm. Experimental results on simulated and real longitudinal MR brain images show both segmentation accuracy and longitudinal consistency.

Algorithms↗

Improving binding potential analysis in [11C]raclopride PET studies using cluster analysis.

To calculate binding potentials (BP) in [11C]raclopride brain PET studies a reference tissue model is widely used. The aim of the present study was to improve the determination of time activity curves (TAC) of reference tissue regions using cluster analysis. In four patients with Huntington disease TACs of a cerebellar reference region were calculated either from manually placed circular ROIs within the cerebellum or by cluster analysis. BP estimates derived from cluster analysis are independent from inter- and intraobserver variations and show an improved reproducibility combined with a low variability compared to manually placed cerebellar ROIs. This is of high value in longitudinal studies.

Adult↗

Comparison of semi-automated image analysis and manual methods for tissue quantification in pancreatic carcinoma.

Objective measurements of tissue area during histological examination of carcinoma can yield valuable prognostic information. However, such measurements are not made routinely because the current manual approach is time consuming and subject to large statistical sampling error. In this paper, a semi-automated image analysis method for measuring tissue area in histological samples is applied to the measurement of stromal tissue, cell cytoplasm and lumen in samples of pancreatic carcinoma and compared with the standard manual point counting method. Histological samples from 26 cases of pancreatic carcinoma were stained using the sirius red, light-green method. Images from each sample were captured using two magnifications. Image segmentation based on colour cluster analysis was used to subdivide each image into representative colours which were classified manually into one of three tissue components. Area measurements made using this technique were compared to corresponding manual measurements and used to establish the comparative accuracy of the semi-automated image analysis technique, with a quality assurance study to measure the repeatability of the new technique. For both magnifications and for each tissue component, the quality assurance study showed that the semi-automated image analysis algorithm had better repeatability than its manual equivalent. No significant bias was detected between the measurement techniques for any of the comparisons made using the 26 cases of pancreatic carcinoma. The ratio of manual to semi-automatic repeatability errors varied from 2.0 to 3.6. Point counting would need to be increased to be between 400 and 1400 points to achieve the same repeatability as for the semi-automated technique. The results demonstrate that semi-automated image analysis is suitable for measuring tissue fractions in histological samples prepared with coloured stains and is a practical alternative to manual point counting.

Algorithms↗

Statistical and Bayesian approaches to RNA secondary structure prediction.

Prediction of RNA secondary structure is a fundamental problem in computational structural biology. For several decades, free energy minimization has been the most popular method for prediction from a single sequence. In recent years, the McCaskill algorithm for computation of partition function and base-pair probabilities has become increasingly appreciated. This paradigm-shifting work has inspired the developments of extended partition function algorithms, statistical sampling and clustering, and application of Bayesian statistical inference. The performance of thermodynamics-based methods is limited by thermodynamic rules and parameters. However, further improvements may come from statistical estimates derived from structural databases for thermodynamics parameters with weak or little experimental data. The Bayesian inference approach appears to be promising in this context.

Algorithms↗

Cluster stability scores for microarray data in cancer studies.

BACKGROUND: A potential benefit of profiling of tissue samples using microarrays is the generation of molecular fingerprints that will define subtypes of disease. Hierarchical clustering has been the primary analytical tool used to define disease subtypes from microarray experiments in cancer settings. Assessing cluster reliability poses a major complication in analyzing output from clustering procedures. While most work has focused on estimating the number of clusters in a dataset, the question of stability of individual-level clusters has not been addressed. RESULTS: We address this problem by developing cluster stability scores using subsampling techniques. These scores exploit the redundancy in biologically discriminatory information on the chip. Our approach is generic and can be used with any clustering method. We propose procedures for calculating cluster stability scores for situations involving both known and unknown numbers of clusters. We also develop cluster-size adjusted stability scores. The method is illustrated by application to data three cancer studies; one involving childhood cancers, the second involving B-cell lymphoma, and the final is from a malignant melanoma study. AVAILABILITY: Code implementing the proposed analytic method can be obtained at the second author's website.

Algorithms↗

Identification of progression markers in B-CLL by gene expression profiling.

OBJECTIVE: B-cell chronic lymphocytic leukemia is a heterogeneous disease with a pronounced variation in the clinical course. With the purpose of identifying genes that could be related to disease progression, we have performed gene expression profiling on B-CLL patients with an indolent disease and patients with a progressive disease with need for therapy. MATERIALS AND METHODS: we applied the Affymetrix GeneChip technique to 11 B-CLL patients with stable and 10 patients with clinically progressive disease. Supervised and unsupervised clustering methods with different algorithms were used to identify genes that tend to give a distinction between stable and progressive disease. RESULTS: The supervised learning procedures identified groups of genes with a combined power to discriminate samples from progressive and stable disease with 70-90% accuracy. The gene for protein phosphatase 2 regulatory subunit B' (B56) gamma isoform (PPP2R5C) and the gene for retinoblastoma-like 2 (p130) (RBL2) were included among the best discriminators; both genes were downregulated in progressive as compared to stable B-CLL. In a hierarchical clustering analysis based on gene expression pattern three clinical subcategories could be identified: one with a more severe clinical outcome, a second one with good prognosis, and a third one that was intermediate between the other two groups. CONCLUSIONS: Our application of microarray analysis on a clinically well defined material has identified a number of genes with combined expression patterns related to stable or progressive disease in general. Unsupervised clustering suggested the existence of subclasses of samples in the progressive group that may be identifiable through gene expression patterns.

Aged↗

Automatic characterization and classification of ganglion cells from the salamander retina.

The classification of retinal ganglion cells according to their morphological features is addressed by using a comprehensive set of shape measures and several clustering strategies. The morphological features considered include many common measures (such as dendritic radii and the number of dendritic segments) and three new quantifiable measures: 1) the area of influence of the dendritic tree as calculated in an operator-independent manner by using Minkowski sausages; 2) the complexity of tortuousity along each dendritic segment as represented by the 3D bending energy; and 3) the coverage factor as calculated by using the Bouligand-Minkowski fractal dimension, which is more accurate than the commonly used box-counting algorithm. We evaluated four clustering approaches including the k-means and Ward's hierarchical clustering methods. By using these highly quantifiable methods to group the cells into classes, the present work has extended and reassessed the analysis of 68 ganglion cells from the tiger salamander previously classified by Toris et al. ([1995] J. Comp. Neurol. 352:535-559). Though substantiating the number of classes (5) previously proposed by Toris et al., the results obtained here indicate a number of discrepancies among the members of each class, especially regarding the border between two classes, originally called the medium simple and the medium complex cells. Such an effect has motivated the proposal of new names for the medium simple and medium complex classes, now called small highly complex and medium cells, respectively. Also included in the present article are comprehensive statistics of each class, correlations among all the adopted shape measures, and examples of the cells from each class. The resultant classes that emerged were compared using their electrotonic characteristics and physiological profiles.

Ambystoma↗

GIS approaches to the problem of disease clusters: a brief commentary.

This commentary considers issues raised in a recent article on GIS-based approaches to modeling disease clusters. 'Modeling exposure opportunities' (Sabel, Gatrell & Löytönen et al., 2000. Social Science and Medicine, 50, 1121-37) and the general problem of mapping disease clusters. It notes that the authors' advocate a fundamentally statistical approach, Kerneling estimation, to map the occurrence of a specific illness whose etiology is unknown. Epidemiologists, ironically, have advocated a fundamentally cartographic solution, the cartogram, in addressing the general problem of disease clusters. The advantages and limits of both approaches are reviewed and the potential for their comparison in a single study suggested. Most importantly, perhaps, the commentary seeks to join the epidemiological and medical geographic literatures as they pertain to this analytic problem and medical cartography's potential (GIS-based or traditional) to understand disease etiology.

Algorithms↗

COCO-CL: hierarchical clustering of homology relations based on evolutionary correlations.

MOTIVATION: Determining orthology relations among genes across multiple genomes is an important problem in the post-genomic era. Identifying orthologous genes can not only help predict functional annotations for newly sequenced or poorly characterized genomes, but can also help predict new protein-protein interactions. Unfortunately, determining orthology relation through computational methods is not straightforward due to the presence of paralogs. Traditional approaches have relied on pairwise sequence comparisons to construct graphs, which were then partitioned into putative clusters of orthologous groups. These methods do not attempt to preserve the non-transitivity and hierarchic nature of the orthology relation. RESULTS: We propose a new method, COCO-CL, for hierarchical clustering of homology relations and identification of orthologous groups of genes. Unlike previous approaches, which are based on pairwise sequence comparisons, our method explores the correlation of evolutionary histories of individual genes in a more global context. COCO-CL can be used as a semi-independent method to delineate the orthology/paralogy relation for a refined set of homologous proteins obtained using a less-conservative clustering approach, or as a refiner that removes putative out-paralogs from clusters computed using a more inclusive approach. We analyze our clustering results manually, with support from literature and functional annotations. Since our orthology determination procedure does not employ a species tree to infer duplication events, it can be used in situations when the species tree is unknown or uncertain. CONTACT: jothi@mail.nih.gov, przytyck@mail.nih.gov SUPPLEMENTARY INFORMATION: Supplementary materials are available at Bioinformatics online.

Algorithms↗

Segmentation of multivariate medical images via unsupervised clustering with "adaptive resolution".

The need for quantitative information is becoming increasingly important in the clinical field. In this paper we present an interactive X11 based system, devoted to segmentation of multivariate medical images, including an unsupervised neural network approach to clustering. The following steps are considered in the analysis sequence: feature extraction, reduction of dimensionality, unsupervised data clustering, voxel classification, interactive post-processing refinement. The environment turns out to be extremely interactive, thus making the user able to display and modify data during processing, to set parameters, to choose different methods and different tools for each step, and to define online the whole analysis sequence.

Algorithms↗

Spatial and spectral correlations in MALDI mass spectrometry images by clustering and multivariate analysis.

Matrix-assisted laser desorption/ionization mass spectrometry imaging is a technique for direct analysis of tissue sections without the use of molecular tags or contrast agents. The combination of spatial and mass resolution results in large and complex data sets that require powerful and efficient analysis and interpretation tools. Conventional images, derived from a specific analyte mass, do not identify the spatially localized correlations between analytes that are latent in the data. A new approach to find and visualize these correlations is presented. Clustering methods are used to classify pixels by spectral similarity, facilitating definition of distinct spatial regions. Principal component and discriminant analyses are combined to comprehensively identify changes in the mass spectra between regions. Images are generated by projecting the spectra of each pixel on the discriminant spectra; contrast is then a function of multiple correlated peaks.

Algorithms↗

Abdominal and erector spinae muscle activity during gait: the use of cluster analysis to identify patterns of activity.

OBJECTIVE: To describe patterns of muscle activation during gait in selected abdominal and lumbar muscles using cluster analysis. PARTICIPANTS: A sample of convenience of 38 healthy adult volunteers. Outcome measures. Electromyographic activity from the right internal and external obliques, rectus abdominis and lumbar erector spinae were recorded, and the root mean square values for each muscle were calculated throughout the stride in 5% epochs. These values were normalised to maximum effort isometric muscle contractions. Cluster analysis was used to identify groups of subjects with similar patterns of activity and activation levels. RESULTS: Cluster analysis identified two patterns of activity for the internal oblique, external oblique and rectus abdominis muscles. In the lumbar erector spinae, three patterns of activity were observed. In most instances, the patterns observed for each muscle differed in the magnitude of the activation levels. In rectus abdominis and external oblique muscles, the majority of subjects had low levels of activity (<5.0% of a maximum voluntary contraction) that were relatively constant throughout the stride cycle. In the internal oblique and the erector spinae muscles, more distinct bursts of activity were observed, most often close to foot-strike. The different algorithms used for the cluster analysis yielded similar results and a discriminant function analysis provided further evidence to support the patterns observed. CONCLUSIONS: Cluster analysis was useful in grouping subjects who had similar patterns of muscle activity. It provided evidence that there were subgroups that might otherwise not be observed if a group ensemble was presented as the "norm" for any particular muscle's role during gait. RELEVANCE: The identification of common variations in muscle activity may prove valuable in identifying individuals with electromyographic patterns that might influence their chances of sustaining injury. Alternatively, clusters may provide important information related to muscle activity in those that do well or otherwise after a particular injury.

Abdominal Muscles↗