高效的多约束获取
Efficient Multiple Constraint Acquisition
摘要:
诸如QuAcq和MultiAcq的约束获取系统可以通过将(部分)示例分类为肯定或否定来帮助非专家用户将其问题建模为约束网络。对于每一个否定的例子,前者专注于目标网络的一个约束,而后者可以学习最大数量的约束。两个瓶颈的收购过程中,这两个算法遇到的问题是大量的查询需要达到收敛,和高的CPU时间需要生成查询,特别是接近收敛。在本文中,我们提出了算法和探试法来处理这两个问题。我们首先描述了一种算法,称为MQuAcq,它将MultiAcq的主要思想融合到QuAcq中,从而产生一种方法,该方法在一个负例后学习与MultiAcq一样多的约束,但复杂度较低。对该算法进行了详细的理论分析。%我们还提出了一种技术,通过显着减少查询的数量来提高约束获取的性能。然后,我们把我们的注意力转向查询生成,这是一个重要的,但却被忽视的一部分,收购过程。我们详细描述了如何在一个典型的约束获取系统查询生成操作,我们提出了算法,以提高其效率。来自不同领域的实验表明,我们得到的算法,集成了所有的新技术,不仅产生了比QuAcq和MultiAcq少得多的查询,但它也远远快于他们两个,在平均查询生成时间以及总运行时间,并在很大程度上消除了早熟收敛问题。
英文摘要:
Constraint acquisition systems such as QuAcq and MultiAcq can assist non-expert users to model their problems as constraint networks by classifying (partial) examples as positive or negative. For each negative example, the former focuses on one constraint of the target network, while the latter can learn a maximum number of constraints. Two bottlenecks of the acquisition process where both these algorithms encounter problems are the large number of queries required to reach convergence, and the high cpu times needed to generate queries, especially near convergence. In this paper we propose algorithmic and heuristic methods to deal with both these issues. We first describe an algorithm, called MQuAcq, that blends the main idea of MultiAcq into QuAcq resulting in a method that learns as many constraints as MultiAcq does after a negative example, but with a lower complexity. A detailed theoretical analysis of the proposed algorithm is also presented. %We also present a technique that boosts the performance of constraint acquisition by reducing the number of queries significantly. Then we turn our attention to query generation which is a significant but rather overlooked part of the acquisition process. We describe %in detail how query generation in a typical constraint acquisition system operates, and we propose heuristics for improving its efficiency. Experiments from various domains demonstrate that our resulting algorithm that integrates all the new techniques does not only generate considerably fewer queries than QuAcq and MultiAcq, but it is also by far faster than both of them, in average query generation time as well as in total run time, and also largely alleviates the premature convergence problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。