Skip to Main content Skip to Navigation
Conference papers

Pattern Setups and Their Completions

Abstract : 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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01818740
Contributor : Aimene Belfodil <>
Submitted on : Tuesday, June 19, 2018 - 5:40:06 PM
Last modification on : Tuesday, November 19, 2019 - 2:36:53 AM
Document(s) archivé(s) le : Tuesday, September 25, 2018 - 8:21:38 AM

File

CLA18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01818740, version 1

Citation

Aimene Belfodil, Sergei 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⟩

Share

Metrics

Record views

354

Files downloads

129