Skip to main content
Log in

Basic theorem as representation of heterogeneous concept lattices

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

We propose a method for representing heterogeneous concept lattices as classical concept lattices. Particularly, we describe a transformation of heterogeneous formal context into a binary one, such that corresponding concept lattices will be isomorphic. We prove the correctness of this transformation by the basic theorem for heterogeneous as well as classical concept lattices.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Belohlávek R. Lattices generated by binary fuzzy relations. Tatra Mountains Mathematical Publications, 1999, 16: 11–19

    MathSciNet  MATH  Google Scholar 

  2. Belohlávek R. Lattices of fixed points of fuzzy galois connections. Mathematical Logic Quarterly, 2001, 47(1): 111–116

    Article  MathSciNet  MATH  Google Scholar 

  3. Krajci S. Cluster based efficient generation of fuzzy concepts. Neural Network World, 2003, 13(5): 521–530

    MathSciNet  Google Scholar 

  4. Krajci S. A generalized concept lattice. Logic Journal of IGPL, 2005, 13(5): 543–550

    Article  MathSciNet  MATH  Google Scholar 

  5. Krajci S. The basic theorem on generalized concept lattice. In: Proceedings of the CLA 2004 International Workshop on Concept Lattices and their Applications. 2004, 25–33

    Google Scholar 

  6. Krajci S. A categorical view at generalized concept lattices. Kybernetika 2007, 43(2): 255–264

    MathSciNet  MATH  Google Scholar 

  7. Medina J, Ojeda-Aciego M, Ruiz-Calviño J. Formal concept analysis via multi-adjoint concept lattices. Fuzzy Sets and Systems, 2009, 160: 130–144

    Article  MathSciNet  MATH  Google Scholar 

  8. Medina J, Ojeda-Aciego M. Multi-adjoint t-concept lattices. Information Sciences, 2012, 180(5): 712–725

    Article  MathSciNet  MATH  Google Scholar 

  9. Medina J, Ojeda-Aciego M. On multi-adjoint concept lattices based on heterogeneous conjunctors. Fuzzy Sets and Systems, 2012, 208: 95–110

    Article  MathSciNet  MATH  Google Scholar 

  10. Belohlávek R. What is a fuzzy concept lattice? Lecture Notes in Artificial Intelligence, 2011, 6743: 19–26

    Google Scholar 

  11. Belohlávek R, Vychodil V. Formal concept analysis and linguistic hedges. International Journal of General Systems, 2012, 41(5): 503–532

    Article  MathSciNet  MATH  Google Scholar 

  12. Ben Yahia S, Jaoua A. Discovering knowledge from fuzzy concept lattice. In: A. Kandel, M. Last, and H. Bunke, eds. Data Mining and Computational Intelligence, Physica-Verlag, 2001, 167–190

    Chapter  Google Scholar 

  13. Butka P. Use of FCA in the ontology extraction step for the improvement of the semantic information retrieval. In: Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, Prague. 2006, 74–82

    Google Scholar 

  14. Butka P, Sarnovsky M, Bednar P. One approach to combination of FCA-based local conceptual models for text analysis grid-based approach. In: Proceedings of the 6th International Conference SAMI. 2008, 131–135

    Google Scholar 

  15. Jaoua A, Elloumi S. Galois connection, formal concepts and galois lattice in real relations: application in a real classifier. The Journal of Systems and Software, 2002, 60: 149–163

    Article  Google Scholar 

  16. Kang X, Li D, Wang S, Qu K. Formal concept analysis based on fuzzy granularity base for different granulations. Fuzzy Sets and Systems, 2012, 203: 33–48

    Article  MathSciNet  MATH  Google Scholar 

  17. Kang X, Li D, Wang S, Qu K. Rough set model based on formal concept analysis. Information Sciences, 2013, 222: 611–625

    Article  MathSciNet  MATH  Google Scholar 

  18. Li Q, Guo L. Formal query systems on contexts and a representation of algebraic lattices. Information Sciences, 2013, 239: 72–84

    Article  MathSciNet  Google Scholar 

  19. Sarnovský M, Butka P, Paralic J. Grid-based support for different text mining tasks. Acta Polytechnica Hungarica, 2009, 6(4): 5–27

    Google Scholar 

  20. Sarnovský M, Butka P. Cloud computing as a platform for distributed data analysis. In: Proceedings of the 7th Workshop on Intelligent and Knowledge Oriented Technologies. 2012, 177–180

    Google Scholar 

  21. Singh P K, Kumar C A. A method for reduction of fuzzy relation in fuzzy formal context. Mathematical Modelling and Scientific Computation, Communications in Computer and Information Science, 2012, 283: 343–350

    Article  Google Scholar 

  22. Singh P K, Kumar C A. A method for decomposition of fuzzy formal context. Procedia Engineering, 2012, 38: 1852–1857

    Article  Google Scholar 

  23. Singh P K, Kumar C A. Interval-valued fuzzy graph representation of concept lattices. In: Proceedings of the 12th International Conference on Intelligent Systems Design and Applications. 2012, 604–609

    Google Scholar 

  24. Song X, Wang X, Zhang W. Axiomatic approaches of fuzzy concept operators. In: Proceedings of the 2012 International Conference on Machine Learning and Cybernetics. 2012, 249–254

    Chapter  Google Scholar 

  25. Pócs J. Note on generating fuzzy concept lattices via galois connections. Information Sciences, 2012, 185(1): 128–136

    Article  MathSciNet  Google Scholar 

  26. Pócs J. On possible generalization of fuzzy concept lattices using dually isomorphic retracts. Information Sciences, 2012, 210: 89–98

    Article  MathSciNet  MATH  Google Scholar 

  27. Antoni L, Krajci S, Krídlo O, Macek B, Pisková L. Relationship between two FCA approaches on heterogeneous formal contexts. In: Proceedings of the 9th International Conference on Concept Lattices and Their Applications. 2012, 93–102

    Google Scholar 

  28. Antoni L, Krajci S, Krídlo O, Macek B, Pisková L. On heterogeneous formal contexts. Fuzzy Sets and Systems, 2014, 234: 72–84

    Article  Google Scholar 

  29. Ganter B, Wille R. Formal Concept Analysis. Berlin: Mathematical Foundations. Springer, 1999

    Book  Google Scholar 

  30. Nourine L, Raynaud O. A fast incremental algorithm for building lattices. Journal of Experimental and Theoretical Artificial Intelligence, 2002, 14: 217–227

    Article  MATH  Google Scholar 

  31. Butka P, Pócs J. Generalization of one-sided concept lattices. Computing and Informatics, 2013, 32(2): 355–370

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jozef Pócs.

Additional information

Jozef Pócs received his PhD in 2008 at the Mathematical Institute of Slovak Academy of Sciences, Slovakia. Since 2007 he has been working as research fellow at the Mathematical Institute of Slovak Academy of Sciences in, Slovakia. Currently he also works as postdoctoral research fellow at Palacký University Olomouc. His research interests include abstract algebra and application of algebraic methods to information sciences.

Jana Pócsová received her PhD in 2009 from Pavol Jozef Šafárik University in, Slovakia. Since 2009 she has been working as assistant professor at BERG Faculty of Technical University in, Slovakia. Her research interests include data mining, formal concept analysis, and teaching mathematics.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pócs, J., Pócsová, J. Basic theorem as representation of heterogeneous concept lattices. Front. Comput. Sci. 9, 636–642 (2015). https://doi.org/10.1007/s11704-015-3162-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-015-3162-x

Keywords

Navigation