Factorizing formal contexts from closures of necessity operators
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 Dubois and Prade based on th...
Saved in:
Published in: | Computational & applied mathematics Vol. 43; no. 3 |
---|---|
Main Authors: | , , |
Format: | Journal Article |
Language: | English |
Published: |
Cham
Springer International Publishing
01-04-2024
Springer Nature B.V |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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 Dubois and Prade 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. |
---|---|
ISSN: | 2238-3603 1807-0302 |
DOI: | 10.1007/s40314-024-02590-0 |