259 search results - page 17 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
102
click to vote
ALENEX
2001
14 years 11 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
68
Voted
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
In previous work, we have proposed a novel approach to data clustering based on the explicit optimization of a partitioning with respect to two complementary clustering objectives ...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...
TKDE
2008
14 years 9 months ago
2008
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
114
Voted
CGF
2010
14 years 6 months ago
2010
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...