论文标题
Nouvelles重生阐明了主题
Nouvelles représentations concises exactes des motifs rares
论文作者
论文摘要
直到现在，数据挖掘中的大多数工作都对从这些项目集中提取频繁的项目集以及频繁的关联规则产生感兴趣。有时，频繁的关联规则可能会揭示出频繁行为通常是数据库中正常行为的方向。在过去的几年中，一些工作集中在剥削和提取稀有物品集上，并表明了他们的兴趣。但是，这些项目集的非常重要的大小是利用罕见模式的算法的障碍。为了减轻此问题，本报告提出了稀有项目集的两个精确简洁表示，一个基于最小发电机，另一个基于封闭项目集。在这种情况下，我们介绍了两种称为gmrare和mfrare的新算法，它们提取了这两个精确的简洁表示。
Until a present, the majority of work in data mining were interested in the extraction of the frequent itemsets and the generation of the frequent association rules from these itemsets. Sometimes, the frequent of associations rules can revealed not-interesting in the direction where a frequent behavior is in general a normal behavior in the database. These last years, some work was focused on the exploitation and the extraction of rare itemset and shows them interest. However, the very important size of those itemset was the handicap of algorithms that exploit the rare pattern. In order to relieve this problem, the present report proposes two exact concise representations of the rare itemset, one based on the minimal generators and the other based on the closed itemset. In this context, we introduce two new algorithms called GMRare and MFRare which extract these two exact concise representations.
