Number of Frequent Patterns in Random Databases - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2009

Number of Frequent Patterns in Random Databases

Loïck Lhote


In a tabular database, patterns which occur over a frequency threshold are called frequent patterns. They are central in numerous data processes and var-ious efficient algorithms were recently designed for mining them. Unfortunately, very few is known about the real difficulty of this mining, which is closely related to the number of frequent patterns. The worst case analysis always leads to an ex-ponential number of frequent patterns, but experimentations show that algorithms become efficient for reasonable frequency thresholds. We perform here a proba-bilistic analysis of the number of frequent patterns. We first introduce a general model of random databases that encompasses all the previous classical models. In this model, the rows of the database are seen as independent words generated by the same probabilistic source [i.e. a random process that emits symbols]. Under natural conditions on the source, the average number of frequent patterns is studied for various frequency thresholds. Then, we exhibit a large class of sources, the class of dynamical sources, which is proven to satisfy our general conditions. This finally shows that our results hold in a quite general context of random databases.
Fichier principal
Vignette du fichier
CHS-LHOTE-2010-2.pdf (159.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01082026 , version 1 (12-11-2014)



Loïck Lhote. Number of Frequent Patterns in Random Databases. Advances in Data Analysis, pp.33 - 45, 2009, ⟨10.1007/978-0-8176-4799-5_4⟩. ⟨hal-01082026⟩
150 View
115 Download



Gmail Facebook X LinkedIn More