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

一种结合最大项集和面积测度的高效启发式压缩大容量表约束方法

An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints

University of Bejaia(贝贾亚大学);MT Atlantique(大西洋矿业电信学院)

Soufia Bennai, Kamala Amroun, Samir Loudni, Abdelkader Ouali

摘要:

约束程序设计是一种建模和解决组合问题的强大范式。虽然有很多种约束,但表约束可能是最重要的--它是研究得最好的,并且能够对定义在有限变量上的任何其他约束进行编码。然而,约束可以是非常庞大的,并且它们的大小可以随着它们的数量呈指数级增长。为了减少空间和时间复杂度,研究人员集中在各种形式的压缩。本文提出了一种基于最大频繁项集技术和面积测度的最大频繁项集枚举方法。我们的实验结果表明,这种方法的有效性和效率的压缩和解决压缩表的约束。

英文摘要:

Constraint Programming is a powerful paradigm to model and solve combinatorial problems. While there are many kinds of constraints, the table constraint is perhaps the most significant-being the most well-studied and has the ability to encode any other constraints defined on finite variables. However, constraints can be very voluminous and their size can grow exponentially with their arity. To reduce space and the time complexity, researchers have focused on various forms of compression. In this paper we propose a new approach based on maximal frequent itemsets technique and area measure for enumerating the maximal frequent itemsets relevant for compressing table constraints. Our experimental results show the effectiveness and efficiency of this approach on compression and on solving compressed table constraints.

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

↑