arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.09936cs.LG
收藏

大型局部最优分类规则集的有效学习

Efficient learning of large sets of locally optimal classification rules

Johannes Kepler University Linz(林茨约翰·开普勒大学)

Van Quoc Phuong Huynh, Johannes Fürnkranz, Florian Beck

摘要:

传统的规则学习算法的目标是找到一组简单的规则,其中每个规则覆盖尽可能多的例子。在本文中,我们认为,以这种方式发现的规则可能不是他们所涵盖的每个例子的最佳解释。相反,我们提出了一个有效的算法,旨在找到最好的规则,覆盖每个训练样本在一个贪婪的优化组成的一个专业化和一个泛化循环。这些局部最优的规则被收集,然后过滤的最终规则集,这是远远大于传统的规则学习算法学习的集合。通过选择覆盖该示例的规则中的最佳规则来对新示例进行分类。在我们对小到非常大的数据集的实验中,该方法的平均分类准确率高于最先进的规则学习算法。此外,该算法是高效的,可以固有地并行处理,而不影响学习的规则集,从而分类精度。因此,我们相信,它关闭了一个重要的差距,大规模的分类规则归纳。

英文摘要:

Conventional rule learning algorithms aim at finding a set of simple rules, where each rule covers as many examples as possible. In this paper, we argue that the rules found in this way may not be the optimal explanations for each of the examples they cover. Instead, we propose an efficient algorithm that aims at finding the best rule covering each training example in a greedy optimization consisting of one specialization and one generalization loop. These locally optimal rules are collected and then filtered for a final rule set, which is much larger than the sets learned by conventional rule learning algorithms. A new example is classified by selecting the best among the rules that cover this example. In our experiments on small to very large datasets, the approach's average classification accuracy is higher than that of state-of-the-art rule learning algorithms. Moreover, the algorithm is highly efficient and can inherently be processed in parallel without affecting the learned rule set and so the classification accuracy. We thus believe that it closes an important gap for large-scale classification rule induction.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑