Abstract
The canonical base of a formal context is a minimal set of implications that is sound and complete. A recent paper has provided a new algorithm for the parallel computation of canonical bases. An important extension is the integration of expert interaction for Attribute Exploration in order to explore implicational bases of inaccessible formal contexts. This paper presents and analyzes an algorithm that allows for Parallel Attribute Exploration.
Author supplied keywords
Cite
CITATION STYLE
Kriegel, F. (2016). Parallel attribute exploration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9717, pp. 91–106). Springer Verlag. https://doi.org/10.1007/978-3-319-40985-6_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
