On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method

DOI10.1016/J.INS.2019.03.038MaRDI QIDQ2214973zbMATHOpenAlexFDO

Authors Jan Konecny, Petr Krajca

Publication date 10 December 2020

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

algorithmformal concept analysisdiscernibility matrixreduction in concept latticeclassification of attributes

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
• Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
• Attribute reduction in formal contexts based on a new discernibility matrix
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

Cites work

• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 2168560 (Why is no real title available?)
• A methodology for analysis of concept lattice reduction
• Attribute reduction in formal contexts based on a new discernibility matrix
• Attribute reduction in generalized one-sided formal contexts
• Attribute reduction theory of concept lattice based on decision formal contexts
• Hypotheses and version spaces
• Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
• Knowledge reduction in real decision formal contexts
• On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rule acquisition and complexity reduction in formal decision contexts

Cited in

(11)

• A weakened notion of congruence to reduce concept lattices
• 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
• Reducing concept lattices by means of a weaker notion of congruence
• On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient
• Class-specific information measures and attribute reducts for hierarchy and systematicness
• Hierarchical quotient space-based concept cognition for knowledge graphs
• Formal Methods in FCA and Big Data
• New uncertainty measurement for categorical data based on fuzzy information structures: an application in attribute reduction
• Generalized quantifiers in formal concept analysis
• A comparative study of decision implication, concept rule and granular rule

This page was built for publication: On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method

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