无需标签即可自动调参,提升子空间聚类效果
Interpretable label-free self-guided subspace clustering
- 用伪标签生成的聚类指标指导超参数搜索
- 在6个数据集上达到近似最优性能(低5%-7%)
- 可视化子空间基帮助理解并缩小搜索范围
多数子空间聚类(SC)算法依赖需精细调整的超参数,而传统优化方法通常依赖标签数据。在医学等无标签场景中不可行。本文提出一种无需标签的超参数优化方法:基于聚类算法生成的伪标签,计算准确率(ACC)或归一化互信息(NMI),在预设超参数网格上评估性能。假设这些指标随超参数呈平滑变化,通过不断二分或三分区间,直至满足相对误差阈值。该方法适用于任意SC算法。我们在多个单/多视图算法上验证,结果与已知最优版本相比仅下降5%-7%。同时,通过可视化估计出的子空间基,增强方法可解释性,辅助初始超参数空间选择。
原文摘要 · Abstract (English)
Majority subspace clustering (SC) algorithms depend on one or more hyperparameters that need to be carefully tuned for the SC algorithms to achieve high clustering performance. Hyperparameter optimization (HPO) is often performed using grid-search, assuming that some labeled data is available. In some domains, such as medicine, this assumption does not hold true in many cases. One avenue of research focuses on developing SC algorithms that are inherently free of hyperparameters. For hyperparameters-dependent SC algorithms, one approach to label-independent HPO tuning is based on internal clustering quality metrics (if available), whose performance should ideally match that of external (label-dependent) clustering quality metrics. In this paper, we propose a novel approach to label-independent HPO that uses clustering quality metrics, such as accuracy (ACC) or normalized mutual information (NMI), that are computed based on pseudo-labels obtained from the SC algorithm across a predefined grid of hyperparameters. Assuming that ACC (or NMI) is a smooth function of hyperparameter values it is possible to select subintervals of hyperparameters. These subintervals are then iteratively further split into halves or thirds until a relative error criterion is satisfied. In principle, the hyperparameters of any SC algorithm can be tuned using the proposed method. We demonstrate this approach on several single- and multi-view SC algorithms, comparing the achieved performance with their oracle versions across six datasets representing digits, faces and objects. The proposed method typically achieves clustering performance that is 5% to 7% lower than that of the oracle versions. We also make our proposed method interpretable by visualizing subspace bases, which are estimated from the computed clustering partitions. This aids in the initial selection of the hyperparameter search space.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。