Attribute reduction in formal contexts based on a new discernibility matrix

DOI10.1007/s12190-008-0174-9zbMath1180.68263OpenAlexW1967434199MaRDI QIDQ1032017

Jian-Jun Qi

Publication date: 23 October 2009

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-008-0174-9

zbMATH Keywords

discernibility matrixconcept latticeformal contextattribute reductionformal concept

Mathematics Subject Classification ID

Knowledge representation (68T30) Complete lattices, completions (06B23)

Related Items (8)

Formal Methods in FCA and Big Data ⋮ Attribute reduction of SE-ISI concept lattices for incomplete contexts ⋮ Granular matrix method of attribute reduction in formal contexts ⋮ On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient ⋮ Three-way reduction for formal decision contexts ⋮ On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method ⋮ Compatible attribute subcontexts of one-sided vague formal concept lattices ⋮ On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal concept analysis. Foundations and applications.
• Ontology-based concept similarity in formal concept analysis
• Comparing performance of algorithms for generating concept lattices
• Similarity relations in concept lattices
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

This page was built for publication: Attribute reduction in formal contexts based on a new discernibility matrix