DeepAI AI Chat
Log In Sign Up

Finite Confluences and Closed Pattern Mining

by   Henry Soldano, et al.

The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept analysis to such structures we further call confluences. The primary motivation for investigating these structures is that it allows to reduce a lattice to a part whose elements are connected, as in some graph, still preserving a useful characterization of closure operators. Our investigation also considers how reducing one of the lattice involved in a Galois connection affects the structure of the closure operators ranges. When extending this way formal concept analysis we will focus on the intensional space, i.e. in reducing the pattern language, while recent investigations rather explored the reduction of the extensional space to connected elements.


On Pattern Setups and Pattern Multistructures

Modern order and lattice theory provides convenient mathematical tools f...

Boolean Substructures in Formal Concept Analysis

It is known that a (concept) lattice contains an n-dimensional Boolean s...

Discovery data topology with the closure structure. Theoretical and practical aspects

In this paper, we are revisiting pattern mining and especially itemset m...

The combinator M and the Mockingbird lattice

We study combinatorial and order theoretic structures arising from the f...

Delta-Closure Structure for Studying Data Distribution

In this paper, we revisit pattern mining and study the distribution unde...

On the Lattice of Conceptual Measurements

We present a novel approach for data set scaling based on scale-measures...

Interval-Dismantling for Lattices

Dismantling allows for the removal of elements of a set, or in our case ...