Using Genetic Algorithm to Balance the D-Index Algorithm for Metric Search

Authors:
Tao Ban
Affiliations:
Information Security Research Center, National Institute of Information and Communications Technology, Tokyo, Japan 184-8795
Venue:
Neural Information Processing
Year:
2008

Citing 7
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
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
Theory of genetic algorithms

Theoretical Computer Science
Supporting Ranked Boolean Similarity Queries in MARS

IEEE Transactions on Knowledge and Data Engineering
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
D-Index: Distance Searching Index for Metric Data Sets

Multimedia Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Distance Index (D-index) is a recently introduced metric indexing structure which capable of state-of-the-art performance in large scale metric search applications. In this paper we address the problem of how to balance the D-index structure for more efficient similarity search. A group of evaluation functions measuring the balance property of a D-index structure are introduced to guide the construction of the indexing structure. The optimization is formulated in a genetic representation that is effectively solved by a generic genetic algorithm (GA). Compared with the classic D-index, balanced D-index structures show a significant improvement in reduction of distance calculations while maintaining a good input-output (IO) performance.