用更灵活的不确定性建模提升多属性分类准确率
Attribute Fusion-based Classifier on Framework of Belief Structure
- 采用高斯与混合高斯模型自适应构建隶属函数
- 将可能性分布转为基本概率分配,增强信息表达能力
- 适合处理不确定性强的复杂分类任务
Dempster-Shafer理论(DST)为建模不确定性提供了强大框架,广泛应用于多属性分类。然而,传统基于DST的属性融合分类器在隶属函数建模上过于简化,且未能充分挖掘基本概率分配(BPA)带来的信念结构,限制了其在复杂现实场景中的表现。本文提出一种改进的属性融合分类器,通过两项关键创新克服上述局限:首先,采用选择性建模策略,结合单高斯和高斯混合模型(GMMs)构建隶属函数,模型选择由交叉验证和定制评估指标指导;其次,提出新方法将可能性分布转化为BPA,通过组合归一化可能性分布生成的简单BPA,实现更丰富灵活的不确定性表示。进一步将该信念结构驱动的BPA生成方法应用于证据K近邻(EKNN)分类器,显著提升其对不确定性信息的利用能力。在基准数据集上的全面实验表明,所提分类器优于现有最佳证据分类器,平均准确率提升4.86%,且方差低,验证了其卓越的有效性与鲁棒性。
原文摘要 · Abstract (English)
Dempster-Shafer Theory (DST) provides a powerful framework for modeling uncertainty and has been widely applied to multi-attribute classification tasks. However, traditional DST-based attribute fusion-based classifiers suffer from oversimplified membership function modeling and limited exploitation of the belief structure brought by basic probability assignment (BPA), reducing their effectiveness in complex real-world scenarios. This paper presents an enhanced attribute fusion-based classifier that addresses these limitations through two key innovations. First, we adopt a selective modeling strategy that utilizes both single Gaussian and Gaussian Mixture Models (GMMs) for membership function construction, with model selection guided by cross-validation and a tailored evaluation metric. Second, we introduce a novel method to transform the possibility distribution into a BPA by combining simple BPAs derived from normalized possibility distributions, enabling a much richer and more flexible representation of uncertain information. Furthermore, we apply the belief structure-based BPA generation method to the evidential K-Nearest Neighbors (EKNN) classifier, enhancing its ability to incorporate uncertainty information into decision-making. Comprehensive experiments on benchmark datasets are conducted to evaluate the performance of the proposed attribute fusion-based classifier and the enhanced evidential K-Nearest Neighbors classifier in comparison with both evidential classifiers and conventional machine learning classifiers. The results demonstrate that the proposed classifier outperforms the best existing evidential classifier, achieving an average accuracy improvement of 4.86%, while maintaining low variance, thus confirming its superior effectiveness and robustness.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。