58 search results - page 2 / 12 » An Adaptive and Efficient Dimensionality Reduction Algorithm... |
PCM
2001
Springer
13 years 9 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...
ICDM
2002
IEEE
13 years 9 months ago
2002
IEEE
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
EDBT
2000
ACM
13 years 9 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
ICDE
1998
IEEE
14 years 6 months ago
1998
IEEE
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...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...