On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
From MaRDI portal
Publication:778428
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
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 978992 (Why is no real title available?)
- scientific article; zbMATH DE number 2168560 (Why is no real title available?)
- A formal concept analysis approach to rough data tables
- A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators
- Approximations in concept lattices
- Attribute reduction in formal contexts based on a new discernibility matrix
- Attribute reduction theory of concept lattice based on decision formal contexts
- Comparing performance of algorithms for generating concept lattices
- Concept analysis via rough set and AFS algebra
- Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory
- Concept lattices with negative information: a characterization theorem
- Fuzzy and rough formal concept analysis: a survey
- Generalization of one-sided concept lattices
- Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
- Knowledge reduction in real decision formal contexts
- Reduction method for concept lattices based on rough set theory and its application
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Rule acquisition and complexity reduction in formal decision contexts
- Scale Coarsening as Feature Selection
- Set approximations in fuzzy formal concept analysis
- Three-way formal concept analysis
- Variable threshold concept lattices
Cited in
(17)- A weakened notion of congruence to reduce concept lattices
- 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices
- Reduction-Based Approaches Towards Constructing Galois (Concept) Lattices
- Note on representing attribute reduction and concepts in concept lattice using graphs
- A knowledge reduction approach for linguistic concept formal context
- Describing hierarchy of concept lattice by using matrix
- Three-way reduction for formal decision contexts
- Object-concept discernibility matrix based approach to attribute reduction in three-way approximate concept lattice
- On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient
- On Shapley value interpretability in concept-based learning with formal concept analysis
- Quantitative three-way class-specific attribute reducts based on region preservations
- 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 in formal contexts based on a new discernibility matrix
- Formal Methods in FCA and Big Data
- Three-way class-specific attribute reducts from the information viewpoint
- A fast attribute reduction method for large formal decision contexts
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)
