順位キューを用いた多次元データの高速近傍検索アルゴリズム

DOI DOI Web Site Web Site Web Site ほか1件をすべて表示 一部だけ表示 被引用文献3件 参考文献37件 オープンアクセス

書誌事項

タイトル別名
  • Fast Multidimensional Nearest Neighbor Search Algorithm Using Priority Queue
  • ジュンイ キュー オ モチイタ タジゲン データ ノ コウソク キンボウ ケンサク アルゴリズム

この論文をさがす

説明

Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of applications, including multimedia information retrieval, data mining, and pattern recognition. For such applications, the curse of high dimensionality tends to be a major obstacle in the development of efficient search methods. This paper addresses the problem of designing an efficient algorithm for high dimensional nearest neighbor search using a priority queue. The proposed algorithm is based on a simple linear search algorithm and eliminates unnecessary arithmetic operations from distance computations between multidimensional vectors. Moreover, we propose two techniques, a dimensional sorting method and a PCA-based method, to accelerate multidimensional search. Experimental results indicate that our scheme scales well even for a very large number of dimensions.

収録刊行物

被引用文献 (3)*注記

もっと見る

参考文献 (37)*注記

もっと見る

関連プロジェクト

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ