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

多项式时间中投影-反单调约束最佳闭项集的挖掘

Mining Best Closed Itemsets for Projection-antimonotonic Constraints in Polynomial Time

National Research University Higher School of Economics(俄罗斯国家研究型高等经济大学);LORIA (CNRS – Inria – University of Lorraine)(洛林计算机科学及其应用研究中心(法国国家科学研究中心 - 法国国家信息与自动化研究所 - 洛林大学))

Aleksey Buzmakov, Sergei O. Kuznetsov, Amedeo Napoli

摘要:

模式集的指数爆炸是模式挖掘的主要挑战之一。通过引入模式选择的约束来解决这一挑战。模式挖掘中提出的第一个约束之一是数据集中模式的支持度(频率)。频率是一个反单调函数,即,给定一个非频繁模式,它的所有超模式都不是频繁的。然而,模式选择的许多其他约束既不是单调的也不是反单调的,这使得很难生成满足这些约束的模式。为了处理非单调约束,我们引入了“投影反单调性”的概念和SOFIA算法,允许生成一类非单调约束的最佳模式。余弦兴趣,鲁棒性,闭项集的稳定性,以及相关的增量度量都是这些约束。SOFIA从数据集中事务的简单描述(在项集描述的情况下是一小组项目)开始,然后迭代地向这些描述中添加更多信息(更多项目带有它们描述的tidset指示)。

英文摘要:

The exponential explosion of the set of patterns is one of the main challenges in pattern mining. This challenge is approached by introducing a constraint for pattern selection. 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 neither monotonic nor anti-monotonic, which makes it difficult to generate patterns satisfying these constraints. In order to deal with nonmonotonic constraints we introduce the notion of "projection antimonotonicity" and SOFIA algorithm that allow generating best patterns for a class of nonmonotonic constraints. Cosine interest, robustness, stability of closed itemsets, and the associated delta-measure are among these constraints. SOFIA starts from light descriptions of transactions in dataset (a small set of items in the case of itemset description) and then iteratively adds more information to these descriptions (more items with indication of tidsets they describe).

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

↑