Improving the Performance of Lindig-Style Algorithms with Empty Intersections

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73607820" target="_blank" >RIV/61989592:15310/21:73607820 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-86982-3_7" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-86982-3_7</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-86982-3_7" target="_blank" >10.1007/978-3-030-86982-3_7</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Improving the Performance of Lindig-Style Algorithms with Empty Intersections

Popis výsledku v původním jazyce

The building of a concept lattice and its line diagram from a set of formal concepts is an important task in formal concept analysis (FCA), since it allows one to express relationships among formal concepts in a concise and comprehensible form. One may enumerate direct neighbors of each formal concept and build a concept lattice or its line diagram in a straightforward way. This is the main idea behind the algorithm proposed by Lindig. This algorithm, as well as other algorithms in FCA, must contend with the fact that some formal concepts are enumerated multiple times. In practice a substantial amount of redundant computations is related to the top (or bottom) formal concept. The In-Close4 algorithm came up with an optimization technique that allows one to eliminate such redundant computations and significantly improves the performance of algorithms from the Close-by-One family. We show that this technique can be used in the Lindig-type algorithms to improve their performance as well.

Název v anglickém jazyce

Improving the Performance of Lindig-Style Algorithms with Empty Intersections

Popis výsledku anglicky

The building of a concept lattice and its line diagram from a set of formal concepts is an important task in formal concept analysis (FCA), since it allows one to express relationships among formal concepts in a concise and comprehensible form. One may enumerate direct neighbors of each formal concept and build a concept lattice or its line diagram in a straightforward way. This is the main idea behind the algorithm proposed by Lindig. This algorithm, as well as other algorithms in FCA, must contend with the fact that some formal concepts are enumerated multiple times. In practice a substantial amount of redundant computations is related to the top (or bottom) formal concept. The In-Close4 algorithm came up with an optimization technique that allows one to eliminate such redundant computations and significantly improves the performance of algorithms from the Close-by-One family. We show that this technique can be used in the Lindig-type algorithms to improve their performance as well.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Graph-Based Representation and Reasoning

ISBN

978-3-030-86981-6

ISSN

0302-9743

e-ISSN

1611-3349

Počet stran výsledku

14

Strana od-do

91-104

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Bolzano

Datum konání akce

20. 9. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000711894700007