论文信息 - The nearest neighbour problem in information retrieval: an algorithm using upperbounds - 字舞流文

The nearest neighbour problem in information retrieval: an algorithm using upperbounds

C. J. van Rijsbergen | Alan F. Smeaton | C. J. V. Rijsbergen | A. Smeaton

[1] Peter Willett. A fast procedure for the calculation of similarity coefficients in automatic classification , 1981, Inf. Process. Manag..

[2] C. J. van Rijsbergen,et al. The selection of good search terms , 1981, Inf. Process. Manag..

[3] Peter Willett,et al. Indexing exhaustivity and the computation of similarity matrices , 1980, J. Am. Soc. Inf. Sci..

[4] Stephen F. Weiss,et al. A probabilistic algorithm for nearest neighbour searching , 1980, SIGIR '80.

[5] Caroline M. Eastman,et al. A tree algorithm for nearest neighbor searching in document retrieval systems , 1978, SIGIR '78.

[6] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[7] P. K. T. Vaswani,et al. The National Physical Laboratory Experiments in Statistical Word Associations and Their Use in Document Indexing And Retrieval. , 1970 .