Alternate Low-Rank Matrix Approximation in Latent Semantic Analysis
The latent semantic analysis (LSA) is a mathematical/statistical way of discovering hidden concepts between terms and documents or within a document collection (i.e., a large corpus of text). Each document of the corpus and terms are expressed as a vector with elements corresponding to these concept...
Main Authors: | Fahrettin Horasan, Hasan Erbay, Fatih Varçın, Emre Deniz |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2019-01-01
|
Series: | Scientific Programming |
Online Access: | http://dx.doi.org/10.1155/2019/1095643 |
Similar Items
-
Lower bounds for the low-rank matrix approximation
by: Jicheng Li, et al.
Published: (2017-11-01) -
A new method based on the manifold-alternative approximating for low-rank matrix completion
by: Fujiao Ren, et al.
Published: (2018-12-01) -
Faster streaming algorithms for low-rank matrix approximations
by: Galvin, Timothy Matthew
Published: (2014) -
Compressed Sensing, Sparse Approximation, and Low-Rank Matrix Estimation
by: Plan, Yaniv
Published: (2011) -
Budget-Optimal Crowdsourcing Using Low-Rank Matrix Approximations
by: Karger, David R., et al.
Published: (2012)