title: Deterministic binary vectors for efficient automated indexing of MEDLINE/PubMed abstracts.
abstract: The need to maintain accessibility of the biomedical literature has led to development of methods to assist human indexers by recommending index terms for newly encountered articles. Given the rapid expansion of this literature, it is essential that these methods be scalable. Document vector representations are commonly used for automated indexing, and Random Indexing (RI) provides the means to generate them efficiently. However, RI is difficult to implement in real-world indexing systems, as (1) efficient nearest-neighbor search requires retaining all document vectors in RAM, and (2) it is necessary to maintain a store of randomly generated term vectors to index future documents. Motivated by these concerns, this paper documents the development and evaluation of a deterministic binary variant of RI. The increased capacity demonstrated by binary vectors has implications for information retrieval, and the elimination of the need to retain term vectors facilitates distributed implementations, enhancing the scalability of RI.
authors.affiliation: The University of Texas Health Science Center at Houston, School of Biomedical Informatics, USA.
authors.forename: Manuel
authors.initials: M
authors.lastname: Wahle
authors.forename: Dominic
authors.initials: D
authors.lastname: Widdows
authors.forename: Jorge R
authors.initials: JR
authors.lastname: Herskovic
authors.forename: Elmer V
authors.initials: EV
authors.lastname: Bernstam
authors.forename: Trevor
authors.initials: T
authors.lastname: Cohen
mesh_terms: D000043:Abstracting and Indexing / Q000379:methods*; D016239:MEDLINE; D046650:Medical Subject Headings; D008962:Models, Theoretical; D009323:Natural Language Processing; D039781:PubMed