Usage of singular value decomposition matrix for search latent semantic structures in natural language texts

2015

Closed access Metadata (CSL-JSON)
DOI 10.1109/sice.2015.7285567
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Singular value decomposition is a powerful computational method used to analyze the matrix and which has many applications in various fields. Its essence lies in the expansion of the original matrix as a product of three matrices: two orthogonal and one diagonal. One consequence of this expansion is the possibility of approximating the original matrix, matrix of lower rank, which can significantly compress the information contained in the original matrix. In this work we investigate the impact of this mechanism on the compression frequency matrix "terms-documents" that are based on counting the occurrence of words in natural language texts. A specific example analyzes the physical meaning of such impacts, and provides a new interpretation of the results, useful for analyzing the structure of any real-world objects, for which we can construct a matrix of their states.