Skip to main content
Springer Nature Link
Log in

Reduction-Based Approaches Towards Constructing Galois (Concept) Lattices

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4062))

Included in the following conference series:

  • 1072 Accesses

Abstract

Galois (concept) lattices and formal concept analysis have been proved useful in the resolution of many problems of theoretical and practical interest. Recent studies have put the emphasis on the need for both efficient and flexible algorithms to construct the lattice. In this paper, the concept of attribute reduction of formal concept was proposed with its properties being discussed. The CL–Axiom and some equivalent conditions for an attributes subset to be a reduction of a formal concept are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Birkhoff, B. (ed.): Lattice Theory. American Mathematical Society Colloquium Publ., Providence, RI (1973)

    Google Scholar 

  2. Wille, R.: Restructuring the lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht, Boston (1982)

    Google Scholar 

  3. Wille, R.: Lattices in data analysis: how to draw them with a computer. In: Wille, R., et al. (eds.) Algorithms and order, pp. 33–58. Kluwer Acad. Publ., Dordrecht (1989)

    Google Scholar 

  4. Wille, R.: Concepe lattices and conceptual knowledge systems. Comput. Math. Apll. 23(6-9), 493–515 (1992)

    Article  MATH  Google Scholar 

  5. Zhang, W.X., Wei, L., Qi, J.J.: Attribute Reduction in Concept Lattice Based on Discernibility Matrix. In: Proceedings of the Tenth International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Canada, pp. 157–165 (2005)

    Google Scholar 

  6. Yao, Y.Y.: A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis. In: Proceedings of 4th International Conference on Rough Sets and Current Trends in Computing, Uppsala, Sweden, pp. 59–68 (2004)

    Google Scholar 

  7. Ganter, B. (ed.): Two basic algorithms in concept analysis. Technische Hochschule, Darmstadt (1984)

    Google Scholar 

  8. Ganter, B., Wille, R. (eds.): Formal Concept Analysis. Mathematical Foundations. Springer, Berlin (1999)

    MATH  Google Scholar 

  9. Norris, E.M.: An algorithm for computing the maximal rectangles in a binary relation. Rev. Roumaine Math. Pures Appl. 23(2), 243–250 (1978)

    MATH  MathSciNet  Google Scholar 

  10. Bordat, J.P.: Calcul pratique du treillis de Galois d’une correspondance. Mat. Sci. Hum. 96, 31–47 (1986)

    MATH  MathSciNet  Google Scholar 

  11. Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence 11(2), 246–267 (1995)

    Article  Google Scholar 

  12. Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inform. Process. Lett. 71, 199–204 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards constructing Galois (concept) lattices. Discrete Mathematics 256, 801–829 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Economics and Management, Southwest Jiaotong University, Chengdu, Sichuan, 610031, China

    Jingyu Jin

  2. Chongqing Technology and Business University, Chongqing, 400067, China

    Jingyu Jin

  3. Department of Mathematics, Southwest Jiaotong University, Chengdu, Sichuan, 610031, China

    Keyun Qin

  4. School of Mathematics & Computer Engineering, Xihua University, Chengdu, Sichuan, 610039, China

    Zheng Pei

Authors
  1. Jingyu Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keyun Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zheng Pei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computer Science and Technology, Chongqing, University of Posts and Telecommunication, 400065, Chongqing, P.R. China

    Guo-Ying Wang

  2. Department of Electrical and Computer Engineering, University of Manitoba, R3T 5V6, Winnipeg, Manitoba, Canada

    James F. Peters

  3. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

  4. Department of Computer Science, University of Regina, Regina,, S4S 0A2, Saskatchewan, Canada

    Yiyu Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, J., Qin, K., Pei, Z. (2006). Reduction-Based Approaches Towards Constructing Galois (Concept) Lattices. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_16

Download citation

  • DOI: https://doi.org/10.1007/11795131_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36297-5

  • Online ISBN: 978-3-540-36299-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation