259 search results - page 5 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
107
click to vote
SIGMOD
2000
ACM
15 years 2 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
ICDM
2003
IEEE
15 years 2 months ago
2003
IEEE
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
178
click to vote
ICDE
1998
IEEE
15 years 11 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...
122
Voted
PODS
2001
ACM
15 years 9 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...