Skip to main content
Log in

Attribute reduction in decision formal context based on homomorphism

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

Attribute reduction in concept lattices is one of the key problems in the study of concept lattice theory. This paper defines a homomorphism consistent set and provides an approach to attribute reduction of a consistent decision formal context based on concept lattices. We also examine the relationship between homomorphism consistent set and attribute consistent set. The method for judging a homomorphism consistent set is simpler than the existing ones.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

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

  2. Zhang W-X, Qiu G-F (2005) Uncertain decision making based on rough sets. Tsinghua University Press, Beijing

    Google Scholar 

  3. Ganter R, Wille B (1999) Formal concept analysis: mathematical foundations. Springer, Berlin

    Book  MATH  Google Scholar 

  4. Ma J-M, Zhang W-X, Cai S (2006) Variable threshold concept lattice and dependence space. In Conference on Fuzzy systems and knowledge discovery, pp 109–118

  5. Wang H, Zhang W-X (2008) Approaches to knowledge reduction in generalized consistent decision formal context. Math Comput Model 48:1677–1684

    Article  MATH  Google Scholar 

  6. Carpineto C, Romano G (1993) Galois: an order-theoretic approach to conceptual clustering. In: Utgoff P (ed) Proceedings of ICML, vol 293. Elsevier, Amherst, pp 33–40

  7. Duntsch I, Gediga G (2003) Approximation operators in qualitative data analysis. Lecture Notes in Computer Science, vol 2929. Springer, Berlin, pp 214–230

  8. Godin R (1995) Incremental concept formation algorithm based on Galois (concept) lattice. Comput Intell 11:246–267

    Article  Google Scholar 

  9. Wolff KE (2001) A conceptual view of knowledge bases in rough set theory. In: Rough sets and current trends in computing, Lecture Notes in Computer Science, vol 2005. Springer, Berlin, pp 220–228

  10. Wang Y, Wang G-Y, Deng W-B (2007) Concept lattice based data-driven uncertain knowledge acquisition. Pattern Recogn Artif Intell 20(5)

  11. Wei L, Qi J-J, Zhang W-X (2008) Attribute reduction in concept lattices of decision formal context. Sci China 38(2):195–208

    Google Scholar 

  12. Wang X, Zhang W-X (2008) Attribute reduction in concept lattices and attribute characteristics. Comput Eng Appl 44(12):1–4

    Google Scholar 

  13. Mi J-S, Leung Y, Wu W-Z (2010) Approaches to attribute reduction in concept lattices induced by axialities. Knowl Based Syst 23:504–511

    Article  Google Scholar 

  14. Yao Y-Y (2004) Concept lattices in rough set theory. Fuzzy Inform 2:796–801

    Google Scholar 

Download references

Acknowledgments

This paper is supported by the National Natural Science Foundation of China (No. 60963006, 61005042/F030502), and by Research Fund for the Doctoral Program of Higher Education of China 20101303110004.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ju-Sheng Mi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pei, D., Mi, JS. Attribute reduction in decision formal context based on homomorphism. Int. J. Mach. Learn. & Cyber. 2, 289–293 (2011). https://doi.org/10.1007/s13042-011-0034-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-011-0034-z

Keywords

Navigation