This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...