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.
翻译:本文提出了DelTriC(Delaunay三角剖分聚类)算法,该算法整合了基于PCA/UMAP的投影、Delaunay三角剖分以及一种新颖的反投影机制,以在原始高维空间中形成聚类簇。DelTriC通过首先在低维代理空间中进行三角剖分以索引局部邻接关系,随后反投影至原始空间执行鲁棒的边剪枝、簇合并及异常检测,从而将邻域构建与决策过程解耦。DelTriC在多种场景下能够超越传统方法(如k-means、DBSCAN和HDBSCAN);其兼具可扩展性与准确性,并显著提升了异常检测性能。