Not logged in : Login

About: Low-rank approximation     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : dbpedia-owl:Disease, within Data Space : ods-qa.openlinksw.com:8896 associated with source document(s)

In mathematics, low-rank approximation is a minimization problem, in which the cost function measures the fit between a given matrix (the data) and an approximating matrix (the optimization variable), subject to a constraint that the approximating matrix has reduced rank. The problem is used for mathematical modeling and data compression. The rank constraint is related to a constraint on the complexity of a model that fits the data. In applications, often there are other constraints on the approximating matrix apart from the rank constraint, e.g., non-negativity and Hankel structure.

AttributesValues
type
sameAs
wasDerivedFrom
dbpedia-owl:abstract
  • In mathematics, low-rank approximation is a minimization problem, in which the cost function measures the fit between a given matrix (the data) and an approximating matrix (the optimization variable), subject to a constraint that the approximating matrix has reduced rank. The problem is used for mathematical modeling and data compression. The rank constraint is related to a constraint on the complexity of a model that fits the data. In applications, often there are other constraints on the approximating matrix apart from the rank constraint, e.g., non-negativity and Hankel structure. Low-rank approximation is closely related to: * principal component analysis, * factor analysis, * total least squares, * latent semantic analysis * orthogonal regression, and * dynamic mode decomposition.
dbpedia-owl:wikiPageExternalLink
dbpedia-owl:wikiPageID
dbpedia-owl:wikiPageRevisionID
comment
  • In mathematics, low-rank approximation is a minimization problem, in which the cost function measures the fit between a given matrix (the data) and an approximating matrix (the optimization variable), subject to a constraint that the approximating matrix has reduced rank. The problem is used for mathematical modeling and data compression. The rank constraint is related to a constraint on the complexity of a model that fits the data. In applications, often there are other constraints on the approximating matrix apart from the rank constraint, e.g., non-negativity and Hankel structure.
label
  • Aproximação de posto baixo
  • Low-rank approximation
dbpprop:wikiPageUsesTemplate
described by
topic
http://purl.org/li...ics/gold/hypernym
Subject
is primary topic of
dbpedia-owl:wikiPageLength
dbpedia-owl:wikiPageWikiLink
is sameAs of
is topic of
is dbpedia-owl:wikiPageRedirects of
is primary topic of
is dbpedia-owl:wikiPageWikiLink of
Faceted Search & Find service v1.17_git55 as of Mar 01 2021


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3322 as of Mar 14 2022, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (7 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software