259 search results - page 14 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
193
click to vote
ICDE
2012
IEEE
13 years 2 days ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
172
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
123
click to vote
SISAP
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
CIKM
2003
Springer
15 years 2 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...