Issue No. 10 - October (2009 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.223
Ju-Sheng Mi , Hebei Normal University, Shijiazhuang
Wei-Zhi Wu , Zhejiang Ocean University, Zhoushan
Yee Leung , The Chinese University of Hong Kong, Hong Kong
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.
Concept lattices, data mining, formal contexts, granular computing, granules, knowledge reduction, rough sets.
Ju-Sheng Mi, Wei-Zhi Wu, Yee Leung, "Granular Computing and Knowledge Reduction in Formal Contexts", IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 1461-1474, October 2009, doi:10.1109/TKDE.2008.223