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

DOI10.1016/J.INS.2019.03.038zbMATH Open1451.68275OpenAlexW2928866650MaRDI QIDQ2214973FDOQ2214973

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

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

zbMATH Keywords

algorithmformal concept analysisdiscernibility matrixreduction in concept latticeclassification of attributes

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

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

Cited In (11)

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

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)