78 search results - page 2 / 16 » On low dimensional random projections and similarity search |
WWW
2003
ACM
14 years 5 months ago
2003
ACM
The presence of replicas or near-replicas of documents is very common on the Web. Documents may be replicated completely or partially for different reasons (versions, mirrors, etc...
CSDA
2008
13 years 5 months ago
2008
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
WIRN
2005
Springer
13 years 10 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
KDD
2001
ACM
14 years 5 months ago
2001
ACM
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
SSIAI
2002
IEEE
13 years 10 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...