Attributes | Values |
---|
rdf:type
| |
Description
| - We study the problem of decomposition of object-attribute matrices whose entries contain degrees to which objects have attributes. The degrees are taken from a bounded partially ordered scale. We study the problem of decomposition of a given object-attribute matrix I with degrees into an object-factor matrix A with degrees and a binary factor-attribute matrix B, with the number of factors as small as possible. We present a theorem which shows that decompositions which use particular formal concepts of I as factors are optimal in that the number of factors involved is the smallest possible. We show that the problem of computing an optimal decomposition is NP-hard and present two heuristic algorithms for its solution along with their experimental evaluation. Experiments indicate that he second algorithm, which is considerably faster than the first one, delivers decompositions whose quality is comparable to the decompositions delivered by the first algorithm.
- We study the problem of decomposition of object-attribute matrices whose entries contain degrees to which objects have attributes. The degrees are taken from a bounded partially ordered scale. We study the problem of decomposition of a given object-attribute matrix I with degrees into an object-factor matrix A with degrees and a binary factor-attribute matrix B, with the number of factors as small as possible. We present a theorem which shows that decompositions which use particular formal concepts of I as factors are optimal in that the number of factors involved is the smallest possible. We show that the problem of computing an optimal decomposition is NP-hard and present two heuristic algorithms for its solution along with their experimental evaluation. Experiments indicate that he second algorithm, which is considerably faster than the first one, delivers decompositions whose quality is comparable to the decompositions delivered by the first algorithm. (en)
|
Title
| - Optimal decompositions of matrices with grades into binary and graded matrices
- Optimal decompositions of matrices with grades into binary and graded matrices (en)
|
skos:prefLabel
| - Optimal decompositions of matrices with grades into binary and graded matrices
- Optimal decompositions of matrices with grades into binary and graded matrices (en)
|
skos:notation
| - RIV/61989592:15310/10:10215653!RIV11-GA0-15310___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GAP202/10/0262), Z(MSM6198959214)
|
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/61989592:15310/10:10215653
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Matrix decomposition, Factor analysis, Formal concept analysis (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| - CH - Švýcarská konfederace
|
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - Annals of Mathematics and Artificial Intelligence
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| - Konečný, Jan
- BĚLOHLÁVEK, Radim
- BARTL, Eduard
|
http://linked.open...n/vavai/riv/zamer
| |
issn
| |
number of pages
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |