255 search results - page 10 / 51 » On the Effects of Dimensionality Reduction on High Dimension... |
VLDB
2000
ACM
14 years 1 months ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
102
click to vote
ICDE
2000
IEEE
14 years 11 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
DSMML
2004
Springer
14 years 3 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
ICDM
2002
IEEE
14 years 3 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
ICDE
2002
IEEE
14 years 3 months ago
2002
IEEE
We consider the use of wavelet transformations as a dimensionality reduction technique to permit efficient similarity search over high-dimensional time-series data. While numerou...