arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.11668cs.AI
收藏

定性约束网络的隶属度网络精确学习

Exact Learning of Qualitative Constraint Networks from Membership Queries

University of Regina(里贾纳大学);Um Al Qura University(乌姆·古拉大学)

Malek Mouhoub, Hamad Al Marri, Eisa Alanazi

摘要:

定性约束网络(QCN)是一种约束图,用于表示定性时间和空间关系下的问题。更正式地说,QCN包括一组实体,以及定义这些实体之间可能场景的定性约束列表。这些后者的约束表示为二进制关系的析取捕捉(不完整的)所涉及的实体之间的知识。QCN在表示各种各样的实际应用方面非常有效,包括调度和规划、配置和地理信息系统(GIS)。然而,从用户那里引出表示给定问题的QCN是具有挑战性的。为了克服这一困难,在实践中,我们提出了一个新的学习算法,通过成员查询,QCN从一个非专家。在本文中,成员查询,以引出时间或空间实体对之间的时间或空间关系。为了提高学习算法在实际应用中的时间性能,我们采用了传递闭包的约束传播和排序算法。这里的目标是减少到达目标QCN所需的成员查询的数量。为了评估约束传播和排序启发式的实际效果,我们对随机生成的时间和空间约束网络实例进行了几项实验。实验的结果是非常令人鼓舞和有希望的。

英文摘要:

A Qualitative Constraint Network (QCN) is a constraint graph for representing problems under qualitative temporal and spatial relations, among others. More formally, a QCN includes a set of entities, and a list of qualitative constraints defining the possible scenarios between these entities. These latter constraints are expressed as disjunctions of binary relations capturing the (incomplete) knowledge between the involved entities. QCNs are very effective in representing a wide variety of real-world applications, including scheduling and planning, configuration and Geographic Information Systems (GIS). It is however challenging to elicit, from the user, the QCN representing a given problem. To overcome this difficulty in practice, we propose a new algorithm for learning, through membership queries, a QCN from a non expert. In this paper, membership queries are asked in order to elicit temporal or spatial relationships between pairs of temporal or spatial entities. In order to improve the time performance of our learning algorithm in practice, constraint propagation, through transitive closure, as well as ordering heuristics, are enforced. The goal here is to reduce the number of membership queries needed to reach the target QCN. In order to assess the practical effect of constraint propagation and ordering heuristics, we conducted several experiments on randomly generated temporal and spatial constraint network instances. The results of the experiments are very encouraging and promising.

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

↑