Reducing concept lattices by means of a weaker notion of congruence
DOI10.1016/J.FSS.2020.09.013zbMATH Open1467.06007OpenAlexW3090229265MaRDI QIDQ2049274FDOQ2049274
Jesús Medina, Eloísa Ramírez-Poussa, Roberto G. Aragón
Publication date: 24 August 2021
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2020.09.013
fuzzy setsformal concept analysiscongruence relationattribute reductionsize concept lattice reduction
Knowledge representation (68T30) Lattice ideals, congruence relations (06B10) Complete lattices, completions (06B23)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lattices and ordered algebraic structures
- Representation of lattices by fuzzy weak congruence relations
- On heterogeneous formal contexts
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Multi-adjoint property-oriented and object-oriented concept lattices
- Formal concept analysis via multi-adjoint concept lattices
- Attribute and size reduction mechanisms in multi-adjoint concept lattices
- Attribute reduction in multi-adjoint concept lattices
- Construction of the \(L\)-fuzzy concept lattice
- Characterizing reducts in multi-adjoint concept lattices
- On the lattice of weak congruence relations
- Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges
- Attribute reduction in generalized one-sided formal contexts
- A computational procedure for variable selection preserving different initial conditions
- A note on atomistic weak congruence lattices
- Using congruence relations to extract knowledge from concept lattices
- A fast attribute reduction method for large formal decision contexts
- On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method
- Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis
- Weak congruences of an algebra with the CEP and the WCIP
Cited In (5)
- Reduct-Irreducible $$\alpha $$ -cut Concept Lattices: An Efficient Reduction Procedure to Multi-adjoint Concept Lattices
- Note on the characterization and reduction of concept lattices through matroid theory
- Concept lattice simplification with fuzzy linguistic information based on three-way clustering
- A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators
- Residuated lattices of block relations: size reduction of concept lattices
This page was built for publication: Reducing concept lattices by means of a weaker notion of congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049274)
