数据组织限制了二元分类的可预测性
Data organization limits the predictability of binary classification
AI总结:
本研究提出理论框架,证明二元分类性能上界由数据集固有属性决定、与分类器无关,还分析了上界与类别重叠度的关系,可用于特征工程中筛选最优特征子集。
摘要:
数据组织的结构被广泛认为对机器学习算法的效能有重大影响,尤其是在二元分类任务中。本研究提出了一个理论框架,表明二元分类器在给定数据集上的最大潜力主要受数据固有属性的制约。通过理论推导与实证检验,我们采用标准目标函数、评估指标及二元分类器得出了两个主要结论。第一,我们证明了实际数据集上二元分类性能的理论上界是可以在理论上达到的,该上界是学习损失与评估指标之间的可计算平衡点。第二,我们计算了三种常用评估指标的精确上界,揭示了与我们核心论点的根本一致性:上界与数据集的特征密切相关,与所使用的分类器无关。此外,后续分析揭示了性能上限与二元分类数据中类别重叠程度之间的具体关系,该关系有助于在特征工程中确定最有效的特征子集。
英文摘要:
The structure of data organization is widely recognized as having a substantial influence on the efficacy of machine learning algorithms, particularly in binary classification tasks. Our research provides a theoretical framework suggesting that the maximum potential of binary classifiers on a given dataset is primarily constrained by the inherent qualities of the data. Through both theoretical reasoning and empirical examination, we employed standard objective functions, evaluative metrics, and binary classifiers to arrive at two principal conclusions. Firstly, we show that the theoretical upper bound of binary classification performance on actual datasets can be theoretically attained. This upper boundary represents a calculable equilibrium between the learning loss and the metric of evaluation. Secondly, we have computed the precise upper bounds for three commonly used evaluation metrics, uncovering a fundamental uniformity with our overarching thesis: the upper bound is intricately linked to the dataset's characteristics, independent of the classifier in use. Additionally, our subsequent analysis uncovers a detailed relationship between the upper limit of performance and the level of class overlap within the binary classification data. This relationship is instrumental for pinpointing the most effective feature subsets for use in feature engineering.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。