New prune rules for similarity search

Authors:
Tao Ban;Youki Kadobayashi
Affiliations:
National Institute of Info. and Comm. Technology, Tokyo, Japan;Nara Institute of Science and Technology, Nara, Japan
Venue:
ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
Year:
2007

Citing 12
Cited 0

New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)

Pattern Recognition Letters
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements

Pattern Recognition Letters
A fast branch & bound nearest neighbour classifier in metric spaces

Pattern Recognition Letters
Data structures and algorithms for nearest neighbor search in general metric spaces

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Some approaches to best-match file searching

Communications of the ACM
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Near Neighbor Search in Large Metric Spaces

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
D-Index: Distance Searching Index for Metric Data Sets

Multimedia Tools and Applications
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Similarity Search: The Metric Space Approach (Advances in Database Systems)

Similarity Search: The Metric Space Approach (Advances in Database Systems)
Some approaches to improve tree-based nearest neighbour search algorithms

Pattern Recognition
A Branch and Bound Algorithm for Computing k-Nearest Neighbors

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a novel class of prune rules for metric indexing algorithms. The rules are derived from the geometrical properties in the low dimensional embedding space and are applicable to positive semi-definite metrics. The proposed prune rules are cheap both in computation and storage cost and can be readily incorporated with available metric indexing structures. In the simulation experiments, the Geometric Near-neighbor Access Tree with the proposed prune rules shows preferable pruning ability especially on large datasets with high dimensions.