Introduction to Information Retrieval Introduction to Information Retrieval CS276: Information Retrieval and Web Search Christopher Manning and Pandu Nayak.

Slides:



Advertisements
Similar presentations
Introduction to Information Retrieval Outline ❶ Latent semantic indexing ❷ Dimensionality reduction ❸ LSI in information retrieval 1.
Advertisements

Eigen Decomposition and Singular Value Decomposition
3D Geometry for Computer Graphics
Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
Dimensionality Reduction PCA -- SVD
Comparison of information retrieval techniques: Latent semantic indexing (LSI) and Concept indexing (CI) Jasminka Dobša Faculty of organization and informatics,
1cs542g-term High Dimensional Data  So far we’ve considered scalar data values f i (or interpolated/approximated each component of vector values.
What is missing? Reasons that ideal effectiveness hard to achieve: 1. Users’ inability to describe queries precisely. 2. Document representation loses.
Hinrich Schütze and Christina Lioma
Symmetric Matrices and Quadratic Forms
3D Geometry for Computer Graphics
CS347 Lecture 4 April 18, 2001 ©Prabhakar Raghavan.
1 Latent Semantic Indexing Jieping Ye Department of Computer Science & Engineering Arizona State University
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 4 March 30, 2005
Information Retrieval in Text Part III Reference: Michael W. Berry and Murray Browne. Understanding Search Engines: Mathematical Modeling and Text Retrieval.
Singular Value Decomposition in Text Mining Ram Akella University of California Berkeley Silicon Valley Center/SC Lecture 4b February 9, 2011.
TFIDF-space  An obvious way to combine TF-IDF: the coordinate of document in axis is given by  General form of consists of three parts: Local weight.
1/ 30. Problems for classical IR models Introduction & Background(LSI,SVD,..etc) Example Standard query method Analysis standard query method Seeking.
IR Models: Latent Semantic Analysis. IR Model Taxonomy Non-Overlapping Lists Proximal Nodes Structured Models U s e r T a s k Set Theoretic Fuzzy Extended.
The Terms that You Have to Know! Basis, Linear independent, Orthogonal Column space, Row space, Rank Linear combination Linear transformation Inner product.
Introduction to Information Retrieval Introduction to Information Retrieval Hinrich Schütze and Christina Lioma Lecture 18: Latent Semantic Indexing 1.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 6 May 7, 2006
3D Geometry for Computer Graphics
Lecture 20 SVD and Its Applications Shang-Hua Teng.
Multimedia Databases LSI and SVD. Text - Detailed outline text problem full text scanning inversion signature files clustering information filtering and.
E.G.M. PetrakisDimensionality Reduction1  Given N vectors in n dims, find the k most important axes to project them  k is user defined (k < n)  Applications:
DATA MINING LECTURE 7 Dimensionality Reduction PCA – SVD
1 CS 430 / INFO 430 Information Retrieval Lecture 9 Latent Semantic Indexing.
1cs542g-term Notes  Extra class next week (Oct 12, not this Friday)  To submit your assignment: me the URL of a page containing (links to)
CS276A Text Retrieval and Mining Lecture 15 Thanks to Thomas Hoffman, Brown University for sharing many of these slides.
Information Retrieval Latent Semantic Indexing. Speeding up cosine computation What if we could take our vectors and “pack” them into fewer dimensions.
Latent Semantic Indexing (mapping onto a smaller space of latent concepts) Paolo Ferragina Dipartimento di Informatica Università di Pisa Reading 18.
Homework Define a loss function that compares two matrices (say mean square error) b = svd(bellcore) b2 = b$u[,1:2] %*% diag(b$d[1:2]) %*% t(b$v[,1:2])
Chapter 2 Dimensionality Reduction. Linear Methods
1 Vector Space Model Rong Jin. 2 Basic Issues in A Retrieval Model How to represent text objects What similarity function should be used? How to refine.
CS246 Topic-Based Models. Motivation  Q: For query “car”, will a document with the word “automobile” be returned as a result under the TF-IDF vector.
Latent Semantic Indexing Debapriyo Majumdar Information Retrieval – Spring 2015 Indian Statistical Institute Kolkata.
Automated Essay Grading Resources: Introduction to Information Retrieval, Manning, Raghavan, Schutze (Chapter 06 and 18) Automated Essay Scoring with e-rater.
PrasadL18LSI1 Latent Semantic Indexing Adapted from Lectures by Prabhaker Raghavan, Christopher Manning and Thomas Hoffmann.
Introduction to Information Retrieval Introduction to Information Retrieval CS276: Information Retrieval and Web Search Christopher Manning and Prabhakar.
Matrix Factorization and Latent Semantic Indexing 1 Lecture 13: Matrix Factorization and Latent Semantic Indexing Web Search and Mining.
Introduction to Information Retrieval Lecture 19 LSI Thanks to Thomas Hofmann for some slides.
Latent Semantic Analysis Hongning Wang Recap: vector space model Represent both doc and query by concept vectors – Each concept defines one dimension.
CpSc 881: Information Retrieval. 2 Recall: Term-document matrix This matrix is the basis for computing the similarity between documents and queries. Today:
Latent Semantic Indexing: A probabilistic Analysis Christos Papadimitriou Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala.
Text Categorization Moshe Koppel Lecture 12:Latent Semantic Indexing Adapted from slides by Prabhaker Raghavan, Chris Manning and TK Prasad.
SINGULAR VALUE DECOMPOSITION (SVD)
Introduction to Information Retrieval Introduction to Information Retrieval CS276: Information Retrieval and Web Search Christopher Manning and Pandu Nayak.
Latent Semantic Indexing
1 CSC 594 Topics in AI – Text Mining and Analytics Fall 2015/16 6. Dimensionality Reduction.
Latent Semantic Indexing and Probabilistic (Bayesian) Information Retrieval.
Introduction to Linear Algebra Mark Goldman Emily Mackevicius.
1 CS 430: Information Discovery Lecture 11 Latent Semantic Indexing.
Web Search and Text Mining Lecture 5. Outline Review of VSM More on LSI through SVD Term relatedness Probabilistic LSI.
ITCS 6265 Information Retrieval & Web Mining Lecture 16 Latent semantic indexing Thanks to Thomas Hofmann for some slides.
Web Search and Data Mining Lecture 4 Adapted from Manning, Raghavan and Schuetze.
Matrix Factorization & Singular Value Decomposition Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
1 Chapter 8 – Symmetric Matrices and Quadratic Forms Outline 8.1 Symmetric Matrices 8.2Quardratic Forms 8.3Singular ValuesSymmetric MatricesQuardratic.
PrasadL18LSI1 Latent Semantic Indexing Adapted from Lectures by Prabhaker Raghavan, Christopher Manning and Thomas Hoffmann.
Unsupervised Learning II Feature Extraction
Eigen & Singular Value Decomposition
Eigen Decomposition Based on the slides by Mani Thomas and book by Gilbert Strang. Modified and extended by Longin Jan Latecki.
Eigen Decomposition Based on the slides by Mani Thomas and book by Gilbert Strang. Modified and extended by Longin Jan Latecki.
Eigen Decomposition Based on the slides by Mani Thomas and book by Gilbert Strang. Modified and extended by Longin Jan Latecki.
Eigen Decomposition Based on the slides by Mani Thomas and book by Gilbert Strang. Modified and extended by Longin Jan Latecki.
Eigen Decomposition Based on the slides by Mani Thomas and book by Gilbert Strang. Modified and extended by Longin Jan Latecki.
Latent Semantic Indexing
Restructuring Sparse High Dimensional Data for Effective Retrieval
Latent Semantic Analysis
Presentation transcript:

Introduction to Information Retrieval Introduction to Information Retrieval CS276: Information Retrieval and Web Search Christopher Manning and Pandu Nayak Lecture 13: Latent Semantic Indexing

Introduction to Information Retrieval Today’s topic Latent Semantic Indexing  Term-document matrices are very large  But the number of topics that people talk about is small (in some sense)  Clothes, movies, politics, …  Can we represent the term-document space by a lower dimensional latent space? Ch. 18

Introduction to Information Retrieval Linear Algebra Background

Introduction to Information Retrieval Eigenvalues & Eigenvectors  Eigenvectors (for a square m  m matrix S )  How many eigenvalues are there at most? only has a non-zero solution if This is a m th order equation in λ which can have at most m distinct solutions (roots of the characteristic polynomial) – can be complex even though S is real. eigenvalue(right) eigenvector Example Sec. 18.1

Introduction to Information Retrieval Matrix-vector multiplication has eigenvalues 30, 20, 1 with corresponding eigenvectors On each eigenvector, S acts as a multiple of the identity matrix: but as a different multiple on each. Any vector (say x= ) can be viewed as a combination of the eigenvectors: x = 2v 1 + 4v 2 + 6v 3 Sec. 18.1

Introduction to Information Retrieval Matrix-vector multiplication  Thus a matrix-vector multiplication such as Sx (S, x as in the previous slide) can be rewritten in terms of the eigenvalues/vectors:  Even though x is an arbitrary vector, the action of S on x is determined by the eigenvalues/vectors. Sec. 18.1

Introduction to Information Retrieval Matrix-vector multiplication  Suggestion: the effect of “small” eigenvalues is small.  If we ignored the smallest eigenvalue (1), then instead of we would get  These vectors are similar (in cosine similarity, etc.) Sec. 18.1

Introduction to Information Retrieval Eigenvalues & Eigenvectors For symmetric matrices, eigenvectors for distinct eigenvalues are orthogonal All eigenvalues of a real symmetric matrix are real. All eigenvalues of a positive semidefinite matrix are non-negative Sec. 18.1

Introduction to Information Retrieval Plug in these values and solve for eigenvectors. Example  Let  Then  The eigenvalues are 1 and 3 (nonnegative, real).  The eigenvectors are orthogonal (and real): Real, symmetric. Sec. 18.1

Introduction to Information Retrieval  Let be a square matrix with m linearly independent eigenvectors (a “non-defective” matrix)  Theorem: Exists an eigen decomposition  (cf. matrix diagonalization theorem)  Columns of U are the eigenvectors of S  Diagonal elements of are eigenvalues of Eigen/diagonal Decomposition diagonal Unique for distinct eigen- values Sec. 18.1

Introduction to Information Retrieval Diagonal decomposition: why/how Let U have the eigenvectors as columns: Then, SU can be written And S=U  U –1. Thus SU=U , or U –1 SU=  Sec. 18.1

Introduction to Information Retrieval Diagonal decomposition - example Recall The eigenvectors and form Inverting, we have Then, S=U  U –1 = Recall UU –1 =1. Sec. 18.1

Introduction to Information Retrieval Example continued Let’s divide U (and multiply U –1 ) by Then, S= Q(Q -1 = Q T )  Why? Stay tuned … Sec. 18.1

Introduction to Information Retrieval  If is a symmetric matrix:  Theorem: There exists a (unique) eigen decomposition  where Q is orthogonal:  Q -1 = Q T  Columns of Q are normalized eigenvectors  Columns are orthogonal.  (everything is real) Symmetric Eigen Decomposition Sec. 18.1

Introduction to Information Retrieval Exercise  Examine the symmetric eigen decomposition, if any, for each of the following matrices: Sec. 18.1

Introduction to Information Retrieval Time out!  I came to this class to learn about text retrieval and mining, not to have my linear algebra past dredged up again …  But if you want to dredge, Strang’s Applied Mathematics is a good place to start.  What do these matrices have to do with text?  Recall M  N term-document matrices …  But everything so far needs square matrices – so …

Introduction to Information Retrieval Similarity  Clustering  We can compute the similarity between two document vector representations x i and x j by x i x j T  Let X = [x 1 … x N ]  Then XX T is a matrix of similarities  XX T is symmetric  So XX T = QΛQ T  So we can decompose this similarity space into a set of orthonormal basis vectors (given in Q) scaled by the eigenvalues in Λ  This leads to PCA (Principal Components Analysis) 17

Introduction to Information Retrieval Singular Value Decomposition MMMMMNMNV is N  N For an M  N matrix A of rank r there exists a factorization (Singular Value Decomposition = SVD) as follows: (Not proven here.) Sec. 18.2

Introduction to Information Retrieval Singular Value Decomposition  AA T = QΛQ T  AA T = (UΣV T )(UΣV T ) T = (UΣV T )(VΣU T ) = UΣ 2 U T MMMMMNMNV is N  N The columns of U are orthogonal eigenvectors of AA T. The columns of V are orthogonal eigenvectors of A T A. Singular values Eigenvalues 1 … r of AA T are the eigenvalues of A T A. Sec. 18.2

Introduction to Information Retrieval Singular Value Decomposition  Illustration of SVD dimensions and sparseness Sec. 18.2

Introduction to Information Retrieval SVD example Let Thus M=3, N=2. Its SVD is Typically, the singular values arranged in decreasing order. Sec. 18.2

Introduction to Information Retrieval  SVD can be used to compute optimal low-rank approximations.  Approximation problem: Find A k of rank k such that A k and X are both m  n matrices. Typically, want k << r. Low-rank Approximation Frobenius norm Sec. 18.3

Introduction to Information Retrieval  Solution via SVD Low-rank Approximation set smallest r-k singular values to zero column notation: sum of rank 1 matrices k Sec. 18.3

Introduction to Information Retrieval  If we retain only k singular values, and set the rest to 0, then we don’t need the matrix parts in color  Then Σ is k×k, U is M×k, V T is k×N, and A k is M×N  This is referred to as the reduced SVD  It is the convenient (space-saving) and usual form for computational applications  It’s what Matlab gives you Reduced SVD k Sec. 18.3

Introduction to Information Retrieval Approximation error  How good (bad) is this approximation?  It’s the best possible, measured by the Frobenius norm of the error: where the  i are ordered such that  i   i+1. Suggests why Frobenius error drops as k increases. Sec. 18.3

Introduction to Information Retrieval SVD Low-rank approximation  Whereas the term-doc matrix A may have M=50000, N=10 million (and rank close to 50000)  We can construct an approximation A 100 with rank 100.  Of all rank 100 matrices, it would have the lowest Frobenius error.  Great … but why would we??  Answer: Latent Semantic Indexing C. Eckart, G. Young, The approximation of a matrix by another of lower rank. Psychometrika, 1, , Sec. 18.3

Introduction to Information Retrieval Latent Semantic Indexing via the SVD

Introduction to Information Retrieval What it is  From term-doc matrix A, we compute the approximation A k.  There is a row for each term and a column for each doc in A k  Thus docs live in a space of k<<r dimensions  These dimensions are not the original axes  But why? Sec. 18.4

Introduction to Information Retrieval Vector Space Model: Pros  Automatic selection of index terms  Partial matching of queries and documents (dealing with the case where no document contains all search terms)  Ranking according to similarity score (dealing with large result sets)  Term weighting schemes (improves retrieval performance)  Various extensions  Document clustering  Relevance feedback (modifying query vector)  Geometric foundation

Introduction to Information Retrieval Problems with Lexical Semantics  Ambiguity and association in natural language  Polysemy: Words often have a multitude of meanings and different types of usage (more severe in very heterogeneous collections).  The vector space model is unable to discriminate between different meanings of the same word.

Introduction to Information Retrieval Problems with Lexical Semantics  Synonymy: Different terms may have an identical or a similar meaning (weaker: words indicating the same topic).  No associations between words are made in the vector space representation.

Introduction to Information Retrieval Polysemy and Context  Document similarity on single word level: polysemy and context car company dodge ford meaning 2 ring jupiter space voyager meaning 1 … saturn... … planet... contribution to similarity, if used in 1 st meaning, but not if in 2 nd

Introduction to Information Retrieval Latent Semantic Indexing (LSI)  Perform a low-rank approximation of document- term matrix (typical rank 100–300)  General idea  Map documents (and terms) to a low-dimensional representation.  Design a mapping such that the low-dimensional space reflects semantic associations (latent semantic space).  Compute document similarity based on the inner product in this latent semantic space Sec. 18.4

Introduction to Information Retrieval Goals of LSI  LSI takes documents that are semantically similar (= talk about the same topics), but are not similar in the vector space (because they use different words) and re-represents them in a reduced vector space in which they have higher similarity.  Similar terms map to similar location in low dimensional space  Noise reduction by dimension reduction Sec. 18.4

Introduction to Information Retrieval Latent Semantic Analysis  Latent semantic space: illustrating example courtesy of Susan Dumais Sec. 18.4

Introduction to Information Retrieval Performing the maps  Each row and column of A gets mapped into the k- dimensional LSI space, by the SVD.  Claim – this is not only the mapping with the best (Frobenius error) approximation to A, but in fact improves retrieval.  A query q is also mapped into this space, by  Query NOT a sparse vector. Sec. 18.4

Introduction to Information Retrieval LSA Example  A simple example term-document matrix (binary) 37

Introduction to Information Retrieval LSA Example  Example of C = UΣVT: The matrix U 38

Introduction to Information Retrieval LSA Example  Example of C = UΣVT: The matrix Σ 39

Introduction to Information Retrieval LSA Example  Example of C = UΣV T : The matrix V T 40

Introduction to Information Retrieval LSA Example: Reducing the dimension 41

Introduction to Information Retrieval Original matrix C vs. reduced C 2 = UΣ 2 V T 42

Introduction to Information Retrieval Why the reduced dimension matrix is better  Similarity of d2 and d3 in the original space: 0.  Similarity of d2 and d3 in the reduced space: 0.52 ∗ ∗ ∗ ∗ −0.39 ∗ −0.08 ≈ 0.52  Typically, LSA increases recall and hurts precision 43

Introduction to Information Retrieval Empirical evidence  Experiments on TREC 1/2/3 – Dumais  Lanczos SVD code (available on netlib) due to Berry used in these experiments  Running times of ~ one day on tens of thousands of docs [still an obstacle to use!]  Dimensions – various values reported. Reducing k improves recall.  (Under 200 reported unsatisfactory)  Generally expect recall to improve – what about precision? Sec. 18.4

Introduction to Information Retrieval Empirical evidence  Precision at or above median TREC precision  Top scorer on almost 20% of TREC topics  Slightly better on average than straight vector spaces  Effect of dimensionality: DimensionsPrecision Sec. 18.4

Introduction to Information Retrieval Failure modes  Negated phrases  TREC topics sometimes negate certain query/terms phrases – precludes simple automatic conversion of topics to latent semantic space.  Boolean queries  As usual, freetext/vector space syntax of LSI queries precludes (say) “Find any doc having to do with the following 5 companies”  See Dumais for more. Sec. 18.4

Introduction to Information Retrieval But why is this clustering?  We’ve talked about docs, queries, retrieval and precision here.  What does this have to do with clustering?  Intuition: Dimension reduction through LSI brings together “related” axes in the vector space. Sec. 18.4

Introduction to Information Retrieval Intuition from block matrices Block 1 Block 2 … Block k 0’s0’s 0’s0’s = Homogeneous non-zero blocks. M terms N documents What’s the rank of this matrix?

Introduction to Information Retrieval Intuition from block matrices Block 1 Block 2 … Block k 0’s0’s 0’s0’s M terms N documents Vocabulary partitioned into k topics (clusters); each doc discusses only one topic.

Introduction to Information Retrieval Intuition from block matrices Block 1 Block 2 … Block k 0’s0’s 0’s0’s = non-zero entries. M terms N documents What’s the best rank-k approximation to this matrix?

Introduction to Information Retrieval Intuition from block matrices Block 1 Block 2 … Block k Few nonzero entries wiper tire V6 car automobile Likely there’s a good rank-k approximation to this matrix.

Introduction to Information Retrieval Simplistic picture Topic 1 Topic 2 Topic 3

Introduction to Information Retrieval Some wild extrapolation  The “dimensionality” of a corpus is the number of distinct topics represented in it.  More mathematical wild extrapolation:  if A has a rank k approximation of low Frobenius error, then there are no more than k distinct topics in the corpus.

Introduction to Information Retrieval LSI has many other applications  In many settings in pattern recognition and retrieval, we have a feature-object matrix.  For text, the terms are features and the docs are objects.  Could be opinions and users …  This matrix may be redundant in dimensionality.  Can work with low-rank approximation.  If entries are missing (e.g., users’ opinions), can recover if dimensionality is low.  Powerful general analytical technique  Close, principled analog to clustering methods.

Introduction to Information Retrieval Resources  IIR 18  Scott Deerwester, Susan Dumais, George Furnas, Thomas Landauer, Richard Harshman Indexing by latent semantic analysis. JASIS 41(6):391—407.