用于约束获取的部分递归算法
Partial Queries for Constraint Acquisition
摘要:
已知学习约束网络需要在变量数量上呈指数级的多个成员查询。在本文中,我们学习约束网络,要求用户部分查询。也就是说,我们要求用户将变量子集的赋值分类为正或负。我们提供了一个算法,称为QUACQ,该算法,给出了一个负的例子,专注于目标网络的约束,在一些查询对数的大小的例子。然后,整个约束网络可以通过多项式数量的部分查询来学习。我们给出了学习一些简单类的约束网络的信息论下界,并表明我们的遗传算法在某些情况下是最优的。
英文摘要:
Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the user partial queries. That is, we ask the user to classify assignments to subsets of the variables as positive or negative. We provide an algorithm, called QUACQ, that, given a negative example, focuses onto a constraint of the target network in a number of queries logarithmic in the size of the example. The whole constraint network can then be learned with a polynomial number of partial queries. We give information theoretic lower bounds for learning some simple classes of constraint networks and show that our generic algorithm is optimal in some cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。