Show simple item record

dc.contributor.authorSalton, Gerarden_US
dc.contributor.authorWong, A.en_US
dc.contributor.authorYang, C. S.en_US
dc.date.accessioned2007-04-19T19:08:45Z
dc.date.available2007-04-19T19:08:45Z
dc.date.issued1974-07en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-218en_US
dc.identifier.urihttps://hdl.handle.net/1813/6057
dc.description.abstractIn a document retieval, 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; that is, retrieval performance correlates inversely with space density. This result is used to choose an optimum indexing vocabulary for a collection of documents. Typical evaluation results are shown demonstrating the usefulness of the model.en_US
dc.format.extent1156192 bytes
dc.format.extent480346 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Vector Space Model for Automatic Indexingen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics