Connections between covering-based rough sets and concept lattices

International Journal of Approximate Reasoning

Volumn 56, Issue PA, 2015, Pages 43-58

  Tan, Anhui ^a,b   Li, Jinjin ^b   Lin, Guoping ^b,c  

^a XIAMEN UNIVERSITY   (China)

^b MINNAN NORMAL UNIVERSITY   (China)

^c SHANXI UNIVERSITY   (China)

Author keywords

Algorithm; Approximation operator; Concept lattice; Covering based rough sets; Formal concept analysis; Knowledge reduction

Indexed keywords

FORMAL CONCEPT ANALYSIS;

APPROXIMATION OPERATORS; CONCEPT LATTICES; KNOWLEDGE REDUCTION;

ALGORITHMS;

EID: 84912064539     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2014.09.001     Document Type: Article

References (50)

1. E.A. Abo-Tabl, A comparison of two kinds of definitions of rough approximations based on a similarity relation, Inf. Sci. 181 (2011) 2587-2596.
2. Z. Bonikowski, E. Bryniarski, U. Wybraniec-Skardowska, Extensions and intensions in the rough set theory, Inf. Sci. 107 (1998) 149-167.
3. M.K. Chakraborty, Membership function based rough set, Int. J. Approx. Reason. 55 (2014) 402-411.
4. D.G. Chen, C.Z. Wang, Q.H. Hu, A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets, Inf. Sci. 177 (2007) 3500-3518.
5. D.G. Chen, W.L. Li, X. Zhang, S. Kwong, Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets, Int. J. Approx. Reason. 55 (2014) 908-923.
6. I. Düntsch, G. Gediga, Approximation operators in qualitative data analysis, in: H. de Swart, E. Orlowska, G. Schmidt, M. Roubens (Eds.), Theory and Application of Relational Structures as Knowledge Instruments, Springer, Heidelberg 2929, 2003, pp.214-230.
7. G. Gediga, R. Wille, Formal Concept Analysis, Mathematic Foundations, Springer, Berlin, 1999.
8. J. Grzymala-Busse, P. Clark, M. Kuehnhausen, Generalized probabilistic approximations of incomplete data, Int. J. Approx. Reason. 55 (2014) 180-196.
9. J. Järvinen, Lattice theory for rough sets, in: Transactions on Rough Sets VI, in: Lect. Notes Comput. Sci., vol.4374, 2007, pp.400-498.
10. S.O. Kuznetsov, S.A. Obiedkov, Comparing performance of algorithms for generating concept lattices, J. Exp. Theor. Artif. Intell. 14 (2002) 189-216.
11. J.H. Li, C.L. Mei, Y.J. Lv, A heuristic knowledge-reduction method for decision formal contexts, Comput. Math. Appl. 61 (2011) 1096-1106.
12. J.H. Li, C.L. Mei, Y.J. Lv, Knowledge reduction in real decision formal contexts, Inf. Sci. 189 (2012) 191-207.
13. J.H. Li, C.L. Mei, Y.J. Lv, Knowledge reduction in formal decision contexts based on an order-preserving mapping, Int. J. Gen. Syst. 41 (2012) 143-161.
14. J.H. Li, C.L. Mei, A.K. Cherukuri, X. Zhang, On rule acquisition in decision formal contexts, Int. J. Mach. Learn. Cybern. 4 (2013) 721-731.
15. J.H. Li, C.L. Mei, Y.J. Lv, Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction, Int. J. Approx. Reason. 54 (2013) 149-165.
16. T.J. Li, Knowledge reduction in formal contexts based on covering rough sets, in: Lect. Notes Comput. Sci., vol.5589, 2009, pp.128-135.
17. G.P. Lin, J.Y. Liang, Y.H. Qian, Multigranulation rough sets: from partition to covering, Inf. Sci. 241 (2013) 101-118.
18. M. Liu, M.W. Shao, W.X. Zhang, C. Wu, Reduction method for concept lattices based on rough set theory and its application, Comput. Math. Appl. 53 (2007) 1390-1410.
19. J. Medina, Relating attribute reduction in formal, object-oriented and property-oriented concept lattices, Comput. Math. Appl. 64 (2012) 1992-2002.
20. P. Pagliani, From concept lattices to approximation spaces: algebraic structures of some spaces of partial objects, Fundam. Inform. 18 (1993) 1-25.
21. P. Pagliani, M.K. Chakraborty, Pretopologies and dynamic spaces, Fundam. Inform. 59 (2004) 221-239.
22. P. Pagliani, Transforming information systems, in: Lect. Notes Comput. Sci., vol. 3641, 2005, pp.660-670.
23. P. Pagliani, M.K. Chakraborty, Information quanta and approximation spaces. I: Non-classical approximation operators, in: Proceedings of IEEE International Conference on Granular Computing, vol.2, 2005, pp.605-610.
24. P. Pagliani, M.K. Chakraborty, Information quanta and approximation spaces. II: Non-classical approximation operators, in: Proceedings of IEEE Interna-tional Conference on Granular Computing, vol.2, 2005, pp.611-616.
25. P. Pagliani, M.K. Chakraborty, Formal topology and information systems, in: Lect. Notes Comput. Sci., vol.4374, 2007, pp.253-297.
26. P. Pagliani, M.K. Chakraborty, A Geometry of Approximation: Rough Set Theory: Logic, Algebra and Topology of Conceptual Patterns, Springer, Berlin, 2008.
27. Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning About Data, Kluwer Academic Publishers, Dordrecht, 1991.
28. J. Pomykała, Approximation operators in approximation space, Bull. Pol. Acad. Sci., Math. 35 (1987) 653-662.
29. Y.H. Qian, H. Zhang, Y.L. Sang, J.Y. Liang, Multigranulation decision-theoretic rough sets, Int. J. Approx. Reason. 55 (2014) 225-237.
30. Y.H. Qian, H. Zhang, F.J. Li, Q.H. Hu, J.Y. Liang, Set-based granular computing: a lattice model, Int. J. Approx. Reason. 55 (2014) 834-852.
31. M. Restrepo, C. Cornelis, J. Gómez, Duality, conjugacy and adjointness of approximation operators in covering-based rough sets, Int. J. Approx. Reason. 55 (2014) 469-485.
32. M.W. Shao, W.X. Zhang, Approximation in formal concept analysis, in: Proceedings of RSFDGrC 2005, in: Lect. Notes Artif. Intell., 2005, pp.43-52.
33. M.W. Shao, Y. Leung, W.Z. Wu, Rule acquisition and complexity reduction in formal decision contexts, Int. J. Approx. Reason. 55 (2014) 259-274.
34. Y.H. She, On the rough consistency measures of logic theories and approximate reasoning in rough logic, Int. J. Approx. Reason. 55 (2014) 486-499.
35. E.C.C. Tsang, D.G. Chen, J.W.T. Lee, D.S. Yeung, On the upper approximations of covering generalized rough sets, in: Proceedings of the Third Interna-tional Conference on Machine Learning and Cybernetics, vol.7, 2004, pp.4200-4203.
36. X. Wang, W.X. Zhang, Relations of attribute reduction between object and property oriented concept lattices, Knowl.-Based Syst. 21 (2008) 398-403.
37. L. Wei, J.J. Qi, Relation between concept lattice reduction and rough set reduction, Knowl.-Based Syst. 23 (2010) 934-938.
38. R. Wille, Restructuring lattice theory: an approach based on hierarchies of concepts, in: I. Rival (Ed.), Ordered Sets, Reidel, Dordrecht-Boston, 1982, pp.445-470.
39. W.Z. Wu, Y. Leung, J.S. Mi, Granular computing and knowledge reduction in formal contexts, IEEE Trans. Knowl. Data Eng. 21(10) (2009) 1464-1474.
40. W.H. Xu, J.Z. Pang, S.Q. Luo, A novel cognitive system model and approach to transformation of information granules, Int. J. Approx. Reason. 55 (2014) 853-866.
41. T. Yang, Q.G. Li, Reduction about approximation spaces of covering generalized rough sets, Int. J. Approx. Reason. 51 (2010) 335-345.
42. Y.Y. Yao, Relational interpretations of neighborhood operators and rough set approximation operators, Inf. Sci. 101 (1998) 239-259.
43. Y.Y. Yao, Rough set approximations in formal concept analysis, in: S. Dick, L. Kurgan, W. Pedrycz, M. Reformat (Eds.), Proceedings of 2004 Annual Meeting of the North American Fuzzy Information Processing Society, IEEE, 2004, pp.73-78.
44. Y.Y. Yao, A comparative study of formal concept analysis and rough set theory in data analysis, in: Proceedings of 3rd International Conference on RSCTC'04, 2004, pp.59-68.
45. Y.Y. Yao, Concept lattices in rough set theory, in: Proceedings of 23rd International Meeting of the North American Fuzzy Information Processing Society, 2004, pp.796-801.
46. Y.Y. Yao, B.X. Yao, Covering based rough set approximations, Inf. Sci. 200 (2012) 91-107.
47. W. Żakowski, Approximations in the space (u, π), Demonstr. Math. 16 (1983) 761-769.
48. W.X. Zhang, L. Wei, J.J. Qi, Attribute reduction theory and approach to concept lattice, Sci. China, Ser. F, Inf. Sci. 48 (2005) 713-726.
49. W. Zhu, F.Y. Wang, Reduction and axiomization of covering generalized rough sets, Inf. Sci. 152 (2003) 217-230.
50. W. Zhu, F.Y. Wang, On three types of covering rough sets, IEEE Trans. Knowl. Data Eng. 19 (2007)