Filters








4,821 Hits in 10.3 sec

Information Retrieval using a Singular Value Decomposition Model of Latent Semantic Structure

George W. Furnas, Scott Deerwester, Susan T. Durnais, Thomas K. Landauer, Richard A. Harshman, Lynn A. Streeter, Karen E. Lochbaum
2017 SIGIR Forum  
Singular-value decomposition is used to decompose a large term by document matrix into 50 to 150 orthogonal factors from which the original matrix can be approximated by linear combination; both documents  ...  In a new method for automatic indexing and retrieval, implicit higher-order structure in the association of terms with documents is modeled to improve estimates of term-document association, and therefore  ...  These calculations have exact analogs in the latent model, just using the components of the Singular Value Decomposition.  ... 
doi:10.1145/3130348.3130358 fatcat:dsw7mywxrjaqddmjdfjj3aldl4

Information retrieval using a singular value decomposition model of latent semantic structure

G. W. Furnas, S. Deerwester, S. T. Dumais, T. K. Landauer, R. A. Harshman, L. A. Streeter, K. E. Lochbaum
1988 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '88  
TFxIDF score • Perform SVD to obtain term and document vectors represented in the latent semantic space • Evaluate the information retrieval capability of the LSA approach by using varying sizes (e.g.  ...  latent semantic space (docs are sorted in descending order of their cosine values) Query is represented by the weighted sum of it constituent term vectors scaled by the inverse of singular values.The  ... 
doi:10.1145/62437.62487 dblp:conf/sigir/FurnasDDLHSL88 fatcat:k6bsbacktnadnkpioe34mctwnm

Framework for Document Retrieval using Latent Semantic Indexing

Neelam Phadnis, Jayant Gadge
2014 International Journal of Computer Applications  
Latent Semantic Indexing (LSI) model is a concept based retrieval method that exploits the idea of vector space model and singular value decomposition.  ...  Searching for information and deriving useful facts will become more cumbersome. How to extract a lot of information quickly and effectively has become the focus of current research and hot topics.  ...  In latent semantic indexing, singular value decomposition is used to construct a low rank approximation C K for a value of K that is far smaller than the original rank of C.  ... 
doi:10.5120/16414-6065 fatcat:n4zx75guezf5ngzsful5t2j7l4

Bioingenium at ImageClefmed 2010: A Latent Semantic Approach

Jose G. Moreno, Juan C. Caicedo, Fabio A. González
2010 Conference and Labs of the Evaluation Forum  
The proposed strategy is based on the use of Non-Negative Matrix Factorization to decompose matrix data and build latent semantic spaces.  ...  The work aimed to explore semantic relationships in textual information and transfer into visual information by building a unified image searching index.  ...  A Singular Value Decomposition (SVD) of the term-document matrix is used in information retrieval to construct latent semantic spaces so that documents that refer to certain topics can be highly scored  ... 
dblp:conf/clef/MorenoCG10 fatcat:e3dfprqu2jg7hk422qd6rahcta

Latent semantic indexing model for Boolean query formulation (poster session)

Dae-Ho Baek, HeuiSeok Lim, Hae-Chang Rim
2000 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '00  
A new model named Boolean Latent Semantic Indexing model based on the Singular Value Decomposition and Boolean query formulation is introduced.  ...  While the Singular Value Decomposition alleviates the problems of lexical matching in the traditional information retrieval model, Boolean query formulation can help users to make precise representation  ...  Nowadays, most of the commercial information retrieval systems use the extended Boolean retrieval model because trained users can make precise representation of their information search needs using structured  ... 
doi:10.1145/345508.345612 dblp:conf/sigir/BaekLR00 fatcat:ugiuwi4zrjco3ps3hwnvbt3dhi

Page 230 of Behavior Research Methods Vol. 23, Issue 2 [page]

1991 Behavior Research Methods  
A description of terms, objects, and user queries based on the underlying latent semantic structure, rather than surface-level words, is used for representing and retrieving information.  ...  The particular latent semantic indexing analysis that we have tried involves singular value decomposition (SVD), a technique closely related to eigenvector decom¬ position and factor analysis (Cullum &  ... 

Indian Languages IR using Latent Semantic Indexing

A.P SivaKumar, P Premchand, A Govardhan
2011 International Journal of Computer Science & Information Technology (IJCSIT)  
This paper uses the Singular Value Decomposition (SVD) of LSI technique to achieve effective indexing for English and Hindi languages.  ...  Retrieving information from different languages may lead to many problems like polysemy and synonymy, which can be resolved by Latent Semantic Indexing (LSI) techniques.  ...  Latent Semantic Indexing uses a mathematical method called Singular Value Decomposition. This SVD is used for reducing dimensions of the term-by-document matrix.  ... 
doi:10.5121/ijcsit.2011.3419 fatcat:h6hknvw25vc3jb46q5uwumhxpq

AMATCHMETHOD BASED ON LATENT SEMANTIC ANALYSIS FOR EARTHQUAKEHAZARD EMERGENCY PLAN

D. Sun, S. Zhao, Z. Zhang, X. Shi
2017 The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
To solve the problem, this paper presents a match method based on Latent Semantic Analysis (LSA).  ...  The structure of the emergency plan on earthquake is complex, and it's difficult for decision maker to make a decision in a short time.  ...  ACKNOWLEDGEMENTS The research work was supported by the National Key R&D Program of China (No.:2016YFB0502503).  ... 
doi:10.5194/isprs-archives-xlii-2-w7-137-2017 fatcat:hi77ywf5qve4vg5wrdlmbtcqhu

A Markov Random Field Topic Space Model for Document Retrieval [article]

Scott Hand
2011 arXiv   pre-print
A parameter learning method is proposed that utilizes rank reduction with singular value decomposition in a matter similar to LSA to reduce dimensionality of document-term relationships to that of a latent  ...  It seeks to offer a more structured and extensible mathematical approach to the term generalization done in the popular Latent Semantic Analysis (LSA) approach to document indexing.  ...  Related Work Latent Semantic Analysis Latent Semantic Analysis (LSA) is a method used in information retrieval for smoothing sets of document-term data.  ... 
arXiv:1111.6640v1 fatcat:tm2tnilbnjdzxlfkc5ogy4c63e

A similarity-based probability model for latent semantic indexing

Chris H. Q. Ding
1999 Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '99  
A dual probability model is constructed for the Latent Semantic Indexing (LSI) using the cosine similarity measure.  ...  Dimensionslity reduction is justified by the statistical significance of latent semantic vectors as measured by the likelihood of the model.  ...  LSI attempts to capture the underlying or latent semantic structures,' which better index the documents than individual indexing te~ms, by the truncated singular value decomposition (SVD) of the term-document  ... 
doi:10.1145/312624.312652 dblp:conf/sigir/Ding99 fatcat:jquv57g3mvgpte6v7h2dvgv4mu

An infrastructure for open latent semantic linking

Alessandra Alaniz Macedo, Maria da Graca Campos Pimentel, Jose Antonio Camacho-Guerrero
2002 Proceedings of the thirteenth ACM conference on Hypertext and hypermedia - HYPERTEXT '02  
Latent Semantic Analysis has been proposed by the information retrieval community as an attempt to organize automatically text objects into a semantic structure appropriate for matching.  ...  This paper presents an infrastructure allowing the use of latent semantic analysis and open hypermedia concepts in the automatic identification of relationships among web pages.  ...  Acknowledgments Alessandra Macedo is a PhD candidate and Jose Antonio Camacho is a MSc candidate and both are supported by FAPESP (99/115270 -00/141036).  ... 
doi:10.1145/513368.513369 fatcat:bx5xaw734vg5rdeoeosmtq6fme

An infrastructure for open latent semantic linking

Alessandra Alaniz Macedo, Maria da Graca Campos Pimentel, Jose Antonio Camacho-Guerrero
2002 Proceedings of the thirteenth ACM conference on Hypertext and hypermedia - HYPERTEXT '02  
Latent Semantic Analysis has been proposed by the information retrieval community as an attempt to organize automatically text objects into a semantic structure appropriate for matching.  ...  This paper presents an infrastructure allowing the use of latent semantic analysis and open hypermedia concepts in the automatic identification of relationships among web pages.  ...  Acknowledgments Alessandra Macedo is a PhD candidate and Jose Antonio Camacho is a MSc candidate and both are supported by FAPESP (99/115270 -00/141036).  ... 
doi:10.1145/513338.513369 dblp:conf/ht/MacedoPC02 fatcat:fwpuap5bm5huxpur546yps2ee4

LSI vs. Wordnet Ontology in Dimension Reduction for Information Retrieval

Pavel Moravec, Michal Kolovrat, Václav Snásel
2004 Databases, Texts, Specifications, Objects  
In the area of information retrieval, the dimension of document vectors plays an important role.  ...  LSI (Latent Semantic Indexing) is a numerical method, which discovers latent semantic in documents by creating concepts from existing terms. However, it is hard to compute LSI.  ...  Latent Semantic Indexing Latent semantic indexing (LSI ) [3, 4] is an algebraic extension of classical vector model.  ... 
dblp:conf/dateso/MoravecKS04 fatcat:e4miclys4ndqlde7bg3hu66vae

Concept based clustering for descriptive document classification

S. Senthamarai Kannan, N. Ramaraj
2007 Data Science Journal  
We present an approach for improving the relevance of search results by clustering the search results obtained for a query string with the help of a Concept Clustering Algorithm.  ...  The Concept Clustering Algorithm combines common phrase discovery and latent semantic indexing techniques to separate search results into meaningful groups.  ...  SINGULAR VALUE DECOMPOSITION AND LSI The use of the singular value decomposition (SVD) has been proposed for text retrieval in several recent works (Osiniski, et al, 2003) .  ... 
doi:10.2481/dsj.6.91 fatcat:wqeqmgyb2vdl5dolp4xvhlsfg4

Using Matrix Decompositions in Formal Concept Analysis

Václav Snásel, Petr Gajdos, Hussam M. Dahwa Abdulla, Martin Polovincak
2007 International Conference on Information System Implementation and Modeling  
In our research we try to modify an incidence matrix using matrix decompositions, creating a new matrix with fewer dimensions as an input for some known algorithms for lattice construction.  ...  One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all concepts from a huge  ...  Singular Value Decomposition Singular value decomposition (SVD) is well known because of its application in information retrieval as LSI.  ... 
dblp:conf/isim/SnaselGAP07 fatcat:p6o2vxytkvgxnesdwun5w7b7we
« Previous Showing results 1 — 15 out of 4,821 results