G. Salton, A. Wong, и C. Yang. Communications of the ACM, 18 (11):
613-620(1975)The paper where vector space model for IR was introduced.
Аннотация
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.
%0 Journal Article
%1 Salton:1975
%A Salton, Gerard
%A Wong, Anita
%A Yang, Chung-Shu
%D 1975
%J Communications of the ACM
%K ir master vectorspacemodel
%N 11
%P 613-620
%T A Vector Space Model for Automatic Indexing
%V 18
%X 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.
@article{Salton:1975,
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.},
added-at = {2011-03-22T23:24:50.000+0100},
author = {Salton, Gerard and Wong, Anita and Yang, Chung-Shu},
biburl = {https://www.bibsonomy.org/bibtex/21096b4711e20c4523f8830bb90e2cfe6/ans},
bkey = {Salton et al.},
interhash = {0a4c67f15a4869634d8e5e39ba3e7113},
intrahash = {1096b4711e20c4523f8830bb90e2cfe6},
journal = {Communications of the ACM},
keywords = {ir master vectorspacemodel},
library = {File cabinet},
note = {The paper where vector space model for IR was introduced},
number = 11,
pages = {613-620},
timestamp = {2011-03-22T23:24:51.000+0100},
title = {A Vector Space Model for Automatic Indexing},
volume = 18,
year = 1975
}