Connections between covering-based rough sets and concept lattices

Covering-based rough sets and formal concept analysis are two complementary tools for data analysis. This study systematically explores their connections in terms of approximation operators, structures and knowledge reduction. First, we show that three pairs of approximation operators-element-based, granule-based and subsystem-based, in covering-based rough sets, are accordant with the approximation operators in formal concept analysis. On this basis, one can easily conclude that the approximation spaces of coverings and concept lattices are related and that their reducts are coincident. Second, the high-level approximation operators of formal concept analysis are introduced into covering-based rough sets. In the end, we construct several reduction algorithms for a covering that could also be used to compute the reducts of a formal context. Experiments are conducted to assess their efficiencies. Connections between covering-based rough sets and concept lattices are studied.High-level approximation operators are introduced into covering-based rough sets.Reduction algorithms for covering-based rough sets are constructed.

[1]  Piero Pagliani,et al.  From Concept Lattices to Approximation Spaces: Algebraic Structures of Some Spaces of Partial Objects , 1993, Fundam. Informaticae.

[2]  Mihir K. Chakraborty,et al.  Membership function based rough set , 2014, Int. J. Approx. Reason..

[3]  Chen Degang,et al.  A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets , 2007 .

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

[5]  E. A. Abo-Tabl.  A comparison of two kinds of definitions of rough approximations based on a similarity relation , 2011, Inf. Sci..

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

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

[8]  Qinghua Hu,et al.  A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets , 2007, Inf. Sci..

[9]  Tong-Jun Li.  Knowledge Reduction in Formal Contexts Based on Covering Rough Sets , 2009, RSKT.

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

[11]  Yiyu Yao,et al.  Concept lattices in rough set theory , 2004, IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04..

[12]  Qingguo Li,et al.  Reduction about approximation spaces of covering generalized rough sets , 2010, Int. J. Approx. Reason..

[13]  Atsuo Murata,et al.  Rough Set Approximations in Formal Concept Analysis , 2010, Trans. Rough Sets.

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

[15]  Mihir K. Chakraborty,et al.  Formal Topology and Information Systems , 2007, Trans. Rough Sets.

[16]  Jouni Järvinen,et al.  Lattice Theory for Rough Sets , 2007, Trans. Rough Sets.

[17]  Ming-Wen Shao,et al.  Reduction method for concept lattices based on rough set theory and its application , 2007, Comput. Math. Appl..

[18]  Jinhai Li,et al.  Knowledge reduction in real decision formal contexts , 2012, Inf. Sci..

[19]  Xiao Zhang,et al.  Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets , 2014, Int. J. Approx. Reason..

[20]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[21]  Jesús Medina,et al.  Relating attribute reduction in formal, object-oriented and property-oriented concept lattices , 2012, Comput. Math. Appl..

[22]  Piero Pagliani.  Information quanta and approximation spaces II: generalised approximation spaces , 2005, 2005 IEEE International Conference on Granular Computing.

[23]  Wen-Xiu Zhang,et al.  Attribute reduction theory and approach to concept lattice , 2007, Science in China Series F: Information Sciences.

[24]  Piero Pagliani.  Information quanta and approximation spaces. I. Non-classical approximation operators , 2005, 2005 IEEE International Conference on Granular Computing.

[25]  Jinhai Li,et al.  Knowledge reduction in decision formal contexts , 2011, Knowl. Based Syst..

[26]  Xiao Zhang,et al.  On rule acquisition in decision formal contexts , 2013, Int. J. Mach. Learn. Cybern..

[27]  Yiyu Yao,et al.  Relational Interpretations of Neigborhood Operators and Rough Set Approximation Operators , 1998, Inf. Sci..

[28]  Mihir K. Chakraborty,et al.  A Geometry of Approximation: Rough Set Theory: Logic, Algebra and Topology of Conceptual Patterns , 2008 .

[29]  Bernhard Ganter,et al.  Formal Concept Analysis , 1999, Springer Berlin Heidelberg.

[30]  Weihua Xu,et al.  A novel cognitive system model and approach to transformation of information granules , 2014, Int. J. Approx. Reason..

[31]  Jerzy W. Grzymala-Busse,et al.  Generalized probabilistic approximations of incomplete data , 2014, Int. J. Approx. Reason..

[32]  Piero Pagliani,et al.  Pretopologies and Dynamic Spaces , 2003, Fundam. Informaticae.

[33]  Jinhai Li,et al.  Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction , 2013, Int. J. Approx. Reason..

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

[35]  Chris Cornelis,et al.  Duality, conjugacy and adjointness of approximation operators in covering-based rough sets , 2014, Int. J. Approx. Reason..

[36]  Ming-Wen Shao,et al.  Approximation in Formal Concept Analysis , 2005, RSFDGrC.

[37]  W. Zakowski.  APPROXIMATIONS IN THE SPACE (U,π) , 1983 .

[38]  J.W.T. Lee,et al.  On the upper approximations of covering generalized rough sets , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

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

[40]  Ming-Wen Shao,et al.  Rule acquisition and complexity reduction in formal decision contexts , 2014, Int. J. Approx. Reason..

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

[42]  Jinhai Li,et al.  Knowledge reduction in formal decision contexts based on an order-preserving mapping , 2012, Int. J. Gen. Syst..

[43]  Ivo Düntsch,et al.  Approximation Operators in Qualitative Data Analysis , 2003, Theory and Applications of Relational Structures as Knowledge Instruments.

[44]  Piero Pagliani,et al.  Transforming Information Systems , 2005, RSFDGrC.

[45]  Jinhai Li,et al.  A heuristic knowledge-reduction method for decision formal contexts , 2011, Comput. Math. Appl..

[46]  Jiye Liang,et al.  International Journal of Approximate Reasoning Multigranulation Decision-theoretic Rough Sets , 2022 .

[47]  Yanhong She,et al.  On the rough consistency measures of logic theories and approximate reasoning in rough logic , 2014, Int. J. Approx. Reason..

[48]  Jiye Liang,et al.  Multigranulation rough sets: From partition to covering , 2013, Inf. Sci..

[49]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

[50]  Yiyu Yao,et al.  Covering based rough set approximations , 2012, Inf. Sci..

[51]  Qinghua Hu,et al.  Set-based granular computing: A lattice model , 2014, Int. J. Approx. Reason..