This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989592%3A15310%2F10%3A10215653%21RIV11-GA0-15310___/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989592%3A15310%2F10%3A10215653%21RIV11-GA0-15310___
rdf:type
n15:Vysledek skos:Concept
dcterms: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.
dcterms:title
Optimal decompositions of matrices with grades into binary and graded matrices Optimal decompositions of matrices with grades into binary and graded matrices
skos:prefLabel
Optimal decompositions of matrices with grades into binary and graded matrices Optimal decompositions of matrices with grades into binary and graded matrices
skos:notation
RIV/61989592:15310/10:10215653!RIV11-GA0-15310___
n3:aktivita
n6:Z n6:P
n3:aktivity
P(GAP202/10/0262), Z(MSM6198959214)
n3:cisloPeriodika
2
n3:dodaniDat
n17:2011
n3:domaciTvurceVysledku
n4:3207250 n4:5733685 n4:9623264
n3:druhVysledku
n14:J
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
277207
n3:idVysledku
RIV/61989592:15310/10:10215653
n3:jazykVysledku
n18:eng
n3:klicovaSlova
Matrix decomposition, Factor analysis, Formal concept analysis
n3:klicoveSlovo
n7:Formal%20concept%20analysis n7:Matrix%20decomposition n7:Factor%20analysis
n3:kodStatuVydavatele
CH - Švýcarská konfederace
n3:kontrolniKodProRIV
[52215229EE5A]
n3:nazevZdroje
Annals of Mathematics and Artificial Intelligence
n3:obor
n13:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n9:GAP202%2F10%2F0262
n3:rokUplatneniVysledku
n17:2010
n3:svazekPeriodika
59
n3:tvurceVysledku
BARTL, Eduard Konečný, Jan BĚLOHLÁVEK, Radim
n3:zamer
n16:MSM6198959214
s:issn
1012-2443
s:numberOfPages
17
n19:organizacniJednotka
15310