首页> 外文会议>10th International Conference on Algorithmic Learning Theory ALT'99 Tokyo, Japan, December 6-8, 1999 >Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any
【24h】

Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any

机译:反对准确性的情况下的复杂性:构建一个无功能的号角子句与任何其他子句一样困难

获取原文
获取原文并翻译 | 示例

摘要

Some authors have repeatedly pointed out that the use of the accuracy, in particular for comparing classifiers, is not adequate. The main argument discusses the validity of some assumptions underlying the use of this criterion. In this paper, we study the hardness of the accuracy's replacement in various ways, using a framework very sensitive to these assumptions: Inductive Logic Programming. Replacement is investigated in three ways: completion of the accuracy with an additional requirement, replacement of the accuracy by the ROC analysis, recently introduced from signal detection theory, and replacement of the accuracy by a single criterion. We prove strong hardness results for most of hte possible replacements. The major point is that allowing arbitrary multiplication of clauses appears to be totally useless. Another point is the equivalence in difficulty of various criteria. In contrast, the accuracy criterion appears to be tractable in this framework.
机译:一些作者反复指出,使用准确性(尤其是用于比较分类器)是不够的。主要论点讨论了使用该标准的一些假设的有效性。在本文中,我们使用对以下假设非常敏感的框架,以各种方式研究精度替代的难度:归纳逻辑编程。替换通过以下三种方式进行研究:通过附加要求完成精度,通过ROC分析替换精度(最近从信号检测理论引入)以及通过单个准则替换精度。对于大多数可能的替代品,我们证明了很强的硬度结果。要点是,允许子句的任意乘法似乎完全没有用。另一点是各种标准在难度上的等效性。相反,在此框架中,准确性标准似乎易于处理。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号