Size of random Galois lattices and number of closed frequent itemsets

Abstract

Given a sample of binary random vectors with i.i.d. Bernoulli(pp) components, that is equal to 1 (resp. 0) with probability pp (resp. 1−p1−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 αα-frequent itemsets are in bijection with closed αα-winning coalitions, we establish similar formulas for the mean and the variance of the number of closed αα-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

Similar works

Full text

thumbnail-image

Base de publications de l'université Paris-Dauphine

redirect
Last time updated on 09/07/2019

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.