Dependence and Algebraic Structure of Formal Contexts

  • Tong-Jun Li
  • Ying-Xue Wu
  • Xiaoping Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6954)


Formal concept analysis is an important approach of knowledge representation and data analysis. This paper focus on the dependence among formal contexts with common object set. A partial order relation among formal contexts is first introduced and its properties are examined. Subsequently, The notion of independence of a formal context is proposed by which attribute reduction of formal context is investigated. An useful conclusion is obtained, that is, all formal contexts with common object set form a lattice.


Formal contexts Concept lattices Dependence Algebraic structure 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ganter, B., Wille, R.: Formal Concept Analysis, Mathematic Foundations. Springer, Berlin (1999)CrossRefMATHGoogle Scholar
  2. 2.
    Belohlavek, R., De Baets, B., Outrata, J., Vychodil, V.: Inducing Decision Trees via Concept Lattices. International Journal of General Systems 38, 1563–5104 (2009)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Cole, R., Eklund, P., Stumme, G.: Document Retrieval for e-Mail Search and Discovery Using Formal Concept Analysis. Applied Artificial Intelligence 17, 257–280 (2003)CrossRefGoogle Scholar
  4. 4.
    Harms, S.K., Deogun, S.: Sequencial Association Rule with Time Lags. Journal of Intelligent Information Systems 22, 7–22 (2004)CrossRefGoogle Scholar
  5. 5.
    Wu, Q., Liu, Z.T.: Real Formal Concept Analysis Based on Grey-Rough Set Theory. Knowledge-Based Systems 22, 38–45 (2009)CrossRefGoogle Scholar
  6. 6.
    Hu, Q.H., Liu, J.F., Yu, D.R.: Mixed Feature Selection Based on Granulation and Approximation. Knowledge-Based Systems 21, 294–304 (2008)CrossRefGoogle Scholar
  7. 7.
    Leung, Y., Wu, W.Z., Zhang, W.X.: Knowledge Acquisition in Incomplete Information Systems: A Rough Set Approach. European Journal of Operational Research 168, 164–180 (2006)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Boston (1991)CrossRefMATHGoogle Scholar
  9. 9.
    Liu, M., Shao, M.W., Zhang, W.X., Wu, C.: Reduction Method for Concept Lattices Based on Rough Set Theory and Its Application. Computers and Mathematics with Applications 53, 1390–1410 (2007)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Wang, X., Zhang, W.X.: Relations of Attribute Reduction between Object and Property Oriented Concept Lattices. Knowledge-Based Systems 21, 398–403 (2008)CrossRefGoogle Scholar
  11. 11.
    Wu, W.Z., Leung, Y., Mi, J.S.: Granular Computing and Knowledge Reduction in Formal Contexts. IEEE Transactions on Knowledge and Data Engineering 21, 1461–1474 (2009)CrossRefGoogle Scholar
  12. 12.
    Zhang, W.X., Wei, L., Qi, J.J.: Attribute Reduction Theory and Approach to Concept Lattice. Science in China: Ser. F Information Sciences 48, 713–726 (2005)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Caspard, N., Monjardet, B.: The lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey. Discrete Applied Mathematics 127, 241–269 (2003)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Turunen, E.: Mathematics Behind Fuzzy Logic. Physica-Verlag, Heideberg (1999)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tong-Jun Li
    • 1
  • Ying-Xue Wu
    • 1
  • Xiaoping Yang
    • 1
  1. 1.School of Mathematics,Physics and Information ScienceZhejiang Ocean UniversityZhoushanP.R. China

Personalised recommendations