新聚类算法自动调参,省去人工干预
SACA: Selective Attention-Based Clustering Algorithm
- 借鉴注意力机制,自适应设定剔除稀疏点的阈值
- 在多个基准数据集上准确率超传统方法,且无需调参
- 适合无经验用户快速应用,尤其适合噪声多的数据
聚类算法是众多领域的重要工具,基于密度的方法在识别任意形状簇和处理噪声方面具有优势。然而,其性能常受限于用户需手动调节关键参数,这通常需要丰富的领域知识。本文提出一种受选择性注意力启发的新型密度聚类算法,旨在最大限度减少多数场景下的参数调优需求。该方法通过计算自适应阈值来排除分布稀疏的点与异常值,构建初始聚类框架,并重新整合过滤后的点以优化最终结果。在多种基准数据集上的大量实验表明,该方法具备鲁棒性、高准确率且易于使用,可作为传统密度聚类技术的强大替代方案。
原文摘要 · Abstract (English)
Clustering algorithms are fundamental tools across many fields, with density-based methods offering particular advantages in identifying arbitrarily shaped clusters and handling noise. However, their effectiveness is often limited by the requirement of critical parameter tuning by users, which typically requires significant domain expertise. This paper introduces a novel density-based clustering algorithm loosely inspired by the concept of selective attention, designed to minimize reliance on parameter tuning for most applications. The proposed method computes an adaptive threshold to exclude sparsely distributed points and outliers, constructs an initial cluster framework, and subsequently reintegrates the filtered points to refine the final results. Extensive experiments on diverse benchmark datasets demonstrate the robustness, accuracy, and ease of use of the proposed approach, establishing it as a powerful alternative to conventional density-based clustering techniques.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。