mlsanityData to 14 Oct 2026

DelTriC: A Novel Clustering Method with Accurate Outlier

arXiv 2511.17219 ↗First posted 21 Nov 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The paper introduces DelTriC (Delaunay Triangulation Clustering), a clustering algorithm which integrates PCA/UMAP-based projection, Delaunay triangulation, and a novel back-projection mechanism to form clusters in the original high-dimensional space. DelTriC decouples neighborhood construction from decision-making by first triangulating in a low-dimensional proxy to index local adjacency, and then back-projecting to the original space to perform robust edge pruning, merging, and anomaly detection. DelTriC can outperform traditional methods such as k-means, DBSCAN, and HDBSCAN in many scenarios; it is both scalable and accurate, and it also significantly improves outlier detection.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 25 references that are in the map. First posted on arXiv 21 Nov 2025.

Builds on

8 of 25 references.

References · 8

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  3. 2017Billion-scale similarity search with GPUscited by 2,497
  4. 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
  5. 2020Making Monolingual Sentence Embeddings Multilingual using Knowledge Distillationcited by 593
  6. 2019An Evaluation Dataset for Intent Classification and Out-of-Scope Predictioncited by 386
  7. 2014Subspace clustering of dimensionality-reduced datacited by 2
  8. 2015Clustering by Descending to the Nearest Neighbor in the Delaunay Graph Spacecited by 1

Built on by

Not cited yet.