Marvin Shapiro
Abstract
Improvements to the exhaustive search method of best-match file searching have previously been achieved by doing a preprocessing step involving the calculation of distances from a reference point. This paper discusses the proper choice of reference points and extends the previous algorithm to use more than one reference point. It is shown that reference points should be located outside of data clusters. The results of computer simulations are presented which show that large improvements can be achieved by the proper choice and location of multiple reference points.
- 1 Burkhard, W.A. and Keller, R.M.: Some approaches to bestmatch file searching. Comm. ACM, 16, 4 (April 1973), 230-236. Google Scholar
Digital Library
- 2 Cover, T.M. and Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Info. Theory, IT-13 (January 1967), 21-27.Google ScholarCross Ref
Recommendations
Some approaches to best-match file searching
The problem of searching the set of keys in a file to find a key which is closest to a given query key is discussed. After “closest,” in terms of a metric on the the key space, is suitably defined, three file structures are presented together with their ...
Interactive file searching using file metadata and visualization
BCS '10: Proceedings of the 24th BCS Interaction Specialist Group ConferenceNavigation and browsing on a computer system are usually done using the file system hierarchy. However, this is not the most adequate method to search or locate a given file at a later time, unless we know exactly where it is. In this paper, we present ...
Comments