Attribute reduction in multi-adjoint concept lattices

From MaRDI portal
Publication:526654

DOI10.1016/j.ins.2014.09.033zbMath1360.68805OpenAlexW2025014945MaRDI QIDQ526654

Jesús Medina, Eloísa Ramírez-Poussa, Maria Eugenia Cornejo

Publication date: 15 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.09.033




Related Items (21)

Adjoint negations, more than residuated negationsThree-way attribute reductsAlgebraic structure and characterization of adjoint triplesRepresentation of fuzzy subsets by Galois connectionsOn stability of fuzzy formal concepts over randomized one-sided formal contextReduct-Irreducible $$\alpha $$ -cut Concept Lattices: An Efficient Reduction Procedure to Multi-adjoint Concept LatticesRough-set-driven approach for attribute reduction in fuzzy formal concept analysisAttribute and size reduction mechanisms in multi-adjoint concept lattices0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept latticesUnnamed ItemImplication operators generating pairs of weak negations and their algebraic structureMulti-adjoint concept lattices via quantaloid-enriched categoriesUnifying Reducts in Formal Concept Analysis and Rough Set TheoryReducing concept lattices by means of a weaker notion of congruenceImpact of local congruences in variable selection from datasetsGeneralized quantifiers in formal concept analysisCharacterizing reducts in multi-adjoint concept latticesA weakened notion of congruence to reduce concept latticesKnowledge implications in multi-adjoint concept latticesAttribute reduction of relative knowledge granularity in intuitionistic fuzzy ordered decision tableA computational procedure for variable selection preserving different initial conditions



Cites Work


This page was built for publication: Attribute reduction in multi-adjoint concept lattices