概率估计中的MOB-ESP及其它改进
MOB-ESP and other Improvements in Probability Estimation
摘要:
在智能系统中,不确定性下的最优推理的一个关键前提是从良好的类概率估计开始。本文对现有的最佳概率估计树(Bagged-PETs)进行了改进,提出了一种新的基于集合的算法(MOB-ESP)。使用几个基准数据集和多个指标进行比较。这些实验表明,MOB-ESP输出的类概率比基线BPETs算法或本文提出的增强版本(EB-PETs)更准确。这些结果是基于与预测的平均准确度密切相关的指标。MOB-ESP还提供比B-PET更好的概率排名。本文进一步提出了如何将这些估计技术与更广泛的分类器相结合。
英文摘要:
A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probability estimation trees (Bagged-PETs) and also presents a new ensemble-based algorithm (MOB-ESP). Comparisons are made using several benchmark datasets and multiple metrics. These experiments show that MOB-ESP outputs significantly more accurate class probabilities than either the baseline BPETs algorithm or the enhanced version presented here (EB-PETs). These results are based on metrics closely associated with the average accuracy of the predictions. MOB-ESP also provides much better probability rankings than B-PETs. The paper further suggests how these estimation techniques can be applied in concert with a broader category of classifiers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。