About: Optimal decompositions of matrices with grades into binary and graded matrices

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Optimal decompositions of matrices with grades into binary and graded matrices Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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	P Z
http://linked.open...avai/riv/aktivity	P(GAP202/10/0262), Z(MSM6198959214)
http://linked.open...iv/cisloPeriodika	2
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Konečný, Jan Bartl, Eduard Bělohlávek, Radim
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Palackého v Olomouci / Přírodovědecká fakulta
http://linked.open...dnocenehoVysledku	277207
http://linked.open...ai/riv/idVysledku	RIV/61989592:15310/10:10215653
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Matrix decomposition, Factor analysis, Formal concept analysis (en)
http://linked.open.../riv/klicoveSlovo	Formal concept analysis Factor analysis Matrix decomposition
http://linked.open...odStatuVydavatele	CH - Švýcarská konfederace
http://linked.open...ontrolniKodProRIV	[52215229EE5A]
http://linked.open...i/riv/nazevZdroje	Annals of Mathematics and Artificial Intelligence
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Decompositions of matrices with binary and ordinal data: theory, algorithms, and complexity
http://linked.open...UplatneniVysledku	2010
http://linked.open...v/svazekPeriodika	59
http://linked.open...iv/tvurceVysledku	Konečný, Jan BĚLOHLÁVEK, Radim BARTL, Eduard
http://linked.open...n/vavai/riv/zamer	Matematické modely a struktury
issn	1012-2443
number of pages	17 (xsd:int)
http://localhost/t...ganizacniJednotka	15310
is http://linked.open...avai/riv/vysledek of	Optimal decompositions of matrices with grades into binary and graded matrices Optimal decompositions of matrices with grades into binary and graded matrices Optimal decompositions of matrices with grades into binary and graded matrices

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software