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
Nearest-Neighbor Searching and Metric Space Dimensions
TL;DR: Several measures of dimension can be estimated using nearest-neighbor searching, while others can be used to estimate the cost of that searching.
Book ChapterDOI
Proximity Matching Using Fixed-Queries Trees
TL;DR: This work presents a new data structure, called the fixed-queries tree, for the problem of finding all elements of a fixed set that are close to a query element under some distance function.
Journal ArticleDOI
Fast indexing and visualization of metric data sets using slim-trees
TL;DR: The slim-tree is a metric access method that tackles the problem of overlaps between nodes in metric spaces and that allows one to minimize the overlap, and how to improve the performance of a metric tree through the proposed "slim-down" algorithm is shown.
Journal ArticleDOI
Effective Proximity Retrieval by Ordering Permutations
K. Figueroa,Gonzalo Navarro +1 more
TL;DR: A new probabilistic proximity search algorithm for range and A"-nearest neighbor (A"-NN) searching in both coordinate and metric spaces is introduced to predict closeness between elements according to how they order their distances toward a distinguished set of anchor objects.
Journal ArticleDOI
Pivot selection techniques for proximity searching in metric spaces
TL;DR: It is shown that good pivots are outliers, but that selecting outliers does not ensure that good pivotots are selected, and an efficiency measure to compare two pivot sets is proposed.
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.