By Topic

DDS: an efficient dynamic dimension selection algorithm for nearest neighbor search in high dimensions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chia-Chen Kuo ; Electr. Eng. Dept., Nat. Taiwan Univ., Taipei, Taiwan ; Ming-Syan Chen

The nearest neighbor search problem is defined as follows: given a set P of n points, answer queries for finding the closest point in P to the query point. In the past few years, there has been increasing interest in performing similarity search over high dimensional data, especially for multimedia applications. Unfortunately, most well-known techniques for solving this problem suffer from the "curse of dimensionality" that means the performance of the system scales poorly with increased dimensionality of the underlying data. The refined algorithms typically achieve a query time that is logarithmic in the quantity of points and exponential in the number of dimensions. However, once the number of dimension exceeds 15, searching in k-d trees or related structures involves the examination of a large fraction of the search space, thereby performing no better than exhaustive search. In view of this, we propose an efficient dynamic dimension selection algorithm to improve the performance of the nearest neighbor search especially in high dimensions

Published in:

Multimedia and Expo, 2004. ICME '04. 2004 IEEE International Conference on  (Volume:2 )

Date of Conference:

30-30 June 2004