Characterization and reduction of concept lattices through matroid theory

DOI10.1016/j.ins.2014.05.044zbMath1355.68248OpenAlexW2057191456MaRDI QIDQ507667

Hua Mao

Publication date: 7 February 2017

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

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

zbMATH Keywords

reductionconcept latticeattributeobjectA-bi-circuitmatroidal space

Mathematics Subject Classification ID

Knowledge representation (68T30) Complete lattices, completions (06B23) Combinatorial aspects of matroids and geometric lattices (05B35) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (7)

Rough sets and matroids from a lattice-theoretic viewpoint ⋮ Generalized matroids based on three-way decision models ⋮ Granular computing on information tables: families of subsets and operators ⋮ Representing attribute reduction and concepts in concept lattice using graphs ⋮ Relations of reduction between covering generalized rough sets and concept lattices ⋮ A methodology for analysis of concept lattice reduction ⋮ Approximation via a double-matroid structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Attribute reduction theory and approach to concept lattice
• Matroidal structure of rough sets from the viewpoint of graph theory
• Attribute reduction theory of concept lattice based on decision formal contexts
• Formal concept analysis. Foundations and applications.
• Knowledge acquisition in incomplete information systems: a rough set approach
• Reducts within the variable precision rough sets model: A further investigation

This page was built for publication: Characterization and reduction of concept lattices through matroid theory