Sciweavers

43 search results - page 1 / 9
» Twisting the Metric Space to Achieve Better Metric Trees
Sort
View
SBBD
2004
106views Database» more  SBBD 2004»
13 years 6 months ago
Twisting the Metric Space to Achieve Better Metric Trees
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
César Feijó Nadvorny, Carlos A. Heus...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 8 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
PAAPP
2006
85views more  PAAPP 2006»
13 years 4 months ago
A new metric splitting criterion for decision trees
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partiti...
Dan A. Simovici, Szymon Jaroszewicz
MIR
2006
ACM
162views Multimedia» more  MIR 2006»
13 years 10 months ago
Dynamic similarity search in multi-metric spaces
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
Benjamin Bustos, Tomás Skopal
SEBD
1997
158views Database» more  SEBD 1997»
13 years 5 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...