提出在模糊框架下计算形式上下文独立子上下文的方法
Factorizing formal contexts from closures of necessity operators
- 基于可能性理论算子构造形式上下文的因子分解
- 扩展经典方法至模糊场景，支持非布尔数据
- 适用于需要降维或模块化分析的模糊逻辑研究者
数据集因子分解在诸多方法中具有重要意义，但其计算常因复杂性而不可行。本文分析了基于可能性理论算子的布尔形式上下文因子分解方法，研究了由此产生的集合对的相关性质。进一步探讨了经典情形下的性质如何推广至模糊框架，为实现模糊上下文独立子上下文的计算提供了机制基础。
原文摘要 · Abstract (English)
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~\cite{dubois: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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。