Towards a text mining methodology using association rule extraction
H Cherfi, A Napoli, Y Toussaint - Soft Computing, 2006 - Springer
This paper proposes a methodology for text mining relying on the classical knowledge
discovery loop, with a number of adaptations. First, texts are indexed and prepared to be …
discovery loop, with a number of adaptations. First, texts are indexed and prepared to be …
[HTML][HTML] Size of random Galois lattices and number of closed frequent itemsets
R Emilion, G Lévy - Discrete applied mathematics, 2009 - Elsevier
Given a sample of binary random vectors with iid 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 …
(resp. 0) with probability p (resp. 1− p), we first establish a formula for the mean of the size of …
[PDF][PDF] Size of random Galois lattices and number of frequent itemsets
R Emilion, G Levy - HAL, 2005 - hal.science
Given a sample of binary random vectors with iid 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 …
(resp. 0) with probability p (resp. 1− p), we first establish a formula for the mean of the size of …
Structure nucleaire dans le premier puits de potentiel
MG Porquet - Rencontre Franco-Marocaine de Physique Nucleaire, 1999 - hal.science
We compute the mean and the variance of the size of the Galois lattice built from a random
matrix with iid Bernoulli (p) entries. Then, obseving that closed frequent itemsets are in …
matrix with iid Bernoulli (p) entries. Then, obseving that closed frequent itemsets are in …