Relation between concept lattice reduction and rough set reduction

One of the key problems of knowledge discovery is knowledge reduction. Rough set theory and the theory of concept lattices are two efficient tools for knowledge discovery. Attribute reduction based on rough set theory and the theory of concept lattices both have been researched. Since an information system, the data description of rough set theory, and a formal context, the data description of concept lattice theory, can be taken as the other one, the attribute reduction based on the same data base can be studied from these two perspectives, and researching their relation is significant. This paper mainly discusses the relation between concept lattice reduction and rough set reduction based on classical formal context, which will be meaningful for the relation research between these two theories, and for their knowledge discovery.

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

[2]  Miroslav Novotný,et al.  Dependence Spaces of Information Systems , 1998 .

[3]  Zhang Wen-xiu,et al.  Attribute reduction theory and approach to concept lattice , 2005 .

[4]  Ivo Düntsch,et al.  Algebraic Aspects of Attribute Dependencies in Information Systems , 1997, Fundam. Informaticae.

[5]  Radim Belohlávek,et al.  Concept lattices and order in fuzzy logic , 2004, Ann. Pure Appl. Log..

[6]  Xia Wang,et al.  Relations of attribute reduction between object and property oriented concept lattices , 2008, Knowl. Based Syst..

[7]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[8]  David A. Bell,et al.  Knowledge Discovery from Decision Tables by the Use of Multiple-Valued Logic , 2004, Artificial Intelligence Review.

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

[10]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[11]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[12]  G. Deon Oosthuizen.  Rough Sets and Concept Lattices , 1993, RSKD.

[13]  Wei Xu,et al.  Fuzzy inference based on fuzzy concept lattice , 2006, Fuzzy Sets Syst..

[14]  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.

[15]  Francisco Herrera,et al.  Recent advancements of fuzzy sets: Theory and practice , 2006, Inf. Sci..

[16]  Wei-Zhi Wu,et al.  Approaches to knowledge reductions in inconsistent systems , 2003, Int. J. Intell. Syst..

[17]  Ling Wei,et al.  A Partitional View of Concept Lattice , 2005, RSFDGrC.

[18]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

[19]  Wei-Zhi Wu,et al.  Approaches to knowledge reduction based on variable precision rough set model , 2004, Inf. Sci..

[20]  Wei Zhao,et al.  The Reduction Theory of Object Oriented Concept Lattices and Property Oriented Concept Lattices , 2009, RSKT.

[21]  Andrzej Skowron,et al.  A rough set approach to knowledge discovery , 2002, International Journal of Intelligent Systems.

[22]  J. Kacprzyk,et al.  Incomplete Information: Rough Set Analysis , 1997 .

[23]  Gerd Stumme,et al.  Formal Concept Analysis: foundations and applications , 2005 .

[24]  Robert E. Kent,et al.  Rough Concept Analysis: A Synthesis of Rough Sets and Formal Concept Analysis , 1996, Fundam. Informaticae.

[25]  Wen-Xiu Zhang,et al.  Attribute reduction theory of concept lattice based on decision formal contexts , 2008, Science in China Series F: Information Sciences.

[26]  Wen-Xiu Zhang,et al.  Variable Threshold Concept Lattice and Dependence Space , 2006, FSKD.

[27]  S. Tsumoto,et al.  Rough set methods and applications: new developments in knowledge discovery in information systems , 2000 .

[28]  J. Deogun,et al.  Concept approximations based on rough sets and similarity measures , 2001 .