On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
From MaRDI portal
Publication:778428
DOI10.1016/j.ins.2017.06.013zbMath1435.68321OpenAlexW2707389940MaRDI QIDQ778428
Publication date: 2 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.06.013
Related Items (11)
Formal Methods in FCA and Big Data ⋮ A knowledge reduction approach for linguistic concept formal context ⋮ On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient ⋮ Three-way reduction for formal decision contexts ⋮ On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method ⋮ Three-way class-specific attribute reducts from the information viewpoint ⋮ A fast attribute reduction method for large formal decision contexts ⋮ 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices ⋮ Quantitative three-way class-specific attribute reducts based on region preservations ⋮ Describing hierarchy of concept lattice by using matrix ⋮ On Shapley value interpretability in concept-based learning with formal concept analysis
Cites Work
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Knowledge reduction in real decision formal contexts
- Concept analysis via rough set and AFS algebra
- Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory
- Attribute reduction in formal contexts based on a new discernibility matrix
- Attribute reduction theory of concept lattice based on decision formal contexts
- Concept lattices with negative information: a characterization theorem
- Rule acquisition and complexity reduction in formal decision contexts
- A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators
- Reduction method for concept lattices based on rough set theory and its application
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- Variable threshold concept lattices
- Set approximations in fuzzy formal concept analysis
- Three-Way Formal Concept Analysis
- Approximations in Concept Lattices
- Comparing performance of algorithms for generating concept lattices
- Fuzzy and rough formal concept analysis: a survey
- Scale Coarsening as Feature Selection
- A Formal Concept Analysis Approach to Rough Data Tables
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
