arXiv:2511.09166cs.LG2025-11中稿 · AAAI

不依赖标签,自动发现特征组并选出最有信息量的组。

Unsupervised Feature Selection Through Group Discovery

  • 通过联合学习隐含特征组与选择最优组,实现端到端可微。
  • 在九个数据集上优于当前最佳无监督特征选择方法。
  • 适合高维数据中寻找有意义特征组合的场景。

无监督特征选择对无标签的高维学习任务至关重要,有助于降噪、提升泛化能力并增强可解释性。然而,现有方法多独立评估特征,忽视了相关特征常以组形式协同作用(如相邻像素、功能连接脑区或相关金融指标)。尽管部分方法尝试捕捉组结构,但通常依赖预定义分组或标签监督,适用性受限。我们提出GroupFS,一种端到端、完全可微的框架,无需固定先验分组或标签监督,即可联合发现隐含特征组并选择最信息丰富的组。GroupFS在特征图和样本图上施加拉普拉斯平滑,并引入组稀疏正则化,学习紧凑且结构化的表示。在涵盖图像、表格数据及生物数据的九个基准测试中,GroupFS在聚类性能上持续优于当前最佳无监督特征选择方法,并选出与有意义模式一致的特征组。

原文摘要 · Abstract (English)

Unsupervised feature selection (FS) is essential for high-dimensional learning tasks where labels are not available. It helps reduce noise, improve generalization, and enhance interpretability. However, most existing unsupervised FS methods evaluate features in isolation, even though informative signals often emerge from groups of related features. For example, adjacent pixels, functionally connected brain regions, or correlated financial indicators tend to act together, making independent evaluation suboptimal. Although some methods attempt to capture group structure, they typically rely on predefined partitions or label supervision, limiting their applicability. We propose GroupFS, an end-to-end, fully differentiable framework that jointly discovers latent feature groups and selects the most informative groups among them, without relying on fixed a priori groups or label supervision. GroupFS enforces Laplacian smoothness on both feature and sample graphs and applies a group sparsity regularizer to learn a compact, structured representation. Across nine benchmarks spanning images, tabular data, and biological datasets, GroupFS consistently outperforms state-of-the-art unsupervised FS in clustering and selects groups of features that align with meaningful patterns.

特征选择无监督学习特征分组图神经网络

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