Optimální dekompozice matic se stupni

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Optimal decompositions of matrices with grades

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Optimal decompositions of matrices with grades

Popis výsledku anglicky

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

Druh

D - Stať ve sborníku

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

2008 Fourth International IEEE Conference on Intelligent Systems

ISBN

978-1-4244-1740-7

ISSN

—

e-ISSN

—

Počet stran výsledku

1000

Strana od-do

—

Název nakladatele

Varna, Bulgaria

Místo vydání

Varna, Bulgaria

Místo konání akce

—

Datum konání akce

—

Typ akce podle státní příslušnosti

—

Kód UT WoS článku

—