On generating all maximal independent sets
Information Processing Letters
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Learning of Simple Conceptual Graphs from Positive and Negative Examples
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Concept Data Analysis: Theory and Applications
Concept Data Analysis: Theory and Applications
A local approach to concept generation
Annals of Mathematics and Artificial Intelligence
Discovery of optimal factors in binary data via a novel method of matrix decomposition
Journal of Computer and System Sciences
A parallel algorithm for lattice construction
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Information Sciences: an International Journal
Computing Formal Concepts by Attribute Sorting
Fundamenta Informaticae - Concept Lattices and Their Applications
Finding Fuzzy Concepts for Creative Knowledge Discovery
International Journal of Intelligent Systems
| Hi-index | 0.00 |
This paper presents a parallel algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. The algorithm results as a parallelization of CbO (Kuznetsov 1999) in which we process disjoint sets of fixpoints simultaneously. One of the distinctive features of the algorithm compared to other parallel algorithms is that it avoids synchronization which has positive impacts on its speed and implementation. We describe the parallel algorithm, prove its correctness, and analyze its asymptotic complexity. Furthermore, we focus on implementation issues, scalability of the algorithm, and provide an evaluation of its efficiency on various data sets.