The Nearest Neighbour Problem in Information Retrieval: An Algorithm Using Upperbounds.

@inproceedings{DBLP:conf/sigir/SmeatonR81,
  author    = {Alan F. Smeaton and
               C. J. van Rijsbergen},
  editor    = {Carolyn J. Crouch},
  title     = {The Nearest Neighbour Problem in Information Retrieval: An Algorithm
               Using Upperbounds},
  booktitle = {Theoretical Issues in Information Retrieval, Proceedings of the
               Fourth International Conference on Information Storage and Retrieval,
                Oakland, California, USA, May 31 - June 2, 1981},
  publisher = {ACM},
  year      = {1981},
  isbn      = {0-89791-052-4},
  pages     = {83-87},
  ee        = {db/conf/sigir/SmeatonR81.html},
  crossref  = {DBLP:conf/sigir/81},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1981 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

Referenced by

1. Wai Yee Peter Wong, Dik Lun Lee: A Heuristic Method for Document Ranking. DASFAA 1991: 507-516