By Topic

Towards optimal clustering for approximate similarity searching

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
$31 $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)
Tuncel, E. ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA ; Rose, K.

We propose an iterative optimization algorithm for the generic class of clustering-based indexing for approximate similarity searching. It was previously shown that clustering is a powerful component of approximate searching that reduces the number of retrieved data points. The objective of the proposed algorithm is to maximize the expected search quality given the query distribution. The problem is decomposed into minimization over three mapping functions, and fixed-point iterations of the algorithm alternately optimizing one mapping while fixing the other two. We demonstrate via experiments on real high dimensional data sets that the algorithm significantly improves the time/accuracy efficiency over heuristic clustering design.

Published in:

Multimedia and Expo, 2002. ICME '02. Proceedings. 2002 IEEE International Conference on  (Volume:2 )

Date of Conference: