Pages that link to "Item:Q526654"
From MaRDI portal
The following pages link to Attribute reduction in multi-adjoint concept lattices (Q526654):
Displaying 22 items.
- Attribute and size reduction mechanisms in multi-adjoint concept lattices (Q507906) (← links)
- Characterizing reducts in multi-adjoint concept lattices (Q781020) (← links)
- Adjoint negations, more than residuated negations (Q1671770) (← links)
- Representation of fuzzy subsets by Galois connections (Q1697650) (← links)
- On stability of fuzzy formal concepts over randomized one-sided formal context (Q1697981) (← links)
- 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices (Q2001133) (← links)
- Implication operators generating pairs of weak negations and their algebraic structure (Q2035405) (← links)
- Multi-adjoint concept lattices via quantaloid-enriched categories (Q2035409) (← links)
- Reducing concept lattices by means of a weaker notion of congruence (Q2049274) (← links)
- Impact of local congruences in variable selection from datasets (Q2059610) (← links)
- Generalized quantifiers in formal concept analysis (Q2059621) (← links)
- A weakened notion of congruence to reduce concept lattices (Q2093972) (← links)
- Knowledge implications in multi-adjoint concept lattices (Q2093975) (← links)
- Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis (Q2219197) (← links)
- Three-way attribute reducts (Q2411278) (← links)
- Attribute reduction of relative knowledge granularity in intuitionistic fuzzy ordered decision table (Q5024612) (← links)
- A computational procedure for variable selection preserving different initial conditions (Q5030589) (← links)
- (Q5093393) (← links)
- Reduct-Irreducible $$\alpha $$ -cut Concept Lattices: An Efficient Reduction Procedure to Multi-adjoint Concept Lattices (Q5117200) (← links)
- Unifying Reducts in Formal Concept Analysis and Rough Set Theory (Q5215755) (← links)
- Algebraic structure and characterization of adjoint triples (Q6081504) (← links)
- Factorizing formal contexts from closures of necessity operators (Q6537157) (← links)