nips nips2012 nips2012-lsi knowledge-graph by maker-knowledge-mining
topicId: wordWeight*wordName (topN-words)
topic #0: 0.118*"xt" + 0.111*"yt" + 0.100*"policy" + 0.084*"xi" + 0.080*"classi" + 0.077*"latent" + 0.073*"xk" + 0.072*"clustering" + 0.072*"kernel" + 0.072*"graph"
topic #1: -0.545*"policy" + -0.325*"reward" + -0.184*"policies" + -0.180*"action" + -0.164*"mdp" + -0.140*"agent" + -0.140*"reinforcement" + -0.137*"expert" + -0.135*"actions" + -0.107*"regret"
topic #2: 0.214*"xt" + 0.207*"yt" + -0.164*"object" + -0.162*"image" + -0.153*"layer" + 0.152*"xk" + -0.150*"images" + -0.132*"cells" + -0.113*"cell" + 0.106*"convex"
topic #3: 0.524*"yt" + 0.383*"xt" + 0.162*"neurons" + 0.154*"spike" + 0.124*"neuron" + 0.096*"stimulus" + -0.085*"policy" + 0.085*"ht" + 0.084*"posterior" + 0.082*"regret"
topic #4: -0.161*"topic" + 0.153*"yt" + -0.149*"variational" + -0.140*"gp" + -0.134*"dirichlet" + -0.126*"latent" + 0.125*"object" + -0.121*"sampler" + 0.119*"xt" + -0.116*"gibbs"
topic #5: -0.264*"yt" + 0.243*"spike" + 0.230*"neurons" + 0.210*"neuron" + 0.135*"spikes" + 0.135*"synaptic" + -0.131*"xt" + 0.127*"stimulus" + 0.127*"spiking" + 0.104*"plasticity"
topic #6: 0.909*"qq" + 0.161*"qqq" + 0.118*"yn" + 0.091*"superset" + 0.081*"electricity" + 0.077*"forgetting" + 0.075*"qqqq" + 0.075*"load" + 0.075*"label" + 0.065*"wk"
topic #7: -0.220*"xk" + 0.164*"ranking" + -0.131*"proximal" + -0.128*"xs" + -0.124*"graphical" + 0.121*"classi" + -0.120*"xt" + 0.119*"loss" + 0.119*"kernel" + -0.117*"graph"
topic #8: 0.364*"xk" + -0.204*"tree" + -0.172*"node" + -0.156*"nodes" + 0.145*"hashing" + -0.145*"graph" + -0.115*"xs" + 0.111*"sk" + -0.108*"graphical" + 0.102*"proximal"
topic #9: -0.356*"gp" + 0.222*"ranking" + 0.197*"items" + 0.167*"item" + -0.129*"kernel" + 0.118*"xk" + -0.110*"covariance" + 0.101*"spike" + 0.099*"tree" + 0.098*"graph"
topic #10: -0.298*"gp" + -0.210*"xk" + 0.179*"topic" + -0.160*"item" + -0.148*"items" + 0.146*"regret" + 0.135*"clustering" + 0.128*"topics" + 0.122*"lda" + 0.117*"document"
topic #11: -0.244*"clustering" + -0.194*"metric" + 0.174*"xk" + -0.171*"cluster" + -0.163*"hashing" + 0.145*"topic" + -0.140*"clusters" + 0.116*"topics" + 0.114*"regret" + -0.111*"distance"
topic #12: -0.218*"cells" + -0.210*"cell" + 0.166*"xk" + -0.166*"regret" + -0.141*"lters" + -0.125*"items" + -0.122*"item" + 0.119*"yt" + -0.114*"gp" + 0.111*"kernel"
topic #13: 0.231*"hashing" + -0.146*"arm" + 0.138*"hash" + -0.125*"object" + -0.124*"cuboid" + -0.119*"regret" + 0.115*"dbm" + 0.114*"xt" + 0.110*"dual" + -0.107*"detection"
topic #14: -0.242*"hashing" + -0.183*"xk" + -0.158*"regret" + 0.155*"clustering" + 0.141*"submodular" + -0.138*"arm" + -0.137*"hash" + -0.118*"tree" + -0.114*"gp" + -0.110*"spn"
topic #15: 0.199*"gp" + -0.141*"kernel" + 0.130*"cuboid" + -0.124*"xk" + 0.109*"detection" + 0.100*"regret" + -0.098*"sampler" + -0.097*"gibbs" + -0.097*"kernels" + -0.096*"cells"
topic #16: 0.230*"transelliptical" + 0.157*"estimator" + 0.145*"elliptical" + 0.142*"nonparanormal" + 0.141*"kendall" + -0.131*"clustering" + -0.131*"dual" + 0.127*"yt" + 0.127*"mse" + 0.123*"fd"
topic #17: -0.452*"privacy" + -0.189*"private" + -0.137*"ppca" + -0.133*"mwem" + -0.125*"differentially" + 0.115*"gp" + 0.109*"metric" + -0.105*"sampler" + 0.098*"xk" + 0.097*"clustering"
topic #18: -0.247*"hashing" + 0.227*"tensor" + 0.205*"metric" + 0.163*"riemannian" + -0.149*"hash" + 0.140*"manifold" + -0.138*"arm" + -0.134*"xs" + -0.124*"gp" + 0.121*"privacy"
topic #19: 0.204*"cells" + 0.188*"cell" + 0.143*"xs" + 0.122*"lters" + -0.116*"dbm" + 0.109*"metric" + 0.106*"lmnn" + -0.099*"pt" + 0.097*"privacy" + 0.094*"xi"
topic #20: -0.294*"privacy" + 0.194*"submodular" + -0.189*"clustering" + -0.184*"xk" + -0.144*"gp" + 0.130*"dual" + -0.126*"private" + 0.110*"arm" + -0.108*"cluster" + 0.105*"primal"
topic #21: -0.165*"transelliptical" + 0.158*"tree" + 0.141*"hashing" + 0.128*"cells" + -0.119*"metric" + 0.118*"cell" + -0.107*"xt" + -0.106*"regret" + -0.104*"elliptical" + -0.099*"nonparanormal"
topic #22: 0.246*"spn" + -0.212*"xs" + 0.165*"mse" + 0.155*"submodular" + 0.133*"entropy" + -0.123*"bt" + 0.118*"kernel" + 0.117*"node" + 0.114*"estimator" + 0.104*"spns"
topic #23: -0.212*"xt" + -0.186*"kernel" + -0.183*"privacy" + -0.164*"kernels" + -0.127*"hashing" + -0.125*"mkl" + 0.124*"yt" + 0.117*"ranking" + -0.090*"item" + 0.088*"loss"
topic #24: 0.327*"submodular" + 0.228*"privacy" + 0.178*"dpp" + 0.122*"bregman" + 0.120*"determinantal" + 0.111*"arm" + 0.106*"cs" + 0.104*"private" + -0.098*"norm" + 0.096*"yt"
topic #25: -0.163*"transelliptical" + -0.141*"patient" + 0.126*"xs" + 0.124*"submodular" + -0.113*"spn" + -0.105*"diffusion" + -0.101*"elliptical" + 0.100*"tree" + -0.098*"classi" + -0.094*"quic"
topic #26: -0.242*"transelliptical" + 0.196*"xs" + -0.176*"submodular" + -0.155*"elliptical" + -0.146*"kendall" + 0.126*"mse" + -0.120*"fd" + -0.119*"gp" + -0.115*"particle" + -0.106*"nonparanormal"
topic #27: 0.170*"xt" + 0.164*"spn" + 0.144*"sk" + -0.137*"yt" + -0.124*"arm" + -0.115*"tree" + -0.108*"reward" + 0.097*"ranking" + -0.093*"ti" + -0.091*"covariance"
topic #28: 0.143*"stimulus" + -0.133*"spike" + 0.130*"entropy" + -0.123*"ranking" + 0.120*"xi" + 0.117*"estimator" + -0.109*"ti" + -0.100*"spn" + 0.097*"mse" + 0.093*"dbm"
topic #29: -0.140*"dbm" + -0.131*"particle" + 0.127*"wavelet" + 0.121*"mdp" + 0.113*"dual" + 0.113*"spn" + 0.111*"xi" + -0.110*"particles" + -0.094*"smc" + 0.093*"primal"
topic #30: 0.176*"gp" + -0.143*"active" + 0.133*"ranking" + -0.125*"xt" + -0.117*"svm" + 0.110*"bt" + 0.103*"yt" + 0.096*"change" + 0.092*"acoustic" + -0.089*"regret"
topic #31: -0.185*"ranking" + 0.138*"yt" + -0.134*"xt" + 0.110*"sk" + 0.100*"wk" + 0.099*"spn" + 0.093*"adaptation" + 0.092*"submodular" + -0.091*"tree" + 0.089*"tracking"
topic #32: 0.286*"spn" + -0.173*"risk" + 0.140*"reward" + -0.126*"mdp" + 0.123*"spns" + 0.118*"xs" + -0.109*"patient" + 0.107*"mse" + -0.106*"dbm" + 0.105*"poon"
topic #33: 0.189*"spn" + -0.158*"wk" + -0.131*"tree" + -0.131*"wavelet" + -0.130*"xt" + -0.127*"adaptation" + 0.114*"gp" + -0.103*"ln" + -0.100*"domain" + 0.098*"ui"
topic #34: -0.140*"adaptation" + -0.129*"transelliptical" + 0.127*"stimulus" + 0.120*"privacy" + 0.116*"pk" + -0.111*"active" + -0.104*"xt" + -0.098*"compressed" + -0.095*"spike" + -0.093*"cs"
topic #35: 0.152*"norm" + 0.138*"xs" + 0.108*"trace" + 0.105*"submodular" + 0.099*"elastic" + 0.097*"sp" + -0.087*"graph" + -0.086*"svm" + 0.084*"dpp" + 0.082*"bt"
topic #36: -0.116*"dpp" + 0.112*"entropy" + -0.108*"vc" + 0.108*"variational" + -0.105*"bd" + 0.097*"acoustic" + 0.095*"mse" + 0.094*"gt" + -0.091*"quic" + -0.090*"hk"
topic #37: 0.116*"wavelet" + 0.113*"spike" + 0.105*"xs" + -0.098*"variational" + 0.095*"mdp" + 0.093*"mse" + -0.092*"hmm" + 0.091*"particle" + -0.087*"mj" + 0.083*"particles"
topic #38: -0.169*"pt" + 0.102*"active" + -0.101*"variational" + -0.094*"synaptic" + 0.091*"ti" + 0.089*"ranking" + 0.087*"latent" + 0.084*"svm" + 0.080*"oracle" + 0.080*"stimulus"
topic #39: 0.208*"diffusion" + 0.191*"pk" + -0.128*"reward" + 0.126*"frag" + 0.112*"pt" + 0.094*"tracking" + -0.092*"atoms" + -0.085*"tensor" + -0.081*"sampler" + 0.081*"xnl"
topic #40: -0.151*"gamma" + 0.129*"variational" + -0.127*"xt" + -0.106*"gp" + -0.102*"atoms" + -0.102*"nb" + -0.100*"atom" + -0.098*"pk" + -0.093*"def" + 0.087*"particles"
topic #41: 0.119*"dbm" + 0.114*"lp" + 0.103*"spn" + -0.098*"movement" + 0.097*"simplex" + -0.094*"bci" + -0.089*"imaginary" + 0.089*"events" + 0.089*"cuboid" + 0.088*"acoustic"
topic #42: 0.171*"dbm" + -0.118*"qk" + 0.114*"ti" + -0.112*"hmm" + 0.112*"adaptation" + -0.098*"pt" + -0.092*"dictionary" + 0.091*"pretraining" + 0.089*"arm" + -0.087*"acoustic"
topic #43: 0.195*"pt" + -0.164*"bt" + -0.108*"change" + 0.104*"mtl" + -0.096*"mmsb" + -0.089*"mmtm" + -0.086*"ergodic" + -0.083*"simplex" + 0.080*"ranking" + -0.080*"xt"
topic #44: -0.132*"dictionary" + 0.115*"disease" + -0.111*"ltp" + 0.099*"variational" + -0.096*"qk" + 0.092*"arm" + -0.092*"player" + -0.087*"atoms" + 0.087*"wlps" + 0.085*"entropy"
topic #45: -0.134*"tensor" + 0.124*"sk" + -0.119*"def" + 0.117*"fi" + -0.116*"xs" + 0.114*"expert" + 0.105*"lmnn" + 0.101*"kr" + 0.100*"reward" + 0.094*"similarity"
topic #46: 0.155*"mmsb" + 0.119*"mmtm" + 0.103*"ut" + 0.101*"agent" + 0.101*"network" + 0.101*"communities" + -0.095*"xt" + 0.095*"views" + -0.094*"tensor" + 0.093*"community"
topic #47: 0.170*"ut" + -0.144*"reward" + -0.095*"pr" + 0.094*"policy" + 0.088*"spn" + 0.087*"copula" + -0.087*"curvature" + 0.082*"coaching" + -0.082*"pt" + 0.081*"oracle"
topic #48: -0.162*"bt" + -0.114*"pt" + -0.109*"mtl" + -0.109*"change" + -0.100*"hk" + -0.099*"dh" + -0.096*"ergodic" + -0.085*"dictionary" + 0.082*"repulsive" + -0.078*"mdp"
topic #49: -0.133*"pt" + -0.112*"dpp" + 0.104*"pv" + 0.098*"ats" + 0.097*"def" + -0.095*"pivot" + -0.089*"denoising" + 0.085*"quantization" + 0.083*"nt" + -0.083*"determinantal"
Latent semantic indexing
Latent semantic indexing (LSI) is an indexing and retrieval method that uses a mathematical technique called singular value decomposition (SVD) to identify patterns in the relationships between the terms and concepts contained in an unstructured collection of text. LSI is based on the principle that words that are used in the same contexts tend to have similar meanings. A key feature of LSI is its ability to extract the conceptual content of a body of text by establishing associations between those terms that occur in similar contexts.
LSI is also an application of correspondence analysis, a multivariate statistical technique developed by Jean-Paul Benzécri in the early 1970s, to a contingency table built from word counts in documents.
Called Latent Semantic Indexing because of its ability to correlate semantically related terms that are latent in a collection of text, it was first applied to text at Bellcore in the late 1980s. The method, also called latent semantic analysis (LSA), uncovers the underlying latent semantic structure in the usage of words in a body of text and how it can be used to extract the meaning of the text in response to user queries, commonly referred to as concept searches. Queries, or concept searches, against a set of documents that have undergone LSI will return results that are conceptually similar in meaning to the search criteria even if the results don’t share a specific word or words with the search criteria.
Benefits of LSI
LSI overcomes two of the most problematic constraints of Boolean keyword queries: multiple words that have similar meanings (synonymy) and words that have more than one meaning (polysemy). Synonymy is often the cause of mismatches in the vocabulary used by the authors of documents and the users of information retrieval systems. As a result, Boolean or keyword queries often return irrelevant results and miss information that is relevant.
LSI is also used to perform automated document categorization. In fact, several experiments have demonstrated that there are a number of correlations between the way LSI and humans process and categorize text. Document categorization is the assignment of documents to one or more predefined categories based on their similarity to the conceptual content of the categories. LSI uses example documents to establish the conceptual basis for each category. During categorization processing, the concepts contained in the documents being categorized are compared to the concepts contained in the example items, and a category (or categories) is assigned to the documents based on the similarities between the concepts they contain and the concepts that are contained in the example documents.
Dynamic clustering based on the conceptual content of documents can also be accomplished using LSI. Clustering is a way to group documents based on their conceptual similarity to each other without using example documents to establish the conceptual basis for each cluster. This is very useful when dealing with an unknown collection of unstructured text.
Because it uses a strictly mathematical approach, LSI is inherently independent of language. This enables LSI to elicit the semantic content of information written in any language without requiring the use of auxiliary structures, such as dictionaries and thesauri. LSI can also perform cross-linguistic concept searching and example-based categorization. For example, queries can be made in one language, such as English, and conceptually similar results will be returned even if they are composed of an entirely different language or of multiple languages.
LSI is not restricted to working only with words. It can also process arbitrary character strings. Any object that can be expressed as text can be represented in an LSI vector space. For example, tests with MEDLINE abstracts have shown that LSI is able to effectively classify genes based on conceptual modeling of the biological information contained in the titles and abstracts of the MEDLINE citations.
LSI automatically adapts to new and changing terminology, and has been shown to be very tolerant of noise (i.e., misspelled words, typographical errors, unreadable characters, etc.). This is especially important for applications using text derived from Optical Character Recognition (OCR) and speech-to-text conversion. LSI also deals effectively with sparse, ambiguous, and contradictory data.
Text does not need to be in sentence form for LSI to be effective. It can work with lists, free-form notes, email, Web-based content, etc. As long as a collection of text contains multiple terms, LSI can be used to identify patterns in the relationships between the important terms and concepts contained in the text.
LSI has proven to be a useful solution to a number of conceptual matching problems. The technique has been shown to capture key relationship information, including causal, goal-oriented, and taxonomic information.
LSI timeline
Mid-1960s – Factor analysis technique first described and tested (H. Borko and M. Bernick)
1988 – Seminal paper on LSI technique published (Deerwester et al.)
1989 – Original patent granted (Deerwester et al.)
1992 – First use of LSI to assign articles to reviewers (Dumais and Nielsen)
1994 – Patent granted for the cross-lingual application of LSI (Landauer et al.)
1995 – First use of LSI for grading essays (Foltz, et al., Landauer et al.)
1999 – First implementation of LSI technology for intelligence community for analyzing unstructured text (SAIC).
2002 – LSI-based product offering to intelligence-based government agencies (SAIC)
2005 – First vertical-specific application – publishing – EDB (EBSCO, Content Analyst Company)
Mathematics of LSI
LSI uses common linear algebra techniques to learn the conceptual correlations in a collection of text. In general, the process involves constructing a weighted term-document matrix, performing a Singular Value Decomposition on the matrix, and using the matrix to identify the concepts contained in the text.
Term-document matrix
LSI begins by constructing a term-document matrix, A, to identify the occurrences of the m unique terms within a collection of n documents. In a term-document matrix, each term is represented by a row, and each document is represented by a column, with each matrix cell, a_{ij}, initially representing the number of times the associated term appears in the indicated document, \mathrm{tf_{ij}}. This matrix is usually very large and very sparse.
Once a term-document matrix is constructed, local and global weighting functions can be applied to it to condition the data. The weighting functions transform each cell, a_{ij} of A, to be the product of a local term weight, l_{ij}, which describes the relative frequency of a term in a document, and a global weight, g_i, which describes the relative frequency of the term within the entire collection of documents.
Some common local weighting functions are defined in the following table.
Rank-reduced singular value decomposition
A rank-reduced, singular value decomposition is performed on the matrix to determine patterns in the relationships between the terms and concepts contained in the text. The SVD forms the foundation for LSI. It computes the term and document vector spaces by transforming the single term-frequency matrix, A, into three other matrices— an m by r term-concept vector matrix T, an r by r singular values matrix S, and a n by r concept-document vector matrix, D, which satisfy the following relations:
A = TSD^T
T^T T = I_r \quad D^T D = I_r
S_{1,1} \geq S_{2,2} \geq \ldots \geq S_{r,r} > 0 \quad S_{i,j} = 0 \; \text{where} \; i \neq j
In the formula, A is the supplied m by n weighted matrix of term frequencies in a collection of text where m is the number of unique terms, and n is the number of documents. T is a computed m by r matrix of term vectors where r is the rank of A—a measure of its unique dimensions ≤ min(m,n). S is a computed r by r diagonal matrix of decreasing singular values, and D is a computed n by r matrix of document vectors.
The LSI modification to a standard SVD is to reduce the rank or truncate the singular value matrix S to size k « r, typically on the order of a k in the range of 100 to 300 dimensions, effectively reducing the term and document vector matrix sizes to m by k and n by k respectively. The SVD operation, along with this reduction, has the effect of preserving the most important semantic information in the text while reducing noise and other undesirable artifacts of the original space of A. This reduced set of matrices is often denoted with a modified formula such as:
A ≈ Ak = Tk Sk DkT
Efficient LSI algorithms only compute the first k singular values and term and document vectors as opposed to computing a full SVD and then truncating it.
Note that this rank reduction is essentially the same as doing Principal Component Analysis (PCA) on the matrix A, except that PCA subtracts off the means. PCA loses the sparseness of the A matrix, which can make it infeasible for large lexicons.
Querying and augmenting LSI vector spaces
The computed Tk and Dk matrices define the term and document vector spaces, which with the computed singular values, Sk, embody the conceptual information derived from the document collection. The similarity of terms or documents within these spaces is a factor of how close they are to each other in these spaces, typically computed as a function of the angle between the corresponding vectors.
The same steps are used to locate the vectors representing the text of queries and new documents within the document space of an existing LSI index. By a simple transformation of the A = T S DT equation into the equivalent D = AT T S−1 equation, a new vector, d, for a query or for a new document can be created by computing a new column in A and then multiplying the new column by T S−1. The new column in A is computed using the originally derived global term weights and applying the same local weighting function to the terms in the query or in the new document.
A drawback to computing vectors in this way, when adding new searchable documents, is that terms that were not known during the SVD phase for the original index are ignored. These terms will have no impact on the global weights and learned correlations derived from the original collection of text. However, the computed vectors for the new text are still very relevant for similarity comparisons with all other document vectors.
The process of augmenting the document vector spaces for an LSI index with new documents in this manner is called folding in. Although the folding-in process does not account for the new semantic content of the new text, adding a substantial number of documents in this way will still provide good results for queries as long as the terms and concepts they contain are well represented within the LSI index to which they are being added. When the terms and concepts of a new set of documents need to be included in an LSI index, either the term-document matrix, and the SVD, must be recomputed or an incremental update method (such as the one described in) be used.
Additional uses of LSI
It is generally acknowledged that the ability to work with text on a semantic basis is essential to modern information retrieval systems. As a result, the use of LSI has significantly expanded in recent years as earlier challenges in scalability and performance have been overcome.
LSI is being used in a variety of information retrieval and text processing applications, although its primary application has been for concept searching and automated document categorization. Below are some other ways in which LSI is being used:
Information discovery (eDiscovery, Government/Intelligence community, Publishing)
Automated document classification (eDiscovery, Government/Intelligence community, Publishing)
Text summarization (eDiscovery, Publishing)
Relationship discovery (Government, Intelligence community, Social Networking)
Automatic generation of link charts of individuals and organizations (Government, Intelligence community)
Matching technical papers and grants with reviewers (Government)
Online customer support (Customer Management)
Determining document authorship (Education)
Automatic keyword annotation of images
Understanding software source code (Software Engineering)
Filtering spam (System Administration)
Information visualization
Essay scoring (Education)
Literature-based discovery
LSI is increasingly being used for electronic document discovery (eDiscovery) to help enterprises prepare for litigation. In eDiscovery, the ability to cluster, categorize, and search large collections of unstructured text on a conceptual basis is essential. Concept-based searching using LSI has been applied to the eDiscovery process by leading providers as early as 2003.) be used.
Challenges to LSI
Early challenges to LSI focused on scalability and performance. LSI requires relatively high computational performance and memory in comparison to other information retrieval techniques. However, with the implementation of modern high-speed processors and the availability of inexpensive memory, these considerations have been largely overcome. Real-world applications involving more than 30 million documents that were fully processed through the matrix and SVD computations are not uncommon in some LSI applications. A fully scalable (unlimited number of documents, online training) implementation of LSI is contained in the open source gensim software package.
Another challenge to LSI has been the alleged difficulty in determining the optimal number of dimensions to use for performing the SVD. As a general rule, fewer dimensions allow for broader comparisons of the concepts contained in a collection of text, while a higher number of dimensions enable more specific (or more relevant) comparisons of concepts. The actual number of dimensions that can be used is limited by the number of documents in the collection. Research has demonstrated that around 300 dimensions will usually provide the best results with moderate-sized document collections (hundreds of thousands of documents) and perhaps 400 dimensions for larger document collections (millions of documents). However, recent studies indicate that 50-1000 dimensions are suitable depending on the size and nature of the document collection.
Checking the amount of variance in the data after computing the SVD can be used to determine the optimal number of dimensions to retain. The variance contained in the data can be viewed by plotting the singular values (S) in a scree plot. Some LSI practitioners select the dimensionality associated with the knee of the curve as the cut-off point for the number of dimensions to retain. Others argue that some quantity of the variance must be retained, and the amount of variance in the data should dictate the proper dimensionality to retain. Seventy percent is often mentioned as the amount of variance in the data that should be used to select the optimal dimensionality for recomputing the SVD.
from wiki http://en.wikipedia.org/wiki/Latent_semantic_indexing
Latent semantic analysis
Latent semantic analysis (LSA) is a technique in natural language processing, in particular in vectorial semantics, of analyzing relationships between a set of documents and the terms they contain by producing a set of concepts related to the documents and terms. LSA assumes that words that are close in meaning will occur in similar pieces of text. A matrix containing word counts per paragraph (rows represent unique words and columns represent each paragraph) is constructed from a large piece of text and a mathematical technique called singular value decomposition (SVD) is used to reduce the number of columns while preserving the similarity structure among rows. Words are then compared by taking the cosine of the angle between the two vectors formed by any two rows. Values close to 1 represent very similar words while values close to 0 represent very dissimilar words.
LSA was patented in 1988 (US Patent 4,839,853) by Scott Deerwester, Susan Dumais, George Furnas, Richard Harshman, Thomas Landauer, Karen Lochbaum and Lynn Streeter. In the context of its application to information retrieval, it is sometimes called Latent Semantic Indexing (LSI).
from wiki http://en.wikipedia.org/wiki/Latent_semantic_analysis