Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Reducts of fuzzy contexts: Formal concept analysis vs. rough set theory

Yuxu Chen, Jing Liu, Lili Shen, Xiaoye Tang

TL;DR

This paper investigates reducts of fuzzy contexts valued in a complete residuated lattice $L$ within formal concept analysis (FCA) and rough set theory (RST). It develops streamlined, parallel notions of reducts in both FCA and RST using infomorphisms and comparison maps, and proves the central result that FCA- and RST-reducts are interdefinable via negation if and only if the lattice $L$ satisfies the law of double negation, i.e., $ eg eg a=1_L$ for all $a$. The work provides concrete reducibility criteria, a suite of examples illustrating when the equivalence holds or fails, and two algorithms to verify reducts in practice. These findings clarify when FCA and RST techniques align in fuzzy data analysis and offer practical tools for canonical reduction of fuzzy contexts.

Abstract

We postulate the intuitive idea of reducts of fuzzy contexts based on formal concept analysis and rough set theory. For a complete residuated lattice $L$, it is shown that reducts of $L$-contexts in formal concept analysis are interdefinable with reducts of $L$-contexts in rough set theory via negation if, and only if, $L$ satisfies the law of double negation.

Reducts of fuzzy contexts: Formal concept analysis vs. rough set theory

TL;DR

This paper investigates reducts of fuzzy contexts valued in a complete residuated lattice within formal concept analysis (FCA) and rough set theory (RST). It develops streamlined, parallel notions of reducts in both FCA and RST using infomorphisms and comparison maps, and proves the central result that FCA- and RST-reducts are interdefinable via negation if and only if the lattice satisfies the law of double negation, i.e., for all . The work provides concrete reducibility criteria, a suite of examples illustrating when the equivalence holds or fails, and two algorithms to verify reducts in practice. These findings clarify when FCA and RST techniques align in fuzzy data analysis and offer practical tools for canonical reduction of fuzzy contexts.

Abstract

We postulate the intuitive idea of reducts of fuzzy contexts based on formal concept analysis and rough set theory. For a complete residuated lattice , it is shown that reducts of -contexts in formal concept analysis are interdefinable with reducts of -contexts in rough set theory via negation if, and only if, satisfies the law of double negation.

Paper Structure

This paper contains 8 sections, 16 theorems, 125 equations, 2 tables, 2 algorithms.

Table of Contents

  1. Introduction
  2. $L$-contexts, $L$-orders and complete $L$-lattices
  3. Reducts of $L$-contexts in formal concept analysis
  4. Reducts of $L$-contexts in rough set theory
  5. Reducts of $L$-contexts: Formal concept analysis vs. rough set theory
  6. Examples
  7. Algorithms
  8. Conclusions and future work

Key Result

Proposition 2.2

(See Shen2013Shen2013a.) Let $c$ be an $L$-closure operator on an $L$-ordered set $X$. Let Then

Theorems & Definitions (41)

  • Example 1.1
  • Example 2.1
  • Proposition 2.2
  • Proposition 2.3
  • Remark 3.1
  • Theorem 3.2
  • Definition 3.3
  • Definition 3.4
  • Proposition 3.5
  • Theorem 3.6
  • ...and 31 more