On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73588203" target="_blank" >RIV/61989592:15310/18:73588203 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0020025518306091" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0020025518306091</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ins.2018.08.004" target="_blank" >10.1016/j.ins.2018.08.004</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient

Popis výsledku v původním jazyce

In recent years, discernibility matrix based methods of attribute reduction in concept lattices (DM-methods) enjoyed an increase in attention and were applied in many extensions of formal concept analysis. In our previous paper, we pointed out that there exists an older method (CR-method) with theoretically lesser time complexity and we proposed a wrapping procedure to use the CR-method in any extension where the DM-methods are used. Now we evaluate the methods experimentally. Results of the evaluation assert our previous theoretical findings that the CR-method is strictly superior as it outperforms the DM-methods by several order of magnitude. To emphasize the poor performance of the DM-methods we introduce a new naive and deliberately slow algorithm called SIMPEL. Subsequently, we show that even its performance is not so bad in comparison with the DM-methods. Our conclusions are that it is inefficient to use the DM-methods for attribute reduction in concept lattices and that the CR-method should be used instead in practice.

Název v anglickém jazyce

On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient

Popis výsledku anglicky

In recent years, discernibility matrix based methods of attribute reduction in concept lattices (DM-methods) enjoyed an increase in attention and were applied in many extensions of formal concept analysis. In our previous paper, we pointed out that there exists an older method (CR-method) with theoretically lesser time complexity and we proposed a wrapping procedure to use the CR-method in any extension where the DM-methods are used. Now we evaluate the methods experimentally. Results of the evaluation assert our previous theoretical findings that the CR-method is strictly superior as it outperforms the DM-methods by several order of magnitude. To emphasize the poor performance of the DM-methods we introduce a new naive and deliberately slow algorithm called SIMPEL. Subsequently, we show that even its performance is not so bad in comparison with the DM-methods. Our conclusions are that it is inefficient to use the DM-methods for attribute reduction in concept lattices and that the CR-method should be used instead in practice.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

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 periodika

INFORMATION SCIENCES

ISSN

0020-0255

e-ISSN

—

Svazek periodika

467

Číslo periodika v rámci svazku

OCT

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

15

Strana od-do

431-445

Kód UT WoS článku

000446291700028

EID výsledku v databázi Scopus

2-s2.0-85051646510