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.
Attributes | Values |
---|
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 | |