On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient

DOI10.1016/J.INS.2018.08.004MaRDI QIDQ2200602zbMATH OpenOpenAlexWikidataFDO

Authors Jan Konecny, Petr Krajca

Publication date 22 September 2020

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

discernibility matrixexperimental evaluationformal concept analysisreduction in concept lattice

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
• Attribute reduction in formal contexts based on a new discernibility matrix
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Object-concept discernibility matrix based approach to attribute reduction in three-way approximate concept lattice

Cites work

• A Novel Approach to Attribute Reduction in Concept Lattices
• Attribute reduction in formal contexts based on a new discernibility matrix
• Attribute reduction in generalized one-sided formal contexts
• Comparing performance of algorithms for generating concept lattices
• Comparison of data structures for computing formal concepts
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• Fuzzy and rough formal concept analysis: a survey
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 2168560 (Why is no real title available?)
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
• Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

Cited in

(7)

• A comparative study of decision implication, concept rule and granular rule
• General framework for consistencies in decision contexts
• On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method
• Dynamic concept reduction methods based on local information
• Inner product reduction for fuzzy formal contexts
• Stable concepts from communities and communities from concepts
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction

This page was built for publication: On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200602)