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.013zbMATH Open1435.68321OpenAlexW2707389940MaRDI QIDQ778428FDOQ778428
Authors: Jan Konecny 
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
Recommendations
- Attribute reduction in formal contexts based on a new discernibility matrix
- On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method
- Attribute reduction theory and approach to concept lattice
Cites Work
- Title not available (Why is that?)
- Comparing performance of algorithms for generating concept lattices
- Title not available (Why is that?)
- Approximations in concept lattices
- Title not available (Why is that?)
- A formal concept analysis approach to rough data tables
- Rule acquisition and complexity reduction in formal decision contexts
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Knowledge reduction in real decision formal contexts
- Fuzzy and rough formal concept analysis: a survey
- Reduction method for concept lattices based on rough set theory and its application
- Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory
- Attribute reduction theory of concept lattice based on decision formal contexts
- A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators
- Variable threshold concept lattices
- Concept analysis via rough set and AFS algebra
- Set approximations in fuzzy formal concept analysis
- Three-way formal concept analysis
- Scale Coarsening as Feature Selection
- Generalization of one-sided concept lattices
- Attribute reduction in formal contexts based on a new discernibility matrix
- Concept lattices with negative information: a characterization theorem
Cited In (17)
- Reduction-Based Approaches Towards Constructing Galois (Concept) Lattices
- On Shapley value interpretability in concept-based learning with formal concept analysis
- 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
- On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient
- On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method
- A knowledge reduction approach for linguistic concept formal context
- A weakened notion of congruence to reduce concept lattices
- Object-concept discernibility matrix based approach to attribute reduction in three-way approximate concept lattice
- Describing hierarchy of concept lattice by using matrix
- Three-way reduction for formal decision contexts
- Note on representing attribute reduction and concepts in concept lattice using graphs
- Attribute reduction in formal contexts based on a new discernibility matrix
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Formal Methods in FCA and Big Data
- Quantitative three-way class-specific attribute reducts based on region preservations
This page was built for publication: On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778428)
