259 search results - page 2 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
PCM
2001
Springer
13 years 12 months ago
2001
Springer
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
MICAI
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
SISAP
2008
IEEE
14 years 1 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
CIKM
2000
Springer
13 years 11 months ago
2000
Springer
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...