Operators and spaces associated to matrices with grades and their decompositions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F08%3A00005463" target="_blank" >RIV/61989592:15310/08:00005463 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Operators and spaces associated to matrices with grades and their decompositions
Original language description
We present results on decompositions of matrices with grades, i.e. matrices I with entries from a bounded ordered set L such as the real unit interval [0, 1]. We consider decompositions of an n x m matrix I into a circular and triangular product A B of an n x k matrix A and a k x m matrix B with k as small as possible. This problem generalizes the decomposition problem of Boolean factor analysis in which a decomposition of a binary matrix is sought into two binary matrices and which is a particular caseof our setting when L has just two elements, namely 0 and 1. In our previous work, we proved that formal concepts of concept lattices associated to I are optimal factors for such decompositions. In this paper, we investigate concept-forming operators and concept lattices associated to decompositions of matrices and implications of these results.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1ET101370417" target="_blank" >1ET101370417: Hierarchical analysis of complex data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
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
Proceedings of The North American Fuzzy Information Processing Society
ISBN
978-1-4244-2351-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
1-6
Publisher name
IEEE Computer Society Press
Place of publication
New York
Event location
Washinton
Event date
May 19, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—