The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Information retrieval using a singular value decomposition model of latent semantic structure
Open accessAbstract
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 the detection of relevant documents on the basis of terms found in queries. 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 and terms are represented as vectors in a 50- to 150- dimensional space. Queries are represented as pseudo-documents vectors formed from weighted combinations of terms, and documents are ordered by their similarity to the query. Initial tests find this automatic method very promising.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to modern information retrieval
Dillon, M. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90062-6 · Cited by 5,909
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
Automatic information organization and retrieval
Salton, G. (1968) · Medical Entomology and Zoology · Cited by 920
Journal of the American Society for Information Science
(1984) · Journal of the American Society for Information Science · doi:10.1002/asi.4630350221 · Cited by 768
The use of hierarchic clustering in information retrieval
Jardine, N., & van Rijsbergen, C. J. (1971) · Information Processing & Management · doi:10.1016/0020-0271(71)90051-9 · Cited by 603
Carroll, J. D., & Arabie, P. (1980) · Annual Review of Psychology · doi:10.1146/annurev.ps.31.020180.003135 · Cited by 321
Subject access in online catalogs: A design model
Bates, M. J. (1986) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(198611)37:6<357::aid-asi1>3.0.co;2-h · Cited by 276
Automatic Document Classification
Borko, H., & Bernick, M. (1963) · Journal of the ACM · doi:10.1145/321160.321165 · Cited by 187
Data preprocessing and the extended PARAFAC model
Harshman, R. A. (1984) · Medical Entomology and Zoology · Cited by 148
Self-citationStatistical semantics: analysis of the potential performance of keyword information systems
Furnas, G. W., Landauer, T., Gomez, L. M., et al. (1984) · Ablex Publishing Corp. eBooks · Cited by 88
Self-citation
Cited by
The probabilistic relevance framework: BM25 and beyond
Robertson, S., & Zaragoza, H. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000019 · Cited by 3,374
Personalized information delivery: an analysis of information filtering methods
Foltz, P. W., & Dumais, S. T. (1992) · Communications of the ACM · doi:10.1145/138859.138866 · Cited by 500
Self-citationExpertise recommender: a flexible recommendation system and architecture
McDonald, D. W., & Ackerman, M. S. (2000) · Proceedings of the 2000 ACM conference on Computer supported cooperative work · doi:10.1145/358916.358994 · Cited by 425
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
Tag recommendations based on tensor dimensionality reduction
Symeonidis, P., Nanopoulos, A., & Manolopoulos, Y. (2008) · Proceedings of the 2008 ACM conference on Recommender systems · doi:10.1145/1454008.1454017 · Cited by 310
Metadata
- Authors
- Furnas, G. W., Deerwester, S., Dumais, S. T., Landauer, T. K., Harshman, R. A., Streeter, L. A., & Lochbaum, K. E.
- Venue
- Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '88
- Publisher
- ACM Press
- Published
- 1988
- Pages
- 465-480
- OpenAlex
- W4245049592
- Cited by
- 257
- References
- 10
- FWCI
- 1.96
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.