On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F17%3A73581139" target="_blank" >RIV/61989592:15310/17:73581139 - isvavai.cz</a>
Výsledek na webu
<a href="http://www.sciencedirect.com/science/article/pii/S0020025516320291" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0020025516320291</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2017.06.013" target="_blank" >10.1016/j.ins.2017.06.013</a>

Jazyk výsledku
angličtina
Název v původním jazyce
On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction
Popis výsledku v původním jazyce
Several recent papers have studied the problem of attribute reduction in concept lattices by using a discernibility matrix in various extensions of formal concept analysis. We recall the clarification and reduction method by Ganter & Wille and show that it is strictly superior to the methods based on discernibility matrix. Consequently, we show how to adapt the clarification and reduction method to the extensions of formal concept analysis considered in the recent papers.
Název v anglickém jazyce
On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction
Popis výsledku anglicky
Several recent papers have studied the problem of attribute reduction in concept lattices by using a discernibility matrix in various extensions of formal concept analysis. We recall the clarification and reduction method by Ganter & Wille and show that it is strictly superior to the methods based on discernibility matrix. Consequently, we show how to adapt the clarification and reduction method to the extensions of formal concept analysis considered in the recent papers.

Druh
J<sub>imp</sub> - Č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
<a href="/cs/project/GA15-17899S" target="_blank" >GA15-17899S: Rozklady matic s booleovskými a ordinálními daty: teorie a algoritmy</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2017
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ů

Podobné výsledky(10)