mlsanityData to 14 Oct 2026

Seed-Guided Semi-Supervised Clustering by A-Contrario Anomaly Detection

arXiv 2606.18833 ↗First posted 17 Jun 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper introduces a semi-supervised clustering framework grounded in the statistical duality between grouping principles and anomaly detection. We address the challenge of robust cluster definition in noisy environments -- a task where partitioning algorithms often over-assign outliers and density-based methods remain sensitive to heuristic global parameters. Drawing on textita-contrario statistical reasoning and Gestalt proximity principles, we define a cluster as a maximal subset of data points containing no anomalies relative to a null hypothesis of uniform randomness. Central to this approach is the Perception algorithm, which utilises a principled expectation-based threshold (mathbbE < 1) to identify outliers without manual parameter tuning. By treating clustering as the dual of anomaly detection, we employ an iterative ``clustering-by-exclusion'' mechanism. The algorithm is seed-guided, leveraging minimal user-provided labels to initialise robust cluster medians and form initial groups, which are subsequently expanded by admitting non-anomalous points. This approach naturally isolates fringe points, isolated noise, and emerging unknown clusters. We evaluate the method on synthetic and real-world benchmarks, including image and text datasets represented through raw, linear-reduced, and neighbourhood-preserving embeddings. Results demonstrate that with as few as 10--30 seeds per cluster, the proposed method achieves competitive and often very strong performance under a practical low-tuning benchmarking protocol, while maintaining linear scalability with respect to both observations and dimensionality for a fixed number of seeded clusters and iterations.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 37 references that are in the map. First posted on arXiv 17 Jun 2026.

Builds on

9 of 37 references.

References · 9

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  2. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
  3. 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
  4. 2022Deep Clustering: A Comprehensive Surveycited by 78
  5. 2018Clustering with Outlier Removalcited by 10
  6. 2023Semi-Supervised Constrained Clustering: An In-Depth Overview, Ranked Taxonomy and Future Research Directionscited by 8
  7. 2021Anomaly Detection using Principles of Human Perceptioncited by 4
  8. 2023Extension of the Dip-test Repertoire -- Efficient and Differentiable p-value Calculation for Clusteringcited by 3
  9. 2026Hierarchical Reference Sets for Robust Unsupervised Detection of Scattered and Clustered Outlierscited by 1

Built on by

Not cited yet.