Skip to content

A vector space model for automatic indexing

Gerard Salton, Chul‐Su Yang

Communications of the ACM · 1975 · 7,788 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Salton, G., Wong, A., & Yang, C. (1975). A vector space model for automatic indexing. Communications of the ACM, 18(11), 613–620. https://doi.org/10.1145/361219.361220

In text: (Salton et al., 1975)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

In a document retrieval, or other pattern matching environment where stored entities (documents) are compared with each other or with incoming patterns (search requests), it appears that the best indexing (property) space is one where each entity lies as far away from the others as possible; in these circumstances the value of an indexing system may be expressible as a function of the density of the object space; in particular, retrieval performance may correlate inversely with space density. An approach based on space density computations is used to choose an optimum indexing vocabulary for a collection of documents. Typical evaluation results are shown, demonstating the usefulness of the model.

  1. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs1997
  2. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome2009
  3. MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform2002
  4. Introduction to Algorithms1991
  5. Fast and accurate long-read alignment with Burrows–Wheeler transform2010

Metadata from OpenAlex (CC0). Citations are generated from the published record.