Knowledge reduction in generalized consistent decision formal contexts

Authors:
Hong Wang;Wei-Zhi Wu
Affiliations:
College of Mathematics and Computer Science, Shanxi Normal University, Linfen, Shanxi, P. R. China;School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan, Zhenjiang, P. R. China
Venue:
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Year:
2007

Citing 5
Cited 0

Rough concept analysis: a synthesis of rough sets and formal concept analysis

Fundamenta Informaticae - Special issue: rough sets
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Formal Rough Concept Analysis

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with knowledge reduction in generalized consistent decision formal contexts. The concept of a generalized consistent decision formal context is first introduced. Its equivalent definitions are also examined. The judgement theorem and discernibility matrix which are helpful for computing reducts are then established, from which we can obtain an approach to knowledge reduction in generalized consistent decision formal contexts.