Parallel Recursive Algorithm for FCA
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F08%3A00005456" target="_blank" >RIV/61989592:15310/08:00005456 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Parallel Recursive Algorithm for FCA
Original language description
This paper presents a parallel algorithm for computing formal concepts. Presented is a sequential version upon which we build the parallel one. We describe the algorithm, its implementation, scalability, and provide an initial experimental evaluation ofits efficiency. The algorithm is fast, memory efficient, and can be optimized so that all critical operations are reduced to low-level bit-array operations. One of the key features of the algorithm is that it avoids synchronization which has positive impacts on its speed and implementation.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET101370417" target="_blank" >1ET101370417: Hierarchical analysis of complex data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Concept Lattices and Their Applications 2008
ISBN
978-80-244-2111-7
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
71-82
Publisher name
Univerzita Palackého
Place of publication
Olomouc
Event location
Olomouc
Event date
Oct 21, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—