By Topic

Improvement by sorting and thresholding in PCA based nearest neighbor search

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

4 Author(s)
Hidetomo Ichihashi ; Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Nakaku, Sakai, 599-8531, Japan ; Toshiro Ogita ; Katsuhiro Honda ; Akira Notsu

This paper proposes a revised algorithm of the nearest neighbor searching (NNS) with the PCA based binary tree data structure by Sproull [1]. In the PCA-tree, by the successive use of principal component analysis (PCA), database is partitioned into clusters. A cluster corresponds to a node of a complete binary tree. In the search step, the algorithm first choses a leaf node, i.e., a cluster, which is likely to include the nearest neighbor (NN) point. Then the exhaustive search only in the node is done. Other leaf nodes which are also likely to include the NN point are searched by the back tracking approach. The performance is improved by sorting the data on a leaf node to leaf node basis and updating the threshold value for choosing nodes by the minimum distance found so far. Sorting the data into leaf nodes contributes greatly to the improvement in the detection time of NN points. The threshold updating in ε-approximate nearest neighbors approach and a fixed threshold approach is enough efficient to cope with the deterioration of accuracy. The advantage of our revised approach is not only in the detection time but also in the computer memory usage. The k-dimensional tree approach [2], [3] used in this paper does not need large sized additional tables, whereas the popular NNS algorithms with multiple hash functions method need significantly large tables for large sized databases.

Published in:

Fuzzy Systems (FUZZ-IEEE), 2012 IEEE International Conference on

Date of Conference:

10-15 June 2012