Nearest neighbour searching in serial files using text signature
Journal of Information Science
Nearest neighbour searching in binary search trees: Simulation of a multiprocessor system
Journal of Documentation
A document retrieval system based on nearest neighbour searching
Journal of Information Science
Query processing for distance metrics
Proceedings of the sixteenth international conference on Very large databases
Hierarchical file organization and its application to similar-string matching
ACM Transactions on Database Systems (TODS)
On the estimation of the number of desired records with respect to a given query
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Techniques for Reducing Pen Plotting Time
ACM Transactions on Graphics (TOG)
The choice of reference points in best-match file searching
Communications of the ACM
The best-match problem in document retrieval
Communications of the ACM
Some approaches to best-match file searching
Communications of the ACM
Communications of the ACM
The nearest neighbour problem in information retrieval: an algorithm using upperbounds
SIGIR '81 Proceedings of the 4th annual international ACM SIGIR conference on Information storage and retrieval: theoretical issues in information retrieval
Information Retrieval
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Data Structures and Algorithms
Data Structures and Algorithms
Efficient Search in Very Large Databases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A tree algorithm for nearest neighbor searching in document retrieval systems
SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
Combinatorial pattern discovery for scientific data: some preliminary results
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Efficient processing of vague queries using a data stream approach
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Complexity Analysis for Partitioning Nearest Neighbor Searching Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Indexing large metric spaces for similarity search queries
ACM Transactions on Database Systems (TODS)
Best-Match Retrieval for Structured Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM Computing Surveys (CSUR)
A System for Approximate Tree Matching
IEEE Transactions on Knowledge and Data Engineering
Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
IEEE Transactions on Knowledge and Data Engineering
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
IEEE Transactions on Knowledge and Data Engineering
ACIRD: Intelligent Internet Document Organization and Retrieval
IEEE Transactions on Knowledge and Data Engineering
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Bitmap-Based Indexing for Multi-dimensional Multimedia XML Documents
ICADL '02 Proceedings of the 5th International Conference on Asian Digital Libraries: Digital Libraries: People, Knowledge, and Technology
Discovering informative content blocks from Web documents
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Survey on structure-based case retrieval
The Knowledge Engineering Review
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
t-Spanners for metric space searching
Data & Knowledge Engineering
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Discovery of skills from motion data
JSAI'03/JSAI04 Proceedings of the 2003 and 2004 international conference on New frontiers in artificial intelligence
| Hi-index | 0.00 |
A scheme to answer best-match queries from a file containing a collection of objects is described. A best-match query is to find the objects in the file that are closest (according to some (dis)similarity measure) to a given target.Previous work [5, 331] suggests that one can reduce the number of comparisons required to achieve the desired results using the triangle inequality, starting with a data structure for the file that reflects some precomputed intrafile distances. We generalize the technique to allow the optimum use of any given set of precomputed intrafile distances. Some empirical results are presented which illustrate the effectiveness of our scheme, and its performance relative to previous algorithms.