This paper introduces a novel graph-based filter method for automatic feature
selection (abbreviated as GB-AFS) for multi-class classification tasks. The
method determines the minimum combination of features required to sustain
prediction performance while maintaining complementary discriminating abilities
between different classes. It does not require any user-defined parameters such
as the number of features to select. The methodology employs the
Jeffries-Matusita (JM) distance in conjunction with t-distributed Stochastic
Neighbor Embedding (t-SNE) to generate a low-dimensional space reflecting how
effectively each feature can differentiate between each pair of classes. The
minimum number of features is selected using our newly developed Mean
Simplified Silhouette (abbreviated as MSS) index, designed to evaluate the
clustering results for the feature selection task. Experimental results on
public data sets demonstrate the superior performance of the proposed GB-AFS
over other filter-based techniques and automatic feature selection approaches.
Moreover, the proposed algorithm maintained the accuracy achieved when
utilizing all features, while using only $7\%$ to $30\%$ of the features.
Consequently, this resulted in a reduction of the time needed for
classifications, from $15\%$ to $70\%$.

该论文介绍了一种用于多类别分类的自动特征选择的新型基于图的滤波方法（缩写为 GB-AFS），它确定了在维持预测性能的同时保持不同类别之间互补判别能力的最小特征组合。该方法不需要任何用户定义的参数，如要选择的特征数量。该方法使用 Jeffries-Matusita (JM) 距离结合 t 分布随机邻域嵌入（t-SNE）生成反映每个特征能够在每对类别之间区分性的低维空间。采用我们新开发的用于特征选择任务的平均简化 Silhouette (MSS) 指数选择最小特征数量，该指数旨在评估特征选择任务的聚类结果。在公开数据集上的实验结果表明，所提出的 GB-AFS 方法优于其他基于滤波的技术和自动特征选择方法的性能。此外，所提出的算法在仅使用特征的 7% 到 30% 的情况下保持了达到的准确性，从而将分类所需的时间减少了 15% 到 70%。

基于图的多类分类自动特征选择通过均值简化轮廓

Graph-Based Automatic Feature Selection for Multi-Class Classification  via Mean Simplified Silhouette

Data-centric AI encourages the need of cleaning and understanding of data in
order to achieve trustworthy AI. Existing technologies, such as AutoML, make it
easier to design and train models automatically, but there is a lack of a
similar level of capabilities to extract data-centric insights. Manual
stratification of tabular data per a feature (e.g., gender) is limited to scale
up for higher feature dimension, which could be addressed using automatic
discovery of divergent subgroups. Nonetheless, these automatic discovery
techniques often search across potentially exponential combinations of features
that could be simplified using a preceding feature selection step. Existing
feature selection techniques for tabular data often involve fitting a
particular model in order to select important features. However, such
model-based selection is prone to model-bias and spurious correlations in
addition to requiring extra resource to design, fine-tune and train a model. In
this paper, we propose a model-free and sparsity-based automatic feature
selection (SAFS) framework to facilitate automatic discovery of divergent
subgroups. Different from filter-based selection techniques, we exploit the
sparsity of objective measures among feature values to rank and select
features. We validated SAFS across two publicly available datasets (MIMIC-III
and Allstate Claims) and compared it with six existing feature selection
methods. SAFS achieves a reduction of feature selection time by a factor of 81x
and 104x, averaged cross the existing methods in the MIMIC-III and Claims
datasets respectively. SAFS-selected features are also shown to achieve
competitive detection performance, e.g., 18.3% of features selected by SAFS in
the Claims dataset detected divergent samples similar to those detected by
using the whole features with a Jaccard similarity of 0.95 but with a 16x
reduction in detection time.

该论文提出了一个面向数据的 AI 框架，可以自动选择重要特征，实现自动发现不同的数据子组并提高检测性能。通过在 MIMIC-III 和 Allstate Claims 公开数据集上的验证，该框架比现有的六种特征选择方法减少了 81 倍和 104 倍的特征选择时间，并实现了有竞争力的检测性能。

无模型特征选择以促进表格数据中发现不同子组

Model-free feature selection to facilitate automatic discovery of divergent subgroups in tabular data

We exploit the Facebook reaction feature in a distant supervised fashion to
train a support vector machine classifier for emotion detection, using several
feature combinations and combining different Facebook pages. We test our models
on existing benchmarks for emotion detection and show that employing only
information that is derived completely automatically, thus without relying on
any handcrafted lexicon as it's usually done, we can achieve competitive
results. The results also show that there is large room for improvement,
especially by gearing the collection of Facebook pages, with a view to the
target domain.

利用 Facebook 反应特性以远程监督的方式训练支持向量机分类器进行情感检测，通过不同特征组合和不同 Facebook 页面的结合，并在现有情感检测基准上进行测试，证明通过只采用完全自动化的信息来进行训练（而不依赖于手工制作的词典），可以获得具有竞争力的结果。结果还表明，在针对目标领域进行 Facebook 页面的收集方面，有很大的改进空间。