Parallel Attribute Exploration
Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
Contributors
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.
Details
| Original language | English |
|---|---|
| Title of host publication | Graph-Based Representation and Reasoning |
| Editors | Ollivier Haemmerlé, Gem Stapleton, Catherine Faron-Zucker |
| Publisher | Springer, Berlin [u. a.] |
| Pages | 91-106 |
| Number of pages | 16 |
| Publication status | Published - 5 Jul 2016 |
| Peer-reviewed | Yes |
Publication series
| Series | Lecture Notes in Computer Science, Volume 9717 |
|---|---|
| ISSN | 0302-9743 |
External IDs
| Scopus | 84977592920 |
|---|---|
| ORCID | /0000-0003-0219-0330/work/153109403 |