Parallel algorithm for computing fixpoints of Galois connections

DOI10.1007/S10472-010-9199-5MaRDI QIDQ2430355zbMATH OpenOpenAlexFDO

Authors Petr Krajca, Jan Outrata, Vilem Vychodil

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

zbMATH Keywords

parallel algorithmGalois connectionformal conceptfixpoint

Mathematics Subject Classification ID

Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Parallel algorithms in computer science (68W10)

Recommendations

• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
• Parallel algorithm for construction of concept lattice
• Parallel attribute exploration
• Parallelizing the closure computation in automated deduction

Cites work

• scientific article; zbMATH DE number 3771669 (Why is no real title available?)
• scientific article; zbMATH DE number 33703 (Why is no real title available?)
• scientific article; zbMATH DE number 3604894 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 2168560 (Why is no real title available?)
• scientific article; zbMATH DE number 5488086 (Why is no real title available?)
• A local approach to concept generation
• Comparing performance of algorithms for generating concept lattices
• Concept Lattices
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Formal Concept Analysis
• On generating all maximal independent sets
• The analytic order of Ш for modular elliptic curves
• Two basic algorithms in concept analysis

Cited in

(10)

• Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
• On pruning techniques in map-reduce style CbO algorithms
• A lattice-free concept lattice update algorithm
• A reduction theorem to compute fixpoints of fuzzy closure operators
• Systematic categorization and evaluation of CbO-based algorithms in FCA
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices
• Parallel algorithms for enumerating closed patterns from multi-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

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Parallel algorithm for computing fixpoints of Galois connections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430355)