A Knowledge Acquisition Model Based on Formal Concept Analysis in Complex Information Systems

  • Xiangping KangEmail author
  • Duoqian Miao
  • Na Jiao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9437)


Normally, in some complex information systems, the binary relation on domain of any attribute is just a kind of ordinary binary, which does not meet some common properties such as reflexivity, transitivity or symmetry. In view of the above-mentioned facts this paper attempts to employ FCA(Formal Concept Analysis), proposes a rough set model based on FCA, in which equivalence relations, dominance relations, similarity relations(or tolerance relations) and neighborhood relations on universe are expanded to general binary relations and problems in rough set theory are discussed based on FCA. Particularly, from the above description of complex information systems, we can see that the relation in domain of any attribute may be extremely complex, which often leads to high time complexity and space complexity in the process of knowledge acquisition. For above reason this paper introduces granular computing(GrC), which can effectively reduce the complexity to a certain extent.


Rough set Formal concept analysis Granular computing 



We would like to thank anonymous reviewers very much for their professional comments and valuable suggestions. This work was supported by the National Postdoctoral Science Foundation of China (No. 2014M560352) and the National Natural Science Foundation of China (No. 61273304).


  1. 1.
    Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)CrossRefGoogle Scholar
  2. 2.
    Greco, S., Matarazzo, B., Slowinski, R.: Rough approximation of a preference relation by dominance relation. Eur. J. Oper. Res. 117, 63–83 (1999)CrossRefGoogle Scholar
  3. 3.
    Kang, X.P., Li, D.Y., Wang, S.G., Qu, K.S.: Rough set model based on formal concept analysis. Inf. Sci. 222, 611–625 (2013)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Leung, Y., Li, D.Y.: Maximal consistent block technique for rule acquisition in incomplete information systems. Inf. Sci. 153, 85–106 (2003)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Mi, J.S., Leung, Y., Wu, W.Z.: Approaches to attribute reduct in concept lattices induced by axialities. Knowl.-Based Syst. 23, 504–511 (2010)CrossRefGoogle Scholar
  6. 6.
    Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11, 341–356 (1982)CrossRefGoogle Scholar
  7. 7.
    Saaty, T.L.: A scaling method for priorities in hierarchical structures. J. Math. Psychol. 15(3), 234–281 (1977)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. Knowl. Data Eng. 12, 331–336 (2000)CrossRefGoogle Scholar
  9. 9.
    Wei, L., Qi, J.J.: Relation between concept lattice reduct and rough set reduct. Knowl.-Based Syst. 23, 934–938 (2010)CrossRefGoogle Scholar
  10. 10.
    Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht, Boston (1982)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (, which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Authors and Affiliations

  1. 1.The Key Laboratory of Embedded System and Service Computing, Ministry of EducationTongji UniversityShanghaiPeople’s Republic of China
  2. 2.Department of Information Science and TechnologyEast China University of Political Science and LawShanghaiPeople’s Republic of China

Personalised recommendations