Indexing by latent semantic analysis

Indexing by latent semantic analysis (1990)

Cached

Download Links

Other Repositories/Bibliography

CiteULike
DBLP

by Scott Deerwester , Susan T. Dumais , George W. Furnas , Thomas K. Landauer , Richard Harshman

Venue:	JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE
Citations:	2168 - 30 self

Versions

Version History

Metadata Version 2

User correction supplied by jfernandez

Datum	Value	Source
TITLE	Indexing by latent semantic analysis	INFERENCE
AUTHOR NAME	Scott Deerwester	user correction
AUTHOR AFFIL	Center for Information and Language Studies, University of Chicago	user correction
AUTHOR ADDR	Chicago, IL 60637	user correction
AUTHOR NAME	Susan T. Dumais	user correction
AUTHOR AFFIL	Bell Communications Research	user correction
AUTHOR ADDR	445 South St., Morristown, NJ 07960	user correction
AUTHOR NAME	George W. Furnas	user correction
AUTHOR AFFIL	Bell Communications Research	user correction
AUTHOR ADDR	445 South St., Morristown, NJ 07960	user correction
AUTHOR NAME	Thomas K. Landauer	user correction
AUTHOR AFFIL	Bell Communications Research	user correction
AUTHOR ADDR	445 South St., Morristown, NJ 07960	user correction
AUTHOR NAME	Richard Harshman	user correction
AUTHOR AFFIL	University of Western Ontario	user correction
AUTHOR ADDR	London, Ontario Canada	user correction
ABSTRACT	A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (“semantic structure”) in order to improve the detection of relevant documents on the basis of terms found in queries. The particular technique used is singular-value decomposition, in which a large term by document matrix is decomposed into a set of ca. 100 or-thogonal factors from which the original matrix can be approximated by linear combination. Documents are represented by ca. 100 item vectors of factor weights. Queries are represented as pseudo-document vectors formed from weighted combinations of terms, and documents with supra-threshold cosine values are re-turned. initial tests find this completely automatic method for retrieval to be promising.	SVM HeaderParse 0.2
YEAR	1990	INFERENCE
VENUE	JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	391--407	INFERENCE
VOLUME	41	INFERENCE
NUMBER	6	user correction
CITATIONS	36 found	ParsCit 1.0