arXiv:2508.06353cs.LG2025-08

用几何投影加速聚类,不降精度还更省电。

Geometric-k-means: A Bound Free Approach to Fast and Eco-Friendly k-means

  • 基于向量投影筛选关键数据点,跳过无关计算。
  • 运行时间与距离计算量显著低于传统方法。
  • 适合大规模、高维数据的高效聚类场景。

本文提出几何k-means(Gk-means),一种提升经典k-means算法效率与能效的新方法。其核心是利用标量投影的几何特性,识别对聚类更新有显著影响的高表达数据(HE),而跳过对结果无影响的低表达数据(LE),从而大幅降低计算开销。在合成数据、真实世界数据及高维数据上的实验表明,Gk-means在运行时间与距离计算量上均显著优于传统和当前最优(SOTA)k-means变体。同时,其能量消耗更低,展现出更强的资源可持续性。

原文摘要 · Abstract (English)

This paper introduces Geometric-k-means (or Gk-means for short), a novel approach that significantly enhances the efficiency and energy economy of the widely utilized k-means algorithm, which, despite its inception over five decades ago, remains a cornerstone in machine learning applications. The essence of Gk-means lies in its active utilization of geometric principles, specifically scalar projection, to significantly accelerate the algorithm without sacrificing solution quality. This geometric strategy enables a more discerning focus on data points that are most likely to influence cluster updates, which we call as high expressive data (HE). In contrast, low expressive data (LE), does not impact clustering outcome, is effectively bypassed, leading to considerable reductions in computational overhead. Experiments spanning synthetic, real-world and high-dimensional datasets, demonstrate Gk-means is significantly better than traditional and state of the art (SOTA) k-means variants in runtime and distance computations (DC). Moreover, Gk-means exhibits better resource efficiency, as evidenced by its reduced energy footprint, placing it as more sustainable alternative.

聚类优化几何方法能效提升

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。