Relating attribute reduction in formal, object-oriented and property-oriented concept lattices

DOI10.1016/j.camwa.2012.03.087zbMath1268.06007OpenAlexW1984295198MaRDI QIDQ356097

Publication date: 25 July 2013

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2012.03.087

zbMATH Keywords

Galois connection formal concept analysis attribute reduction object-oriented concept lattices property-oriented concept lattices

Mathematics Subject Classification ID

Knowledge representation (68T30) Complete lattices, completions (06B23) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (42)

Comparison of reduction in formal decision contexts ⋮ On the use of thresholds in multi-adjoint concept lattices ⋮ Formal Methods in FCA and Big Data ⋮ A comprehensive survey on formal concept analysis, its research trends and applications ⋮ Attribute reduction of SE-ISI concept lattices for incomplete contexts ⋮ Lattice-theoretic contexts and their concept lattices via Galois ideals ⋮ A knowledge reduction approach for linguistic concept formal context ⋮ Similarity relations in fuzzy attribute-oriented concept lattices ⋮ Fuzzy concept lattice reduction using Shannon entropy and Huffman coding ⋮ Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts ⋮ Rough set decision algorithms for modeling with uncertainty ⋮ Bireducts with tolerance relations ⋮ A note on similarity relations between fuzzy attribute-oriented concept lattices ⋮ Value reducts and bireducts: A comparative study ⋮ On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient ⋮ Three-way reduction for formal decision contexts ⋮ Reduct-Irreducible $$\alpha $$ -cut Concept Lattices: An Efficient Reduction Procedure to Multi-adjoint Concept Lattices ⋮ Rough-set-driven approach for attribute reduction in fuzzy formal concept analysis ⋮ Connections between covering-based rough sets and concept lattices ⋮ Formal Concept Analysis with Constraints by EM Operators ⋮ Characterization of the infimum of classes induced by an attribute reduction in FCA ⋮ Linguistic descriptions of data via fuzzy formal concept analysis ⋮ Attribute and size reduction mechanisms in multi-adjoint concept lattices ⋮ Attribute reduction in multi-adjoint concept lattices ⋮ Concept learning via granular computing: a cognitive viewpoint ⋮ Relations of reduction between covering generalized rough sets and concept lattices ⋮ A fast attribute reduction method for large formal decision contexts ⋮ Rough sets based on Galois connections ⋮ An efficient method to factorize fuzzy attribute-oriented concept lattices ⋮ Three-way cognitive concept learning via multi-granularity ⋮ Attribute reduction in generalized one-sided formal contexts ⋮ A methodology for analysis of concept lattice reduction ⋮ Unifying Reducts in Formal Concept Analysis and Rough Set Theory ⋮ Reducing concept lattices by means of a weaker notion of congruence ⋮ Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context ⋮ Impact of local congruences in variable selection from datasets ⋮ On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction ⋮ Incremental mechanism of attribute reduction based on discernible relations for dynamically increasing attribute ⋮ Characterizing reducts in multi-adjoint concept lattices ⋮ A weakened notion of congruence to reduce concept lattices ⋮ Multi-adjoint fuzzy rough sets: definition, properties and attribute selection ⋮ A computational procedure for variable selection preserving different initial conditions

Cites Work

This page was built for publication: Relating attribute reduction in formal, object-oriented and property-oriented concept lattices