Skip to content
Review Open access

Clustering Spectral Line Cubes: A Multiview Prototype Approach

Sep 2026 · Astrophysical Journal · Vol 1009, pp. 99 · 0 citations · 69 references
Physics

TL;DR

The results show MPEC clustering is sensitive enough to extract very low signal-to-noise clusters, while being self-aware enough to discard any noise clustered in this process, and opens up new avenues for robustly analyzing astronomical spectral data.

Abstract

We present a new clustering paradigm to segment radio astronomy cubes based on unsupervised machine learning provided by a recent modification of self-organizing maps (SOMs) known as self-organizing uniform manifold approximation and projection (SOUMAP). SOUMAP simultaneously reduces sample size via neural vector quantization and learns an expressive UMAP-based low-dimensional embedding of data upon which further analysis can be based. Several similarity graphs learned by SOUMAP are combined into a single multiview similarity graph upon which graph-based clustering of the learned SOUMAP prototypes is performed. The entire unsupervised learning pipeline, which we call multiview prototype embedding and clustering (MPEC), employs data-driven parameter selection, including the automated selection of the number of clusters C, which lessens the burden of parameter tuning and minimizes sources of user-driven bias. Additionally, we propose a post hoc cluster-wise significance test based on ARIMA time series modeling to identify pertinent clusters for further analysis and to flag noise-dominated clusters. We present results of MPEC-based clustering on NH3 emission from additional star-forming regions observed in the Green Bank Ammonia Survey (B18, L1688, NGC1333, OrionA). Our results show MPEC clustering is sensitive enough to extract very low signal-to-noise clusters, while being self-aware enough to discard any noise clustered in this process. We show that the advantage of MPEC is marked when compared to traditional methods (spectral clustering), and opens up new avenues for robustly analyzing astronomical spectral data.

Read PDF

Similar papers

Open access Aug 2026

Density-Peak-Based Clustering in Reduced Feature Spaces

This work proposed to use Regularised Multidimensional Scaling using Radial Basis Function (RBF-MDS) for dimension reduction, a multidimensional scaling that mitigates the impact of irrelevant or redundant features, enabling 2D/3D visualisation of clusters for interpretability.

Afsana Akter Setu, J. Singha, Sohana Jahan · 0 citations
#machine learning Preprint Sep 2026

Multi-Domain Clustering via Measure Quantization

This work presents a general framework for multi-domain clustering via measure quantization: given samples from multiple domains, given samples from multiple domains, they learn a shared set of cluster prototypes by minimizing a probability metric between each domain's probability measure and the measure of prototypes.

Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma, C. C. Cavalcante · 0 citations
#diffusion models Open access Sep 2026

A new perspective on centroid algorithms for unsupervised discrete clustering in Riemannian manifolds: an approach via optimization

This work presents a new perspective on a specific class of partition-based algorithms for unsupervised discrete clustering in complete finite-dimensional Riemannian manifolds by introducing statistical shape analyses to classify clusters and improve label selection.

Ronaldo Malheiros Gregorio, Charlan Dellon da Silva Alves, Sérgio Assunção Monteiro et al. · 0 citations
Open access Sep 2026

Robust deep subspace clustering based on unsupervised fusion learning

A flexible encoder based on low-rank embedding that adaptively captures the most informative components in the feature space of the input data while filtering out redundant or noisy information, effectively alleviating over-connected affinities is proposed.

Li Guo, Qian Wang · 0 citations
Open access Sep 2026

Sparse k-Means Clustering with Lasso-Based Feature Selection

Clustering high-dimensional data is challenging when irrelevant or weakly informative features obscure the underlying cluster structure. To address this issue, we propose two sparse k-means clustering algorithms, S-KM1 and S-KM2, that perform cluster estimation and feature selection by sparse feature weighting simultan...

Miin-Shen Yang, Shazia Parveen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.