NextClosures: Parallel Computation of the Canonical Base: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Markus Krötzsch (Diskussion | Beiträge) (new time) |
Markus Krötzsch (Diskussion | Beiträge) K (Textersetzung - „Knowledge Systems“ durch „Wissensbasierte Systeme“) |
||
| Zeile 11: | Zeile 11: | ||
|Vortragender=Francesco Kriegel | |Vortragender=Francesco Kriegel | ||
|PDF=KrBo-CLA15.pdf | |PDF=KrBo-CLA15.pdf | ||
|Forschungsgruppe=Automatentheorie, | |Forschungsgruppe=Automatentheorie, Wissensbasierte Systeme, Wissensverarbeitung | ||
|In News anzeigen=1 | |In News anzeigen=1 | ||
}} | }} | ||
Version vom 24. Mai 2016, 18:32 Uhr
NextClosures: Parallel Computation of the Canonical Base
Vortrag von Francesco Kriegel
- Veranstaltungsort: APB 3105
- Beginn: 5. Oktober 2015 um 15:00
- Ende: 5. Oktober 2015 um 16:00
- Forschungsgruppe: Automatentheorie
- Forschungsgruppe: Wissensbasierte Systeme
- Forschungsgruppe: Wissensverarbeitung
- iCal
The canonical base of a formal context plays a distinguished role in formal concept analysis. This is because it is the only minimal base so far that can be described explicitly. For the computation of this base several algorithms have been proposed. However, all those algorithms work sequentially, by computing only one pseudo-intent at a time - a fact which heavily impairs the practicability of using the canonical base in real-world applications. In this paper we shall introduce an approach that remedies this deficit by allowing the canonical base to be computed in a parallel manner. First experimental evaluations show that for sufficiently large data-sets the speedup is proportional to the number of available CPUs.
