Size of random Galois lattices and number of closed frequent itemsets

Authors:
Richard Emilion;Gérard Lévy
Affiliations:
MAPMO, Université d'Orléans, 45100 Orléans, France;Université Paris Dauphine, 75016 Paris, France
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 4
Cited 2

Building and maintaining analysis-level class hierarchies using Galois Lattices

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey

Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)

CMRules: Mining sequential rules common to several sequences

Knowledge-Based Systems
Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts

Information Sciences: an International Journal

Quantified Score

Hi-index	0.04

Visualization

Abstract

Given a sample of binary random vectors with i.i.d. Bernoulli(p) components, that is equal to 1 (resp. 0) with probability p (resp. 1-p), we first establish a formula for the mean of the size of the random Galois lattice built from this sample, and a more complex one for its variance. Then, noticing that closed @a-frequent itemsets are in bijection with closed @a-winning coalitions, we establish similar formulas for the mean and the variance of the number of closed @a-frequent itemsets. This can be interesting for the study of the complexity of some data mining problems such as association rule mining, sequential pattern mining and classification.