2015 54th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) 2015
DOI: 10.1109/sice.2015.7285567
|View full text |Cite
|
Sign up to set email alerts
|

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

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 mechanis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…The maximum number of topics generated was equal to the number of documents in the corpus. For extracting a few topics (k), the topmost k singular values were taken from the matrix ΣΣt [17, 33]. The procedure to be adopted for rank lowering and SVD is explained with in following example:Text is represented as a matrix of form X = U∑V t such that each row stands for unique word and each column represents unique document.…”
Section: Methodsmentioning
confidence: 99%
“…The maximum number of topics generated was equal to the number of documents in the corpus. For extracting a few topics (k), the topmost k singular values were taken from the matrix ΣΣt [17, 33]. The procedure to be adopted for rank lowering and SVD is explained with in following example:Text is represented as a matrix of form X = U∑V t such that each row stands for unique word and each column represents unique document.…”
Section: Methodsmentioning
confidence: 99%
“…The maximum number of topics generated was equal to the number of documents in the corpus. For extracting a few topics (k), the topmost k singular values were taken from the matrix P P t [27,28]. Text is represented as a matrix of form X = U∑V t such that each row stands for unique word and each column represents unique document.…”
Section: U: Initial Rotation ∑: Scalingmentioning
confidence: 99%
“…The maximum number of topics generated was equal to the number of documents in the corpus. For extracting a few topics (k), the topmost k singular values were taken from the matrix ΣΣ T [12,40].…”
Section: Singular Vector Decompositionmentioning
confidence: 99%