Pattern Setups and Their Completions - Archive ouverte HAL Access content directly
Conference Papers Year :

Pattern Setups and Their Completions


Pattern mining consists in discovering interesting patterns in data. For that, algorithms rely on smart techniques for enumerating the pattern search space and, generally, focus on compressed collections of patterns (e.g. closed patterns), to avoid redundancy. Formal Concept Analysis offers a generic framework, called pattern structures, to formalize many types of patterns, such as closed itemsets, intervals, graph and sequence sets. Additionally, it provides generic algorithms to enumerate all closed patterns and only them. The only condition is that the pattern space is a meet-semilattice, which, unfortunately does not always hold (e.g., for sequential and graph patterns). In this paper, we discuss pattern setups, a tool that models pattern search spaces relying only on posets. Subsequently, we revisit some techniques transforming pattern setups to a pattern structure using set of patterns, namely completions, and we state a necessary and sufficient condition for a pattern setup completion using antichains to be a pattern structure.
Fichier principal
Vignette du fichier
CLA18.pdf (337.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01818740 , version 1 (19-06-2018)


  • HAL Id : hal-01818740 , version 1


Aimene Belfodil, Sergei O. Kuznetsov, Mehdi Kaytoue. Pattern Setups and Their Completions. The 14th International Conference on Concept Lattices and Their Applications (CLA 2018), Jun 2018, Olomouc, Czech Republic. pp.243-253. ⟨hal-01818740⟩
275 View
113 Download


Gmail Facebook Twitter LinkedIn More