Succinct Minimal Generators: Theoretical Foundations and Applications

In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support threshold. An interesting solution consists then in applying an appropriate closure operator that structures frequent itemsets into equivalence classes, such that two itemsets belong to the same class if they appear in the same sets of objects. Among equivalent itemsets, minimal elements (w.r.t. the number of items) are called minimal generators (MGs), while their associated closure is called closed itemset (CI), and is the largest one within the corresponding equivalence class. Thus, the pairs - composed by MGs and their associated CIs - make easier localizing each itemset since it is necessarily encompassed by an MG and an CI. In addition, they offer informative implication/association rules, with minimal premises and maximal conclusions, which losslessly represent the entire rule set. These important concep...

• Type: Journal
• Year: 2008
• Where: IJFCS
• Authors: Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu Nguifo
• Keywords: Frequent Itemsets, IJFCS 2008, Minimal Generators, Minimum Support Threshold