Granule structures in formal contexts from covering rough set aspect

Formal concept analysis and covering rough set theory are two important mathematical tools for knowledge representation and knowledge discovery. Formal context is common framework of this two theories. The set of all extents of al object concepts of a formal context is a basic granulation of the object set, by which many compound granules can be generated. This paper focuses on the granular comuting based on the basic granulation. With respect to formal concept analysis and covering rough set theory, the granular structures in formal context are examined in detail.

[1]  Ling Wei,et al.  Relation between concept lattice reduction and rough set reduction , 2010, Knowl. Based Syst..

[2]  Daniel S. Yeung,et al.  Rough approximations on a complete completely distributive lattice with applications to generalized rough sets , 2006, Inf. Sci..

[3]  Knowledge spaces from a topological point of view , 2009 .

[4]  Yiyu Yao,et al.  A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis , 2004, Rough Sets and Current Trends in Computing.

[5]  Tong-Jun Li.  Rough Approximation Operators in Covering Approximation Spaces , 2006, RSCTC.

[6]  Qinghua Hu,et al.  An efficient gene selection technique for cancer recognition based on neighborhood mutual information , 2010, Int. J. Mach. Learn. Cybern..

[7]  Wen-Xiu Zhang,et al.  Rough fuzzy approximations on two universes of discourse , 2008, Inf. Sci..

[8]  Wen-Xiu Zhang,et al.  Measuring roughness of generalized rough sets induced by a covering , 2007, Fuzzy Sets Syst..

[9]  Yee Leung,et al.  Granular Computing and Knowledge Reduction in Formal Contexts , 2009, IEEE Transactions on Knowledge and Data Engineering.

[10]  Urszula Wybraniec-Skardowska,et al.  Extensions and Intentions in the Ruogh Set Theory , 1998, Inf. Sci..

[11]  Fei-Yue Wang,et al.  Reduction and axiomization of covering generalized rough sets , 2003, Inf. Sci..

[12]  Jitender S. Deogun,et al.  Sequential Association Rule Mining with Time Lags , 2004, Journal of Intelligent Information Systems.

[13]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[14]  William Zhu,et al.  Relationship among basic concepts in covering-based rough sets , 2009, Inf. Sci..

[15]  Wei-Zhi Wu,et al.  Attribute Reduction in Formal Contexts: A Covering Rough Set Approach , 2011, Fundam. Informaticae.

[16]  Tongjun Li,et al.  Rough Set Models on Granular Structures and Rule Induction , 2011 .

[17]  Bernard Monjardet,et al.  The presence of lattice theory in discrete problems of mathematical social sciences. Why , 2003, Math. Soc. Sci..

[18]  Bernhard Ganter,et al.  A Formal Concept Analysis Approach to Rough Data Tables , 2011, Trans. Rough Sets.