Parallel algorithm for computing fixpoints of Galois connections
From MaRDI portal
Publication:2430355
DOI10.1007/s10472-010-9199-5zbMath1213.68604OpenAlexW2067873823MaRDI QIDQ2430355
Petr Krajča, Vilem Vychodil, Jan Outrata
Publication date: 6 April 2011
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-010-9199-5
Knowledge representation (68T30) Parallel algorithms in computer science (68W10) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (10)
Systematic categorization and evaluation of CbO-based algorithms in FCA ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Three-way concept learning based on cognitive operators: an information fusion viewpoint ⋮ A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections ⋮ On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices ⋮ Parallel algorithms for enumerating closed patterns from multi-relational data ⋮ A lattice-free concept lattice update algorithm ⋮ A reduction theorem to compute fixpoints of fuzzy closure operators ⋮ On pruning techniques in map-reduce style CbO algorithms ⋮ Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- On generating all maximal independent sets
- The analytic order of Ш for modular elliptic curves
- A local approach to concept generation
- Two Basic Algorithms in Concept Analysis
- Comparing performance of algorithms for generating concept lattices
- Formal Concept Analysis
- Concept Lattices
This page was built for publication: Parallel algorithm for computing fixpoints of Galois connections
