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”

Optimal decompositions of matrices with entries from residuated lattices

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F12%3A33147464" target="_blank" >RIV/61989592:15310/12:33147464 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1093/logcom/exr023" target="_blank" >http://dx.doi.org/10.1093/logcom/exr023</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1093/logcom/exr023" target="_blank" >10.1093/logcom/exr023</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Optimal decompositions of matrices with entries from residuated lattices

  • Original language description

    We describe optimal decompositions of matrices whose entries are elements of a residuated lattice L, such as L=[0, 1]. Such matrices represent relationships between objects and attributes with the entries representing degrees to which attributes represented by columns apply to objects represented by rows. Given such an n x m object-attribute matrix I, we look for a decomposition of I into a product A * B of an n x k object-factor matrix A and a k x m factor-attribute matrix B with entries from L with the number k of factors as small as possible. We show that formal concepts of I, which play a central role in the Port-Royal approach to logic and which are the fixpoints of particular Galois connections associated to I, are optimal factors for decomposition of I in that they provide us with decompositions with the smallest number of factors. Moreover, we describe transformations between the space of original attributes and the space of factors induced by a decomposition I = A * B. The art

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F10%2F0262" target="_blank" >GAP202/10/0262: Decompositions of matrices with binary and ordinal data: theory, algorithms, and complexity</a><br>

  • Continuities

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

Others

  • Publication year

    2012

  • 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

    Journal of Logic and Computation Advance Access

  • ISSN

    0955-792X

  • e-ISSN

  • Volume of the periodical

    22

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    21

  • Pages from-to

    1405-1425

  • UT code for WoS article

    000311670000007

  • EID of the result in the Scopus database