| http://dbpedia.org/ontology/abstract
|
In mathematics, low-rank approximation is … 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.ession, and
* dynamic mode decomposition.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://github.com/slra/slra +
|
| http://dbpedia.org/ontology/wikiPageID
|
34327576
|
| http://dbpedia.org/ontology/wikiPageLength
|
22457
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1122057143
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Machine_learning +
, http://dbpedia.org/resource/Biconvex_optimization +
, http://dbpedia.org/resource/LTI_system_theory +
, http://dbpedia.org/resource/Mathematical_optimization +
, http://dbpedia.org/resource/Vectorization_%28mathematics%29 +
, http://dbpedia.org/resource/Total_least_squares +
, http://dbpedia.org/resource/Spectral_norm +
, http://dbpedia.org/resource/CUR_matrix_approximation +
, http://dbpedia.org/resource/Linear_least_squares_%28mathematics%29 +
, http://dbpedia.org/resource/Categorical_data +
, http://dbpedia.org/resource/Handwriting_recognition +
, http://dbpedia.org/resource/Least_squares +
, http://dbpedia.org/resource/Kalman_filter +
, http://dbpedia.org/resource/Rank_%28linear_algebra%29 +
, http://dbpedia.org/resource/Frobenius_norm +
, http://dbpedia.org/resource/Erhard_Schmidt +
, http://dbpedia.org/resource/Principal_component_analysis +
, http://dbpedia.org/resource/Recommender_system +
, http://dbpedia.org/resource/Sylvester_matrix +
, http://dbpedia.org/resource/Matlab +
, http://dbpedia.org/resource/Mathematical_model +
, http://dbpedia.org/resource/Category:Dimension_reduction +
, http://dbpedia.org/resource/System_identification +
, http://dbpedia.org/resource/Dynamic_mode_decomposition +
, http://dbpedia.org/resource/Singular_value_decomposition +
, http://dbpedia.org/resource/Latent_semantic_analysis +
, http://dbpedia.org/resource/Levenberg-Marquardt_algorithm +
, http://dbpedia.org/resource/Orthogonal_regression +
, http://dbpedia.org/resource/Computer_algebra +
, http://dbpedia.org/resource/Natural_language_processing +
, http://dbpedia.org/resource/Norm_%28mathematics%29 +
, http://dbpedia.org/resource/Diagonal_matrix +
, http://dbpedia.org/resource/Nonnegative_matrix +
, http://dbpedia.org/resource/Loss_function +
, http://dbpedia.org/resource/Nonnegative_matrix_factorization +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
, http://dbpedia.org/resource/Hankel_matrix +
, http://dbpedia.org/resource/Missing_values +
, http://dbpedia.org/resource/Identity_matrix +
, http://dbpedia.org/resource/Category:Numerical_linear_algebra +
, http://dbpedia.org/resource/Orthogonal_matrix +
, http://dbpedia.org/resource/Data_compression +
, http://dbpedia.org/resource/Matrix_completion +
, http://dbpedia.org/resource/Factor_analysis +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Doi +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Dimension_reduction +
, http://dbpedia.org/resource/Category:Numerical_linear_algebra +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Problem +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Low-rank_approximation?oldid=1122057143&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Low-rank_approximation +
|
| owl:sameAs |
http://pt.dbpedia.org/resource/Aproxima%C3%A7%C3%A3o_de_posto_baixo +
, http://rdf.freebase.com/ns/m.0hzs2zv +
, http://www.wikidata.org/entity/Q6692777 +
, http://dbpedia.org/resource/Low-rank_approximation +
, https://global.dbpedia.org/id/4qcjX +
|
| rdf:type |
http://dbpedia.org/ontology/Disease +
|
| rdfs:comment |
In mathematics, low-rank approximation is … 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.e.g., non-negativity and Hankel structure.
|
| rdfs:label |
Low-rank approximation
, Aproximação de posto baixo
|
