Download presentation

Presentation is loading. Please wait.

Published byImani Vaile Modified over 2 years ago

1
Paper: Indexing by Latent Semantic Analysis for course cs630 presented by: Haiyan Qiao

2
Problem Introduction Traditional term-matching method doesn’t work well in information retrieval We want to capture the concepts instead of words. Concepts are reflected in the words. However, –One term may have multiple meaning –Different terms may have the same meaning.

3
LSI (Latent Semantic Analysis) LSI approach tries to overcome the deficiencies of term-matching retrieval by treating the unreliability of observed term-document association data as a statistical problem. The goal is to find effective models to represent the relationship between terms and documents. Hence a set of terms, which is by itself incomplete and unreliable, will be replaced by some set of entities which are more reliable indicants.

4
SVD (Singular Value Decomposition) How to learn the concepts from data? SVD is applied to derive the latent semantic structure model. What is SVD?

5
SVDcont’ SVD of the term-by-document matrix X: If the singular values of S0 are ordered by size, we only keep the first k largest values and get a reduced model: – doesn’t exactly match X and it gets closer as more and more singular values are kept –This is what we want. We don’t want perfect fit since we think some of 0’s in X should be 1 and vice versa. –It reflects the major associative patterns in the data, and ignores the smaller, less important influence and noise.

6
Fundamental Comparison Quantities from the SVD Model Comparing Two Terms: the dot product between two row vectors of reflects the extent to which two terms have a similar pattern of occurrence across the set of document. Comparing Two Documents: dot product between two column vectors of Comparing a Term and a Document

7
Example -Technical Memo Query: human-computer interaction Dataset: c1Human machine interface for Lab ABC computer application c2A survey of user opinion of computer system response time c3The EPS user interface management system c4System and human system engineering testing of EPS c5Relations of user-perceived response time to error measurement m1The generation of random, binary, unordered trees m2 The intersection graph of paths in trees m3 Graph minors IV: Widths of trees and well-quasi-ordering m4Graph minors: A survey

8
Example cont’ % 12-term by 9-document matrix >> X=[ ; ; ; ; ; ; ; ; ; ;];

9
Examplecont’ % X=T0*S0*D0', T0 and D0 have orthonormal columns and So is diagonal % T0 is the matrix of eigenvectors of the square symmetric matrix XX' % D0 is the matrix of eigenvectors of X’X % S0 is the matrix of eigenvalues in both cases >> [T0, S0] = eig(X*X'); >> T0 T0 =

10
Examplecont’ >> [D0, S0] = eig(X'*X); >> D0 D0 =

11
Examplecont’ >> S0=eig(X'*X) >> S0=S0.^0.5 S0 = % We only keep the largest two singular values % and the corresponding columns from the T and D

12
Examplecont’ >> T=[ ; ; ; ; ; ; ; ; ; ; ;]; >> S = [ ; ]; >> D’ =[ ; ;] >> T*S*D’

13
Summary What is the common and difference between PCA and SVD? Both are related to standard eigenvalue- eigenvector, to remove noise or correlation and get the most important info. PCA is on covariance matrix and SVD works on original matrix.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google