On pruning techniques in map-reduce style CbO algorithms

DOI10.1007/s10472-022-09787-1OpenAlexW4210581435MaRDI QIDQ2107482

Petr Krajča, Jan Konecny

Publication date: 1 December 2022

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-022-09787-1

zbMATH Keywords

distributed computingformal concept analysisclosed setsclose-by-onemap-reduce model

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Knowledge representation (68T30) Distributed algorithms (68W15)

Uses Software

• MapReduce
• Twister

Cites Work

• Unnamed Item
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• 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
• Making use of empty intersections to improve the performance of CbO-type algorithms
• Parallel algorithm for computing fixpoints of Galois connections
• Distributed Formal Concept Analysis Algorithms Based on an Iterative MapReduce Framework

This page was built for publication: On pruning techniques in map-reduce style CbO algorithms