Factorizing three-way binary data with triadic formal concepts

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F10%3A10216449" target="_blank" >RIV/61989592:15310/10:10216449 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Factorizing three-way binary data with triadic formal concepts

Popis výsledku v původním jazyce

We present a problem of factor analysis of three-way binary data. Such data is described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, and conditions. The aim is to decompose I into three binary matrices, an object-factor matrix A, an attribute-factor matrix B, and a condition-factor matrix C, with a small number of factors. The difference from the various decompositionbased methods of analysis of three-way data consists in the composition operator and the constraint on A, B, and C to be binary. We present a theoretical analysis of the decompositions and show that optimal factors for such decompositions are provided by triadic concepts developed in formal concept analysis. Moreover, we present an illustrative example, propose a greedy algorithm for computing the decompositions. EN KLICOVA SLOVA: factor analysis, binary data, three-way data CZ TITUL: Faktorizace tri-cestnych dat pomoci triadickych formalnich konceptu.

Název v anglickém jazyce

Factorizing three-way binary data with triadic formal concepts

Popis výsledku anglicky

We present a problem of factor analysis of three-way binary data. Such data is described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, and conditions. The aim is to decompose I into three binary matrices, an object-factor matrix A, an attribute-factor matrix B, and a condition-factor matrix C, with a small number of factors. The difference from the various decompositionbased methods of analysis of three-way data consists in the composition operator and the constraint on A, B, and C to be binary. We present a theoretical analysis of the decompositions and show that optimal factors for such decompositions are provided by triadic concepts developed in formal concept analysis. Moreover, we present an illustrative example, propose a greedy algorithm for computing the decompositions. EN KLICOVA SLOVA: factor analysis, binary data, three-way data CZ TITUL: Faktorizace tri-cestnych dat pomoci triadickych formalnich konceptu.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F10%2F0262" target="_blank" >GAP202/10/0262: Rozklady matic s binárními a ordinálními daty: teorie, algoritmy, složitost</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

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 periodika

Lecture Notes in Artificial Intelligence

ISSN

0302-9743

e-ISSN

—

Svazek periodika

6276

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

10

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—