arXiv:2606. 00327v1 Announce Type: cross Abstract: Clustering is widely used across the sciences as the foundation for downstream data-driven scientific discoveries.
arXiv:2606. 05230v1 Announce Type: cross Abstract: Selecting a clustering algorithm and its hyperparameters without labels is a common difficulty in engineering machine learning pipelines that work with unsupervised analysis of sensor, image, or process data.
arXiv:2509. 25289v4 Announce Type: replace-cross Abstract: Identifying an effective clustering algorithm for a given dataset remains a fundamental unsupervised learning issue.
arXiv:2502. 08397v3 Announce Type: replace-cross Abstract: Clustering is a fundamental technique in data analysis and machine learning, used to group similar data points together.
arXiv:2609. 30477v1 Announce Type: cross Abstract: Exact Euclidean \(K\)-means partitions \(n\) observations into \(K\) unlabelled clusters, but the unrestricted search is generally exponential.
The paper compares two popular data‑integration techniques—Stack‑SVD, which concatenates datasets before performing singular value decomposition, and SVD‑Stack, which first decomposes each dataset separately and then aggregates the leading singular vectors. By deriving exact asymptotic performance expressions and phase transitions in a proportional regime, the authors show that neither method uniformly dominates the other when unweighted, but optimally weighted Stack‑SVD outperforms optimally weighted SVD‑Stack when the low‑rank signal is fully shared. They also demonstrate that SVD‑Stack can excel with partially shared components and provide practical algorithms for estimating optimal weights, supported by simulations and genomic experiments.
The paper introduces Difference‑Quotient Clustering (DQC) to address mean‑collapse in multimodal regression. DQC partitions data by minimizing intra‑cluster output‑vs‑input discrepancy, assigning each sample to the cluster with the lowest maximum contradiction ratio. The resulting cluster labels train a logits generator and conditional network, achieving lower minimum squared error on synthetic benchmarks compared to random labeling and mean‑collapse baselines.
arXiv:2105. 07610v5 Announce Type: replace-cross Abstract: Building trustworthy machine learning algorithms for biological applications requires adapting to data heterogeneity from different sources, batches, distributions, or studies.
arXiv:2601. 06351v2 Announce Type: replace Abstract: Anticlustering is an NP-hard combinatorial optimization problem that consists of partitioning a set of objects into equal-sized groups called anticlusters such that the objects in the same anticluster are as dissimilar as possible and thereby representative of the entire set of objects.
arXiv:2601. 11626v2 Announce Type: replace-cross Abstract: Large collections of matrices arise throughout modern machine learning, signal processing, and scientific computing, where they are commonly compressed by concatenation followed by truncated singular value decomposition (SVD).
arXiv:2511. 03000v2 Announce Type: replace-cross Abstract: Comparing clusterings is central to evaluating unsupervised models, yet the many existing similarity measures can produce widely divergent, sometimes contradictory, evaluations.
The paper introduces Omega‑N, a set of ten interpretable node‑level structural descriptors derived from localizing four factors of a composite structural index. By correcting the ill‑conditioned localization with a configuration‑null excess and a multi‑scale personalized‑PageRank neighbourhood, Omega‑N achieves competitive or superior performance in six in‑domain node‑classification tasks compared to a recursive feature engine that uses up to 252 features. In drug‑target prioritisation on protein interaction networks, Omega‑N improves AUPRC by 0.073 to 0.144 over a centrality baseline and remains robust across independent datasets and bias controls, though it offers no benefit when combined with Node2Vec. whyItMatters":"The study demonstrates that a compact, interpretable set of structural features can match or exceed more complex feature sets in practical graph‑based prediction tasks, particularly in biomedical network analysis."