Parallel algorithm for computing fixpoints of Galois connections

Annals of Mathematics and Artificial Intelligence

Volumn 59, Issue 2, 2010, Pages 257-272

  Krajca, Petr ^a   Outrata, Jan ^a   Vychodil, Vilem ^a  

^a PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

Fixpoint; Formal concept; Galois connection; Parallel algorithm

Indexed keywords

EID: 79151477530     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-010-9199-5     Document Type: Article

References (19)

1. Asuncion, A., Newman, D: UCI Machine learning repository. School of Information and Computer Sciences, University of California, Irvine (2007).
2. Baklouti, F., Levy G.: A distributed version of the Ganter algorithm for general Galois Lattices. In: Belohlavek, R., Snasel, V. (eds.) Proc. CLA, pp. 207-221 (2005).
3. Belohlavek, R., Vychodil V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Comput. Syst. Sci. 76, 3-20 (2010).
4. Berry, A., Bordat, J.-P., Sigayret, A.: A local approach to concept generation. Ann. Math. Artif. Intell. 49, 117-136 (2007).
5. Carpineto, C., Romano, G.: Concept Data Analysis. Theory and Applications. Wiley, New York (2004).
6. Fu, H., Mephu Nguifo, E.: A Parallel Algorithm to Generate Formal Concepts for Large Data. ICFCA, LNCS 2961, 394-401 (2004).
7. Ganter, B.: Two basic algorithms in concept analysis. (Technical Report FB4-Preprint No. 831). TH Darmstadt (1984).
8. Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Berlin (1999).
9. Grätzer G. et al.: General Lattice Theory, 2nd edn. Birkhäuser, Basel (2003).
10. Hettich, S., Bay, S. D.: The UCI KDD Archive University of California, Irvine, School of Information and Computer Sciences (1999).
11. Johnson, D. S., Yannakakis, M., Papadimitriou, C. H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119-123 (1988).
12. Kengue J. F. D., Valtchev P., Djamégni C. T.: A parallel algorithm for lattice construction. ICFCA, LNCS 3403, 249-264 (2005).
13. Kuznetsov, S.: Interpretation on graphs and complexity characteristics of a search for specific patterns. Autom. Doc. Math. Linguist. 24(1), 37-45 (1989).
14. Kuznetsov, S.: A fast algorithm for computing all intersections of objects in a finite semi-lattice (Slovenian source, in Russian). Automatic Documentation and Mathematical Linguistics, 27(5), 11-21 (1993).
15. Kuznetsov, S.: Learning of simple conceptual graphs from positive and negative examples. PKDD, pp. 384-391 (1999).
16. Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Int. 14, 189-216 (2002).
17. Lindig, C.: Fast concept analysis. Working with Conceptual Structures-Contributions to ICCS 2000, pp. 152-161. Shaker, Aachen (2000).
18. Norris, E. M.: An Algorithm for computing the maximal rectangles in a binary relation. Rev. Roum. Math. Pures. Appl. 23(2), 243-250 (1978).
19. Wille, R.: Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts. Ordered Sets, pp. 445-470, Reidel, Dordrecht (1982).