Reduct-Irreducible $$\alpha $$ -cut Concept Lattices: An Efficient Reduction Procedure to Multi-adjoint Concept Lattices

DOI10.1007/978-3-319-40581-0_7zbMath1455.68200OpenAlexW2476023690MaRDI QIDQ5117200

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

Publication date: 20 August 2020

Published in: Information Processing and Management of Uncertainty in Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40581-0_7

zbMATH Keywords

fuzzy setsformal concept analysisconcept lattice reduction

Mathematics Subject Classification ID

Knowledge representation (68T30) Fuzzy lattices (soft algebras) and related topics (06D72)

Cites Work

• Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
• Attribute reduction in multi-adjoint concept lattices
• A comparative study of adjoint triples
• Multi-adjoint algebras versus non-commutative residuated structures
• Formal concept analysis via multi-adjoint concept lattices
• Evolution in time of \(L\)-fuzzy context sequences
• On the connection of hypergraph theory with formal concept analysis and rough set theory
• Formal concept analysis of higher order
• Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
• On the use of thresholds in multi-adjoint concept lattices

This page was built for publication: Reduct-Irreducible $$\alpha $$ -cut Concept Lattices: An Efficient Reduction Procedure to Multi-adjoint Concept Lattices