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
Proceedings Article
Finding Motifs in Time Series
TL;DR: An efficient motif discovery algorithm for time series would be useful as a tool for summarizing and visualizing massive time series databases and could be used as a subroutine in various other data mining tasks, including the discovery of association rules, clustering and classification.
Journal ArticleDOI
Index-driven similarity search in metric spaces (Survey Article)
Gísli R. Hjaltason,Hanan Samet +1 more
TL;DR: This article focuses on methods for similarity search that make the general assumption that similarity is represented with a distance metric d, and presents algorithms for common types of queries that operate on an arbitrary "search hierarchy."
Proceedings ArticleDOI
Distance-based indexing for high-dimensional metric spaces
Tolga Bozkaya,Meral Ozsoyoglu +1 more
TL;DR: This paper introduces a distance based index structure called multi-vantage point (mvp) tree for similarity queries on high-dimensional metric spaces and shows that mvp-tree outperforms the vp-tree 20% to 80% for varying query ranges and different distance distributions.
Journal ArticleDOI
On k-Nearest Neighbor Voronoi Diagrams in the Plane
TL;DR: It is shown that the k-nearest neighbor problem and other seemingly unrelated problems can be solved efficiently with the Voronoi diagram.
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.