On pruning techniques in map-reduce style CbO algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Distributed formal concept analysis algorithms based on an iterative MapReduce framework
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- Making use of empty intersections to improve the performance of CbO-type algorithms
- Parallel algorithm for computing fixpoints of Galois connections
Cited in
(5)- Systematic categorization and evaluation of CbO-based algorithms in FCA
- Pruning in map-reduce style CbO algorithms
- Distributed formal concept analysis algorithms based on an iterative MapReduce framework
- Making use of empty intersections to improve the performance of CbO-type algorithms
- Pruning techniques in lincbo for the computation of the duquenne-guigues basis
This page was built for publication: On pruning techniques in map-reduce style CbO algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107482)