Rearrangement of Fuzzy Formal Contexts for Reducing Cost of Algorithms

1. Andrews, S.: In-Close, a fast algorithm for computing formal concepts. In: Proceedings of the International Conference on Conceptual Structures, Moscow (2009)

   Google Scholar 

2. Andrews, S.: Making use of empty intersections to improve the performance of CbO-type algorithms. In: Bertet, K., Borchmann, D., Cellier, P., Ferre, S. (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10308. LNAI, pp. 56–71. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59271-8_4

3. Andrews, S.: A new method for inheriting canonicity test failures in close-by-one type algorithms. In: Ignatov, D.I., Nourine, L. (eds.) Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, CLA 2018, Olomouc, Czech Republic, 12–14 June 2018. CEUR Workshop Proceedings, vol. 2123, pp. 255–266. CEUR-WS.org (2018). https://ceur-ws.org/Vol-2123/paper21.pdf

4. Aragón, R.G., Medina, J., Ramírez-Poussa, E.: Factorizing formal contexts from closures of necessity operators. Comput. Appl. Math. 43, 1–32 (2024). https://doi.org/10.1016/j.ins.2022.05.047

5. Bělohávek, R., De Baets, B., Outrata, J., Vychodil, V.: Computing the lattice of all fixpoints of a fuzzy closure operator. IEEE Trans. Fuzzy Syst. 18(3), 546–557 (2010). https://doi.org/10.1109/TFUZZ.2010.2041006

   Article  Google Scholar 

6. Bělohlávek, R.: Fuzzy Relational Systems. Springer, Cham (2002). https://doi.org/10.1007/978-1-4615-0633-1

7. Bělohlávek, R.: Algorithms for fuzzy concept lattices. In: International Conference on Recent Advances in Soft Computing, pp. 200–205 (2002)

   Google Scholar 

8. Bělohlávek, R., Konečny, J.: Fixpoints of fuzzy closure operators via ordinary algorithms. In: 2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1–6 (2017). https://doi.org/10.1109/FUZZ-IEEE.2017.8015676

9. Burusco-Juandeaburre, A., Fuentes-González, R.: The study of the L-fuzzy concept lattice. Mathware Soft Comput. 1(3), 209–218 (1994)

   MathSciNet  Google Scholar 

10. Cordero, P., Enciso, M., López Rodríguez, D., Mora, Á.: fcaR, formal concept analysis with R. R J. 14, 341–361 (2022)

    Article  Google Scholar 

11. Ganter, B.: Two basic algorithms in concept analysis. In: Kwuida, L., Sertkaya, B. (eds.) Formal Concept Analysis: 8th International Conference, ICFCA 2010, Agadir, Morocco, 15–18 March 2010, Proceedings 8, pp. 312–340. Springer, Cham (2010). https://doi.org/10.1007/978-3-642-11928-6_22

12. Guigues, J.L., Duquenne, V.: Familles minimales d’implications informatives résultant d’un tableau de données binaires. Mathématiques et Sciences humaines 95, 5–18 (1986)

    Google Scholar 

13. Hanika, T., Hirth, J.: Conexp-Clj - a research tool for FCA. ICFCA (Suppl.) 2378, 70–75 (2019)

    Google Scholar 

14. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119–123 (1988). https://doi.org/10.1016/0020-0190(88)90065-8

15. Krajča, P., Outrata, J., Vychodil, V.: Advances in algorithms based on CbO. In: CLA, vol. 672, pp. 325–337. Citeseer (2010)

    Google Scholar 

16. Kuznetsov, S.: A fast algorithm for computing all intersections of objects in a finite semi-lattice. Autom. Documentation Math. Linguist. 27, 11–21 (1993)

    Google Scholar 

17. Kuznetsov, S.O.: Interpretation on graphs and complexity characteristics of a search for specific patterns. Autom. Documentation Math. Linguist. 24(1), 37–45 (1989)

    Google Scholar 

18. Kuznetsov, S.O.: A fast algorithm for computing all intersections of objects from an arbitrary semilattice. Nauchno-Tekhnicheskaya Informatsiya Seriya 2-Informatsionnye Protsessy i Sistemy (1), 17–20 (1993)

    Google Scholar 

19. Pattison, T., Nataraja, A.: Doubly-lexical order supports standardisation and recursive partitioning of formal context. In: Dürrschnabel, D., López Rodríguez, D. (eds.) International Conference on Formal Concept Analysis, pp. 17–32. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-35949-1_2

20. R Core Team: R: A Language and Environment for Statistical Computing (2019). https://www.r-project.org/

21. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Springer, Cham (1982). https://doi.org/10.1007/978-94-009-7798-3_15

    Chapter  Google Scholar 

22. Yao, W., Lu, L.X.: Fuzzy Galois connections on fuzzy posets. Math. Log. Q. 55, 105–112 (2009)

    Article  MathSciNet  Google Scholar 

Download references