非单调约束下最佳区间模式的快速生成
Fast Generation of Best Interval Patterns for Nonmonotonic Constraints
摘要:
在模式挖掘中,主要的挑战是模式集的指数爆炸。通常,为了解决这个问题,引入了模式选择的约束。模式挖掘中提出的第一个约束之一是数据集中模式的支持度(频率)。频率是一个反单调函数,即,给定一个非频繁模式,它的所有超模式都不是频繁的。然而,模式选择的许多其他约束不是(反)单调的,这使得难以生成满足这些约束的模式。在本文中,我们介绍了投影反单调的概念和$θ$ - $\Sigmaøϕια$算法,允许有效地产生一些非单调约束的最佳模式。在本文中,我们考虑稳定性和$Δ$ -措施,这是非单调约束,并将它们应用到区间元组数据集。在实验中,我们计算最佳区间元组模式w.r.t.这些措施,并显示了我们的方法的优势后滤波方法。关键词:模式挖掘,非单调约束,区间元组数据
英文摘要:
In pattern mining, the main challenge is the exponential explosion of the set of patterns. Typically, to solve this problem, a constraint for pattern selection is introduced. One of the first constraints proposed in pattern mining is support (frequency) of a pattern in a dataset. Frequency is an anti-monotonic function, i.e., given an infrequent pattern, all its superpatterns are not frequent. However, many other constraints for pattern selection are not (anti-)monotonic, which makes it difficult to generate patterns satisfying these constraints. In this paper we introduce the notion of projection-antimonotonicity and $θ$-$\Sigmaøϕια$ algorithm that allows efficient generation of the best patterns for some nonmonotonic constraints. In this paper we consider stability and $Δ$-measure, which are nonmonotonic constraints, and apply them to interval tuple datasets. In the experiments, we compute best interval tuple patterns w.r.t. these measures and show the advantage of our approach over postfiltering approaches. KEYWORDS: Pattern mining, nonmonotonic constraints, interval tuple data
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。