Frequent Pattern

Synonyms

Interesting pattern; Selected pattern

Definition

Given a set of patterns, i.e., a class of expressions about databases, and a predicate to evaluate whether a database satisfies a pattern, the frequent pattern mining task is to determine which patterns are satisfied by a given database. Formally, assume that $\mathcal{P}$ is a set and q is a predicate $p : \mathcal{P}\times \{\mathbf{r}\vert \mathbf{r}\ \text{is a database}\} \rightarrow \{\text{true, false}\}$. Elements of $\mathcal{P}$ are called patterns, and q is a selection criterion over $\mathcal{P}$. Given a pattern φ in $\mathcal{P}$ and a database r, φ is selected if q(φ, r ) is true. Given a database r, the theory $\mathcal{T} /\mathcal{P},\mathbf{r},q)$ of r with respect to $\mathcal{P}$ and q is $\mathcal{T} /\mathcal{P},\mathbf{r},q) =\{\phi \in \mathcal{P}\vert q(\phi, \mathbf{r})\ \text{is true}\}$.

Main Text

It is important to note that the interpretation of “q(φ,r) is true” depends on the...