# Factorizing formal contexts from closures of necessity operators

arXiv: https://arxiv.org/abs/2604.09582 · HTML: https://mlsanity.com/paper/2604.09582/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 42 references that are in the map.
- First posted on arXiv 25 Feb 2026.

## Builds on (most cited first, 1 of 1)

- [From-Below Approximations in Boolean Matrix Factorization: Geometry and New Algorithm](https://mlsanity.com/paper/1306.4905/) (2013)

## Abstract (arXiv)

Factorizing datasets is an interesting process in a multitude of approaches, but many times it is not possible or efficient the computation of a factorization of the dataset. A method to obtain independent subcontexts of a formal context with Boolean data was proposed in~citedubois:2012, based on the operators used in possibility theory. In this paper, we will analyze this method and study different properties related to the pairs of sets from which a factorization of a formal context arises. We also inspect how the properties given in the classical case can be extended to the fuzzy framework, which is essential to obtain a mechanism that allows the computation of independent subcontexts of a fuzzy context.