低规模复杂度归纳逻辑程序设计:东西方的挑战被认为是代价敏感分类的问题
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification
摘要:
归纳逻辑程序设计社区已经考虑了证明复杂度和模型复杂度,但是直到最近,规模复杂度还很少受到关注。最近,一个挑战是“国际计算界”,以发现低尺寸的复杂性Prolog程序分类火车。这项挑战是基于20年前Ryszard Michalski首次提出的一个问题。我们将这一挑战解释为成本敏感分类中的一个问题,并将最近开发的成本敏感分类器应用于竞争。我们的算法是相对成功的(我们赢得了一个奖项)。本文介绍了我们的算法,并分析了竞争的结果。
英文摘要:
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a challenge was issued "to the international computing community" to discover low size-complexity Prolog programs for classifying trains. The challenge was based on a problem first proposed by Ryszard Michalski, 20 years ago. We interpreted the challenge as a problem in cost-sensitive classification and we applied a recently developed cost-sensitive classifier to the competition. Our algorithm was relatively successful (we won a prize). This paper presents our algorithm and analyzes the results of the competition.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。