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”

Factorization of Matrices With Grades With Overcovering

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F24%3A73627222" target="_blank" >RIV/61989592:15310/24:73627222 - isvavai.cz</a>

  • Result on the web

    <a href="https://obd.upol.cz/id_publ/333207109" target="_blank" >https://obd.upol.cz/id_publ/333207109</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TFUZZ.2023.3330760" target="_blank" >10.1109/TFUZZ.2023.3330760</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Factorization of Matrices With Grades With Overcovering

  • Original language description

    We present a novel algorithm for factorization of matrices with grades or, equivalently, for decomposition of fuzzy relations. The algorithm is inspired by a recent factorization method for Boolean matrices and develops two ideas in the setting of ordinal attributes. First, it uses formal concepts associated with the factorized matrix, or fuzzy relation, as essential components around which factors are built. Second, it steps back when computing new factors to check whether some computed factors may be eliminated or improved given the subsequently generated factors. The new algorithm thus uses convenient properties of formal concepts utilized by previous factorization algorithms. Still, unlike the previous algorithms, our algorithm allows for more general and therefore more precise factorizations due to a possible overcovering of the input data, which our new algorithm admits. We provide an experimental evaluation of the new algorithm and compare it to some existing algorithms for factorization of data with grades. The evaluation reveals that our new algorithm outperforms the current algorithms in terms of quality of factorization. We also present observations and improvements for factorization of Boolean matrices. We conclude with a discussion regarding open research topics.

  • 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

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2024

  • 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

    IEEE TRANSACTIONS ON FUZZY SYSTEMS

  • ISSN

    1063-6706

  • e-ISSN

    1941-0034

  • Volume of the periodical

    32

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    1641-1652

  • UT code for WoS article

    001196731700051

  • EID of the result in the Scopus database

    2-s2.0-85177037889