The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Matrices, Vector Spaces, and Information Retrieval
Abstract
The evolution of digital libraries and the Internet has dramatically transformed the processing, storage, and retrieval of information. Efforts to digitize text, images, video, and audio now consume a substantial portion of both academic and industrial activity. Even when there is no shortage of textual materials on a particular topic, procedures for indexing or extracting the knowledge or conceptual information contained in them can be lacking. Recently developed information retrieval technologies are based on the concept of a vector space. Data are modeled as a matrix, and a user's query of the database is represented as a vector. Relevant documents in the database are then identified via simple vector operations. Orthogonal factorizations of the matrix provide mechanisms for handling uncertainty in the database itself. The purpose of this paper is to show how such fundamental mathematical concepts from linear algebra can be used to manage and index large text collections.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
A STATISTICAL INTERPRETATION OF TERM SPECIFICITY AND ITS APPLICATION IN RETRIEVAL
SPARCK JONES, K. (1972) · Journal of Documentation · doi:10.1108/eb026526 · Cited by 4,505
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods
Barrett, R., Berry, M., Chan, T. F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., & van der Vorst, H. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971538 · Cited by 3,479
Self-citationNumerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,757
Digital processing of speech signals
(1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90010-2 · Cited by 2,635
Improving retrieval performance by relevance feedback
Salton, G., & Buckley, C. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199006)41:4<288::aid-asi8>3.0.co;2-h · Cited by 1,495
Using Linear Algebra for Intelligent Information Retrieval
Berry, M. W., Dumais, S. T., & O’Brien, G. W. (1995) · SIAM Review · doi:10.1137/1037127 · Cited by 1,481
Self-citationDevelopment of a Stemming Algorithm
Lovins, J. B. (1968) · Mech. Transl. Comput. Linguistics · Cited by 1,115
Lawrence, S., & Giles, C. L. (1998) · Science · doi:10.1126/science.280.5360.98 · Cited by 969
Automatic information organization and retrieval
Salton, G. (1968) · Medical Entomology and Zoology · Cited by 920
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
Lehoucq, R. B., & Sorensen, D. C. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895281484 · Cited by 618
SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
MIRSKY, L. (1960) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/11.1.50 · Cited by 611
Improving the retrieval of information from external sources
Dumais, S. T. (1991) · Behavior Research Methods, Instruments, & Computers · doi:10.3758/bf03203370 · Cited by 579
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
Automatic Query expansion using SMART : TREC 3
Buckley, C., Salton, G., Allan, J., & Singhal, A. (1994) · Cited by 464
Large-Scale Sparse Singular Value Computations
Berry, M. W. (1992) · The International Journal of Supercomputing Applications · doi:10.1177/109434209200600103 · Cited by 402
Self-citationOverview of the third text Retrieval conference (TREC-3)
Harman, D. K. (1995) · doi:10.6028/nist.sp.500-225 · Cited by 378
Pictures of relevance: A geometric analysis of similarity measures
Jones, W. P., & Furnas, G. W. (1987) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(198711)38:6<420::aid-asi3>3.0.co;2-s · Cited by 244
Latent Semantic Indexing (LSI) and TREC-2.
Dumais, S. (1993) · Cited by 205
Large-scale information retrieval with latent semantic indexing
Letsche, T. A., & Berry, M. W. (1997) · Information Sciences · doi:10.1016/s0020-0255(97)00044-3 · Cited by 183
Self-citationRank degeneracy and least squares problems
Golub, G. H., Klema, V. C., & Stewart, G. W. (1976) · Cited by 175
Simultaneous iteration method for symmetric matrices
Rutishauser, H. (1970) · Numerische Mathematik · doi:10.1007/bf02219773 · Cited by 157
Applications of seismic travel-time tomography
Bording, R. P., Gersztenkorn, A., Lines, L. R., Scales, J. A., & Treitel, S. (1987) · Geophysical Journal International · doi:10.1111/j.1365-246x.1987.tb00728.x · Cited by 135
Overview of the fifth text REtrieval conference (TREC-5)
Voorhees, E. M., & Harman, D. K. (1996) · Cited by 133
Françoise Tisseur, B., & Dongarra, J. J. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598336951 · Cited by 107
SVDPACKC (Version 1.0) User''s Guide
Berry, M. W., Do, T., O'Brien, G., A, V. K., & Varadhan, S. (1993) · Cited by 89
Self-citationLow-rank Orthogonal Decompositions for Information Retrieval Applications
Berry, M. W., & Fierro, R. D. (1996) · Numerical Linear Algebra with Applications · doi:10.1002/(sici)1099-1506(199607/08)3:4 · Cited by 75
Self-citationOverview of the Third Text Retrieval Conference (TREC-3)
Harmon, D. K. (1996) · Cited by 74
Analysis and implementation of an implicitly restarted Arnoldi iteration
Lehoucq, R. B. (1996) · Rice Research Repository (Rice University) · Cited by 73
The Bowker annual : library and book trade almanac
Simora, F., Harris, P., Spier, M. M., Barr, C., Blixrud, J. C., & Bogart, D. (1989) · R.R. Bowker eBooks · Cited by 65
Stewart, G. W. (1984) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0905030 · Cited by 56
Singular Value Analysis of Cryptograms
Moler, C., & Morrison, D. (1983) · American Mathematical Monthly · doi:10.1080/00029890.1983.11971162 · Cited by 37
Outer Product Expansions and Their Uses in Digital Image Processing
Andrews, H. C., & Patterson, C. L. (1975) · American Mathematical Monthly · doi:10.1080/00029890.1975.11993760 · Cited by 27
Cited by
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
Dumais, S. T. (2004) · Annual Review of Information Science and Technology · doi:10.1002/aris.1440380105 · Cited by 1,107
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
Kim, H., & Park, H. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm134 · Cited by 863
Metadata
- Authors
- Berry, M. W., Drmac, Z., & Jessup, E. R.
- Venue
- SIAM Review
- Published
- 1999-01
- Volume
- 41
- Issue
- 2
- Pages
- 335-362
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1982114217
- Cited by
- 692
- References
- 42
- FWCI
- 38.03
- Type
- journal article
- Language
- en
- Open access
- closed
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.