Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.11581

COBI-GRINE: A Tool for Visualization and Advanced Evaluation of Communities in Mass Channel Similarity Graphs

Karsten Wüllems·Daniel Göbel·Annika Zurowietz·Hanna Bednarz·Karsten Niehaus·Tim W. Nattkemper
View original source ↗Read source document ↗Export metadata ↓

Abstract

The detection of groups of molecules that co-localize with histopathological patterns or sub-structures is an important step to combine the rich high-dimensional content of mass spectrometry imaging (MSI) with classic histopathological staining. Here we present the evolution of GRINE to COBI-GRINE, an interactive web tool that maps MSI data onto a graph structure to detect communities of laterally similar distributed molecules and co-visualizes the communities with Hematoxylin and Eosin (HE) stained images. Thereby the tool enables biologists and pathologists to examine the MSI image graph in a target-oriented manner and links molecular co-localization to pathology. Another feature is the manual optimization of cluster results with the assist of graph statistics in order to improve the community results. As the graphs can become very complex, those statistics provide good heuristics to support and accelerate the detection of sub-clusters and misclusterings. This kind of edited cluster optimization allows the integration of expert background knowledge into the clustering result and a more precise analysis of links between molecular co-localization and pathology.

Explore related subjects

stat.COq-bio.QM

Keep this discovery

BibTeXRIS

Karsten Wüllems, Daniel Göbel, Annika Zurowietz, Hanna Bednarz, Karsten Niehaus, Tim W. Nattkemper. 2020-09-24. COBI-GRINE: A Tool for Visualization and Advanced Evaluation of Communities in Mass Channel Similarity Graphs. https://arxiv.org/abs/2009.11581

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗
arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗