259 search results - page 22 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
101
click to vote
SSDBM
2009
IEEE
15 years 4 months ago
2009
IEEE
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
IS
2008
14 years 9 months ago
2008
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...
115
click to vote
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
127
click to vote
TKDE
2012
13 years 2 days ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
100
click to vote
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...