Couvertures parfaites des motifs fréquents

Abstract

The extraction of frequent patterns often yields extremely voluminous results which are difficult to handle. Computing a concise representation or cover of the frequent pattern set is an alternative investigated by various approaches. The work presented in this article fits in a similar trend. We introduce the concept of essential pattern and propose a new cover based on this concept. Such a cover makes it possible to decide whether any pattern is frequent or not, to compute its frequency and, in contrast with related work, to infer its disjunction and negation frequencies. A levelwise algorithm computing the essential patterns is proposed. The experiments show that when the number of frequent patterns is very high (strongly correlated data), the defined cover is significantly more reduced than the cover considered until now as minimal: the frequent closed patterns.