All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • 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)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2018

  • 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

  • Name of the periodical

    INFORMATION SCIENCES

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    467

  • Issue of the periodical within the volume

    OCT

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    15

  • Pages from-to

    431-445

  • UT code for WoS article

    000446291700028

  • EID of the result in the Scopus database

    2-s2.0-85051646510