 |
Université d'Orléans |  |
|
Université d'Orléans | |
| HAL: hal-00013510, version 1 |
| Detailed view |  Export this paper |
 |
|
|
| Size of random Galois lattices and number of frequent itemsets |
|
|
| Richard Emilion 1Gerard Levy 2 |
|
|
| (2005) |
|
|
|
| We compute the mean and the variance of the size of the Galois lattice built from a random matrix with i.i.d. Bernoulli(p) entries. Then, obseving that closed frequent itemsets are in bijection with winning coalitions, we compute the mean and the variance of the number of closed frequent itemsets. This can be of interest for mining association rules. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Mathématiques - Analyse, Probabilités, Modélisation - Orléans (MAPMO) |
|
|
|
Université d'Orléans – CNRS : UMR7349 |
|
|
| 2: | Centre d'enseignement et de recherche en informatique appliquée (CERIA) |
|
|
|
Université Paris IX - Paris Dauphine – Ecole des Ponts ParisTech |
|
|
|
|
|
|
|
|
|
| Subject | : | Mathematics/Combinatorics Computer Science/Learning Computer Science/Discrete Mathematics |
|
|
| association rules – classification – frequent itemsets – data mining – Galois lattice – winning coalition |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00013510, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00013510 | |
| oai:hal.archives-ouvertes.fr:hal-00013510 | |
| From: Richard Emilion | |
| Submitted on: Wednesday, 9 November 2005 03:06:58 | |
| Updated on: Wednesday, 6 December 2006 16:50:14 | |
