78 search results - page 7 / 16 » On low dimensional random projections and similarity search |
TKDE
2011
13 years 2 months ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
ICDE
2000
IEEE
14 years 8 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...