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: The polynomial time discernibility matrix-based method becomes the CR-method

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F19%3A73595316" target="_blank" >RIV/61989592:15310/19:73595316 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method

  • Original language description

    We eliminate unnecessary computations of attribute discernibility sets in discernibility matrix-based methods (DM-methods) of attribute reduction in concept lattices. We obtain a polynomial time algorithm we call a Skim DM-method. The Skim DM-method however is merely slightly different from the standard clarification and reduction (CR-method). This result enables us to express a relationship of the CR-method and the DM-methods: the DM-methods are basically the CR-method with up to an exponential amount of unnecessary computations. Additionally, we experimentally evaluate the Skim DM-method in comparison with the CR-method.

  • 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

    <a href="/en/project/EE2.3.20.0059" target="_blank" >EE2.3.20.0059: Reintegration of Czech Scientist and Creation of Top Level Team in Information Sciences</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2019

  • 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

    491

  • Issue of the periodical within the volume

    JUL

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    15

  • Pages from-to

    48-62

  • UT code for WoS article

    000468717100004

  • EID of the result in the Scopus database

    2-s2.0-85063912930