Granular Computing and Knowledge Reduction in Formal Contexts

Wei-Zhi Wu, Yee Leung, Ju‐Sheng Mi

IEEE Transactions on Knowledge and Data Engineering · 2008 · 375 citations · 46 references

Concepts

TL;DR

Granular computing and knowledge reduction are fundamental challenges in knowledge representation and data mining. This study investigates the granular structure of concept lattices to support knowledge reduction in formal concept analysis. The authors define information granules, granular consistent sets, and granular reducts in a formal context, then use discernibility matrices and Boolean functions to compute these sets and explore reduction methods in consistent formal decision contexts. They uncover hidden knowledge as compact implication rules derived from the formal context.

Abstract

Granular computing and knowledge reduction are two basic issues in knowledge representation and data mining. Granular structure of concept lattices with application in knowledge reduction in formal concept analysis is examined in this paper. Information granules and their properties in a formal context are first discussed. Concepts of a granular consistent set and a granular reduct in the formal context are then introduced. Discernibility matrices and Boolean functions are, respectively, employed to determine granular consistent sets and calculate granular reducts in formal contexts. Methods of knowledge reduction in a consistent formal decision context are also explored. Finally, knowledge hidden in such a context is unraveled in the form of compact implication rules.

References

46