Sciweavers

5771 search results - page 133 / 1155
» Learning similarity space
Sort
View
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
15 years 7 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
SDM
2007
SIAM
201views Data Mining» more  SDM 2007»
15 years 2 months ago
Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis ...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
127
Voted
DEXA
2010
Springer
187views Database» more  DEXA 2010»
14 years 10 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
84
Voted
COLT
2006
Springer
15 years 4 months ago
The Rademacher Complexity of Linear Transformation Classes
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
Andreas Maurer
94
Voted
IJON
2002
74views more  IJON 2002»
15 years 13 days ago
Optimal spontaneous activity in neural network modeling
We consider the origin of the high-dimensional input space as a variable which can be optimized before or during neuronal learning. This set of variables acts as a translation on ...
Daniel Remondini, Nathan Intrator, Gastone C. Cast...