Journal ArticleDOI
Some approaches to best-match file searching
W. A. Burkhard,Robert M. Keller +1 more
Reads0
Chats0
TLDR
Three file structures are presented together with their corresponding search algorithms, which are intended to reduce the number of comparisons required to achieve the desired result.Abstract:
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 corresponding search algorithms, which are intended to reduce the number of comparisons required to achieve the desired result. These methods are derived using certain inequalities satisfied by metrics and by graph-theoretic concepts. Some empirical results are presented which compare the efficiency of the methods.read more
Citations
More filters
Journal ArticleDOI
Hashing algorithms and data structures for rapid searches of fingerprint vectors.
TL;DR: It is shown how one can rapidly compute a bound on the Jaccard-Tanimoto similarity measure of the two corresponding fingerprints, using the intersection bound, which allows one to significantly prune the search space by discarding molecules associated with unfavorable bounds.
Journal ArticleDOI
Planar shape recognition by shape morphing
TL;DR: A search strategy is described that obviates an exhaustive search of the template database during recognition experiments and the dissimilarity measure is shown to have the properties of a metric as well as invariance to Euclidean transformations.
Journal ArticleDOI
Tree structures for high dimensionality nearest neighbor searching
TL;DR: A probabilistic version of the algorithm is presented which provides significantly faster searching with little degradation in retrieval quality and some savings over a sequential search can be achieved in this type of application.
Proceedings ArticleDOI
Selecting good keys for triangle-inequality-based pruning algorithms
TL;DR: This paper addresses the question of increasing performance of the proposed algorithms based on triangle inequality by the selection of appropriate key images by proposing and testing several algorithms for key selection.
References
More filters
Book
Perceptrons: An Introduction to Computational Geometry
Marvin Minsky,Seymour A. Papert +1 more
TL;DR: The aim of this book is to seek general results from the close study of abstract version of devices known as perceptrons.
Book
Shift register sequences
TL;DR: The Revised Edition of Shift Register Sequences contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences.
Journal ArticleDOI
An Analysis of Some Graph Theoretical Cluster Techniques
J. Gary Augustson,Jack Minker +1 more
TL;DR: Several graph theoretic cluster techniques aimed at the automatic generation of thesauri for information retrieval systems are explored and two algorithms have been tested that find maximal complete subgraphs.
Journal ArticleDOI
Scatter storage techniques
TL;DR: L'article donne une presentation didactique sur les methodes connues utilisees par ceux qui ecrivent les assembleurs and compilateurs de maniere a reduire les temps de recherche dans les tables de symboles.
Journal ArticleDOI
Corrections to Bierstone's Algorithm for Generating Cliques
TL;DR: The counterexamples to their and the modified version of the Bierstone algorithm for finding the set of cliques of a finite undirected linear graph are presented.