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

Result code in 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>
Result on the web
<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>

Result language
angličtina
Original language name
On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA15-17899S" target="_blank" >GA15-17899S: Decompositions of Matrices with Boolean and Ordinal Data: Theory and Algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)