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 grades

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F08%3A00005383" target="_blank" >RIV/61989592:15310/08:00005383 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Optimal decompositions of matrices with grades

  • Original language description

    We present theoretical results regarding decomposition of matrices with grades, i.e. matrices I with entries from a bounded ordered set L such as the real unit interval [0, 1]. If I is such an n xm matrix, we look for a decomposition of I into a productAB of an nxk matrix A and a kxmmatrix B with entries from L with k as small as possible. This problem generalizes the decomposition problem of Boolean factor analysis which is a particular case when L has just two elements 0 and 1. The product we consider is a supt-norm product of which the well known max-min product of Boolean matrices as well as max-min and max-? product of matrices with entries from [0, 1] are particular examples. I, A, and B can be interpreted as object x attribute, object x factor,and factor x attribute matrices describing degrees of expression of attributes on objects, factors on objects, and attributes on factors. In this interpretation, a decomposition I into A B corresponds to discovery of k factors explaining

  • Czech name

    Optimální dekompozice matic se stupni

  • Czech description

    Článek se zabývá problematikou optimalních dekompozic matic se stupni.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BD - Information theory

  • OECD FORD branch

Result continuities

  • Project

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

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2008

  • 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

  • Article name in the collection

    2008 Fourth International IEEE Conference on Intelligent Systems

  • ISBN

    978-1-4244-1740-7

  • ISSN

  • e-ISSN

  • Number of pages

    1000

  • Pages from-to

  • Publisher name

    Varna, Bulgaria

  • Place of publication

    Varna, Bulgaria

  • Event location

  • Event date

  • Type of event by nationality

  • UT code for WoS article