Abstract
The fixpoints of Galois connections induced by binary relational data are called formal concepts in formal concept analysis (FCA). Computing formal concepts is one of the most important issues in FCA, while Close-by-One (CbO) and its variants are usually considered as the most efficient serial algorithms for this task. Current approaches to parallelization of CbO-type algorithms such as PCbO (Parallel CbO) usually enter the parallel stage after a serial stage which could be a possible bottleneck. In this paper, we propose a new parallel algorithm for computing formal concepts, which is composed of two parallel phases. The new algorithm parallelizes both the computations of the top L recursion levels and the workload distribution, which decouples worker threads from the main thread. We describe the algorithm and present an experimental evaluation of its performance and comparison with PCbO on various datasets. Results indicate that our algorithm performs better, especially when a dataset is dense or has a large size.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
